A proof technique for communicating sequential processes
From MaRDI portal
Cites work
- A Proof System for Communicating Sequential Processes
- An axiomatic basis for computer programming
- Assignment and Procedure Call Proof Rules
- Communicating sequential processes
- Deadlock absence proofs for networks of communicating processes
- Distributed Termination
- scientific article; zbMATH DE number 3675290 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- Proofs of Networks of Processes
Cited in
(22)- Specification-oriented semantics for communicating processes
- An axiomatic semantics for nested concurrency
- Total correctness of CSP programs
- A model and temporal proof system for networks of processes
- A proof system for distributed processes
- An assertion-based proof system for multithreaded Java
- Corrigenda:Cooperating proofs for distributed programs with multiparty interactions
- Fifty years of Hoare's logic
- Axiomatic system for proving the properties of simple multimodule programs
- AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS∗
- A compositional proof system for distributed programs
- Using Hoare logic in a process algebra setting
- Auxiliary variables in partial correctness programming logics
- An introduction to compositional methods for concurrency and their application to real-time.
- Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs
- The need for compositional proof systems: a survey
- Tony Hoare: his path to the ACM Turing Award
- Concurrent IMP
- P-A logic - a compositional proof system for distributed programs
- A weakest precondition semantics for communicating processes
- A complete axiomatic semantics of spawning
- Computation of equilibria in noncooperative games
This page was built for publication: A proof technique for communicating sequential processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1153686)
