Lazy compositional verication
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3926220 (Why is no real title available?)
- scientific article; zbMATH DE number 3938541 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 1088222 (Why is no real title available?)
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- A calculus of communicating systems
- A decade of concurrency. Reflections and perspectives. REX School/ Symposium, Noordwijkerhout, the Netherlands, June 1-4, 1993. Proceedings
- A logical view of composition
- A survey of verification techniques for parallel programs
- An axiomatic proof technique for parallel programs
- An explanatory presentation of composition rules for assumption- commitment specifications
- Application of the composition principle to unity-like specifications
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Compositionality, Concurrency and Partial Correctness. Proof Theories for Networks of Processes, and their Relationship
- Defining liveness
- P-A logic - a compositional proof system for distributed programs
- Proofs of Networks of Processes
- Specification and compositional verification of real-time systems
- Tentative steps toward a development method for interfering programs
- The Rely-Guarantee method for verifying shared variable concurrent programs
This page was built for publication: Lazy compositional verication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7010062)
