We present Total-TaDA, a program logic for verifying the total correctness of concurrent programs: that such programs both terminate and produce the correct result. With Total-TaDA, we can specify constraints on a thread’s concurrent environment that are necessary to guarantee termination. This allows us to verify total correctness for non-blocking algorithms, e.g. a counter and a stack. Our specifications can express lock- and wait-freedom. More generally, they can express that one operation cannot impede the progress of another, a new non-blocking property we call non-impedance. Moreover, our approach is modular. We can verify the operations of a module independently, and build up modules on top of each other
AbstractVardi, M.Y., Verification of concurrent programs: the automata-theoretic framework, Annals o...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
This document presents a formal method to verify execution time bounds of programs at the source lev...
© Springer-Verlag Berlin Heidelberg 2016.We present Total-TaDA, a program logic for verifying the to...
We present Total-TaDA, a program logic for verifying the total correctness of concurrent programs: t...
We present Total-TaDA, a program logic for verifying the to-tal correctness of concurrent programs: ...
We propose an approach for the modular specification and verification of total correctness propertie...
Most multi-threaded programs synchronize threads via blocking operations such as acquiring locks or ...
In this thesis, we address the problem of verifying the functional correctness of concurrent program...
We propose an approach for the modular specification and verification of total correctness propertie...
We propose an approach for the modular specification and verification of total correctness propertie...
We present TaDA Live, a concurrent separation logic for reasoning compositionally about the terminat...
We propose an approach for the modular specification and verification of total correctness propertie...
We propose an approach for the modular specification and verification of total correctness propertie...
This paper contributes to the development of techniques for the modular proof of programs that inclu...
AbstractVardi, M.Y., Verification of concurrent programs: the automata-theoretic framework, Annals o...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
This document presents a formal method to verify execution time bounds of programs at the source lev...
© Springer-Verlag Berlin Heidelberg 2016.We present Total-TaDA, a program logic for verifying the to...
We present Total-TaDA, a program logic for verifying the total correctness of concurrent programs: t...
We present Total-TaDA, a program logic for verifying the to-tal correctness of concurrent programs: ...
We propose an approach for the modular specification and verification of total correctness propertie...
Most multi-threaded programs synchronize threads via blocking operations such as acquiring locks or ...
In this thesis, we address the problem of verifying the functional correctness of concurrent program...
We propose an approach for the modular specification and verification of total correctness propertie...
We propose an approach for the modular specification and verification of total correctness propertie...
We present TaDA Live, a concurrent separation logic for reasoning compositionally about the terminat...
We propose an approach for the modular specification and verification of total correctness propertie...
We propose an approach for the modular specification and verification of total correctness propertie...
This paper contributes to the development of techniques for the modular proof of programs that inclu...
AbstractVardi, M.Y., Verification of concurrent programs: the automata-theoretic framework, Annals o...
AbstractWe show that termination is a first-order notion if approached via Nonstandard Logics of Pro...
This document presents a formal method to verify execution time bounds of programs at the source lev...