Semi-Automated Modular Formal Verification of Critical Software: Liveness and Completeness Thresholds
T Reinhard - arXiv preprint arXiv:2403.00934, 2024 - arxiv.org
In this dissertation we describe two contributions to the state of the art in reasoning about
liveness and safety, respectively. Programs for multiprocessor machines commonly perform …
liveness and safety, respectively. Programs for multiprocessor machines commonly perform …
[PDF][PDF] Semi-Automated Modular Formal Verification of Critical Software
T Reinhard - 2024 - lirias.kuleuven.be
I am grateful to my advisor, Bart Jacobs, and my co-advisor, Amin Timany, for providing me
with the opportunity to delve further into the realm of software verification and, especially, for …
with the opportunity to delve further into the realm of software verification and, especially, for …
Tasks in modular proofs of concurrent algorithms
Proving correctness of distributed or concurrent algorithms is a mind-challenging and
complex process. Slight errors in the reasoning are difficult to find, calling for computer …
complex process. Slight errors in the reasoning are difficult to find, calling for computer …
Tasks in modular proofs of concurrent algorithms
Proving the correctness of distributed or concurrent algorithms is a complex process. Errors
in the reasoning are hard to find, calling for computer-checked proof systems like Coq or …
in the reasoning are hard to find, calling for computer-checked proof systems like Coq or …