On using temporal logic for refinement and compositional verification of concurrent systems
From MaRDI portal
Publication:674008
DOI10.1016/0304-3975(94)00206-XzbMath0874.68114OpenAlexW2076889468MaRDI QIDQ674008
Dominique Méry, Abdelillah Mokkedem
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00206-x
Related Items (2)
Logical foundations for compositional verification and development of concurrent programs in UNITY ⋮ A foundation for modular reasoning about safety and progress properties of state-based concurrent programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A logical view of composition
- The Hoare logic of concurrent programs
- Compositionality, Concurrency and Partial Correctness. Proof Theories for Networks of Processes, and their Relationship
- An axiomatic proof technique for parallel programs
- Specifying Concurrent Program Modules
- The Weak Byzantine Generals Problem
This page was built for publication: On using temporal logic for refinement and compositional verification of concurrent systems