The semantic foundations of a compositional proof method for synchronously communicating processes
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3928330
- scientific article; zbMATH DE number 4092735
- scientific article; zbMATH DE number 4060694
- Compositionality, Concurrency and Partial Correctness. Proof Theories for Networks of Processes, and their Relationship
- A Proof System for Compositional Verification of Probabilistic Concurrent Processes
- Compositional verification of asynchronous processes via constraint solving
- scientific article; zbMATH DE number 591003
- A proof system for asynchronously communicating deterministic processes
- scientific article; zbMATH DE number 3846842
Cited in
(9)- The composability problem of the semantics of XYZ/BE-communicating processes
- Compositional verification of synchronous networks
- scientific article; zbMATH DE number 3903940 (Why is no real title available?)
- scientific article; zbMATH DE number 4060694 (Why is no real title available?)
- scientific article; zbMATH DE number 4001462 (Why is no real title available?)
- A proof system for asynchronously communicating deterministic processes
- A Bibliography of Willem-Paul de Roever
- Reasoning about recursive processes in shared-variable concurrency
- Concurrent IMP
This page was built for publication: The semantic foundations of a compositional proof method for synchronously communicating processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4941913)