Zobrazeno 1 - 10
of 195
pro vyhledávání: '"Wolff, Sebastian"'
Autor:
Wolff, Sebastian, Gupta, Ekanshdeep, Esen, Zafer, Hojjat, Hossein, Rümmer, Philipp, Wies, Thomas
Memory safety is an essential correctness property of software systems. For programs operating on linked heap-allocated data structures, the problem of proving memory safety boils down to analyzing the possible shapes of data structures, leading to t
Externí odkaz:
http://arxiv.org/abs/2408.09037
In this paper the accuracy and robustness of quality measures for the assessment of machine learning models are investigated. The prediction quality of a machine learning model is evaluated model-independent based on a cross-validation approach, wher
Externí odkaz:
http://arxiv.org/abs/2408.04391
We present realizability and realization logic, two program logics that jointly address the problem of finding solutions in semantics-guided synthesis. What is new is that we proceed eagerly and not only analyze a single candidate program but a whole
Externí odkaz:
http://arxiv.org/abs/2403.05607
Separation logic is often praised for its ability to closely mimic the locality of state updates when reasoning about them at the level of assertions. The prover only needs to concern themselves with the footprint of the computation at hand, i.e., th
Externí odkaz:
http://arxiv.org/abs/2307.15549
We present a new flow framework for separation logic reasoning about programs that manipulate general graphs. The framework overcomes problems in earlier developments: it is based on standard fixed point theory, guarantees least flows, rules out vani
Externí odkaz:
http://arxiv.org/abs/2304.04886
Publikováno v:
Proc. ACM Program. Lang. 7, PLDI, Article 182 (June 2023), 24 pages
Proving linearizability of concurrent data structures remains a key challenge for verification. We present temporal interpolation as a new proof principle to conduct such proofs using hindsight arguments within concurrent separation logic. Temporal r
Externí odkaz:
http://arxiv.org/abs/2209.13692
Autor:
Becker, Mike, Meyer, Roland, Runge, Tobias, Schaefer, Ina, van der Wall, Sören, Wolff, Sebastian
Intensive testing using model-based approaches is the standard way of demonstrating the correctness of automotive software. Unfortunately, state-of-the-art techniques leave a crucial and labor intensive task to the test engineer: identifying bugs in
Externí odkaz:
http://arxiv.org/abs/2208.14290
Publikováno v:
Proc. ACM Program. Lang. 6, OOPSLA2, Article 174 (October 2022), 30 pages
Verifying fine-grained optimistic concurrent programs remains an open problem. Modern program logics provide abstraction mechanisms and compositional reasoning principles to deal with the inherent complexity. However, their use is mostly confined to
Externí odkaz:
http://arxiv.org/abs/2207.02355
Publikováno v:
In e-Prime - Advances in Electrical Engineering, Electronics and Energy September 2024 9
Autor:
Meyer, Roland, Wolff, Sebastian
We consider the verification of lock-free data structures that manually manage their memory with the help of a safe memory reclamation (SMR) algorithm. Our first contribution is a type system that checks whether a program properly manages its memory.
Externí odkaz:
http://arxiv.org/abs/1910.11714