Commutativity for concurrent program termination proofs
From MaRDI portal
Recommendations
Cites work
- A calculus of atomic actions
- Automated hypersafety verification
- Compositional termination proofs for multi-threaded programs
- Layered concurrent programs
- Linear ranking for linear lasso programs
- Local Proofs for Linear-Time Properties of Concurrent Programs
- Local temporal reasoning
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Precise Thread-Modular Verification
- Proving LTL Properties of Bitvector Programs and Decompiled Binaries
- Proving liveness of parameterized programs
- Proving non-termination
- Reduction
- Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free
- The MathSAT5 SMT solver
- Transition invariants and transition predicate abstraction for program termination
- Ultimately periodic words of rational ω-languages
This page was built for publication: Commutativity for concurrent program termination proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535630)