On using temporal logic for refinement and compositional verification of concurrent systems
From MaRDI portal
Publication:674008
DOI10.1016/0304-3975(94)00206-XzbMath0874.68114MaRDI QIDQ674008
Abdelillah Mokkedem, Dominique Méry
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
Related Items
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item