Zobrazeno 1 - 10
of 202
pro vyhledávání: '"Beckert, Bernhard"'
When validated neural networks (NNs) are pruned (and retrained) before deployment, it is desirable to prove that the new NN behaves equivalently to the (original) reference NN. To this end, our paper revisits the idea of differential verification whi
Externí odkaz:
http://arxiv.org/abs/2410.20207
Autor:
Teuber, Samuel, Beckert, Bernhard
This work presents insights gained by investigating the relationship between algorithmic fairness and the concept of secure information flow. The problem of enforcing secure information flow is well-studied in the context of information security: If
Externí odkaz:
http://arxiv.org/abs/2312.10128
A wide range of interesting program properties are intrinsically relational, i.e., they relate two or more program traces. Two prominent relational properties are secure information flow and conditional program equivalence. By showing the absence of
Externí odkaz:
http://arxiv.org/abs/1910.09068
Autor:
Herda, Mihai, Kirsten, Michael, Brunner, Etienne, Plewnia, Joana, Scheler, Ulla, Staudenmaier, Chiara, Wagner, Benedikt, Zwick, Pascal, Beckert, Bernhard
Publikováno v:
EPTCS 296, 2019, pp. 6-13
Software verification is a tedious process that involves the analysis of multiple failed verification attempts, and adjustments of the program or specification. This is especially the case for complex requirements, e.g., regarding security or fairnes
Externí odkaz:
http://arxiv.org/abs/1907.03996
Interactive program verification is characterized by iterations of unfinished proof attempts. To support the process of constructing a complete proof, many interactive program verification systems offer a proof scripting language as a text-based way
Externí odkaz:
http://arxiv.org/abs/1804.04402
Autor:
Beckert, Bernhard, Bingmann, Timo, Kiefer, Moritz, Sanders, Peter, Ulbrich, Mattias, Weigl, Alexander
Publikováno v:
EPTCS 268, 2018, pp. 185-199
Distributed programs are often formulated in popular functional frameworks like MapReduce, Spark and Thrill, but writing efficient algorithms for such frameworks is usually a non-trivial task. As the costs of running faulty algorithms at scale can be
Externí odkaz:
http://arxiv.org/abs/1803.10328
Increased demands in the field of scientific computation require that algorithms be more efficiently implemented. Maintaining correctness in addition to efficiency is a challenge that software engineers in the field have to face. In this report we sh
Externí odkaz:
http://arxiv.org/abs/1802.02374
Autor:
Beckert, Bernhard, Bingmann, Timo, Kiefer, Moritz, Sanders, Peter, Ulbrich, Mattias, Weigl, Alexander
MapReduce frameworks are widely used for the implementation of distributed algorithms. However, translating imperative algorithms into these frameworks requires significant structural changes to the algorithm. As the costs of running faulty algorithm
Externí odkaz:
http://arxiv.org/abs/1801.08766