Compositional reasoning for shared-variable concurrent programs
From MaRDI portal
Publication:2024370
DOI10.1007/978-3-319-95582-7_31zbMath1460.68067arXiv1611.00574OpenAlexW2548853769MaRDI QIDQ2024370
Alwen Tiu, Yongwang Zhao, David Sanán, Yang Liu, Jun Sun, Fuyuan Zhang, Shang-Wei Lin
Publication date: 4 May 2021
Full work available at URL: https://arxiv.org/abs/1611.00574
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Local proofs for global safety properties
- Symbolic model checking: \(10^{20}\) states and beyond
- A calculus for cryptographic protocols: The spi calculus
- The Rely-Guarantee method for verifying shared variable concurrent programs
- Compositional reasoning for shared-variable concurrent programs
- Counterexample-guided abstraction refinement for symbolic model checking
- Verifying a Compiler for Java Threads
- Tentative steps toward a development method for interfering programs
- Proofs of Networks of Processes
- Boxes: A Symbolic Abstract Domain of Boxes
- Predicate abstraction and refinement for verifying multi-threaded programs
- Computer Aided Verification
This page was built for publication: Compositional reasoning for shared-variable concurrent programs
