Pages that link to "Item:Q1153686"
From MaRDI portal
The following pages link to A proof technique for communicating sequential processes (Q1153686):
Displaying 18 items.
- Auxiliary variables in partial correctness programming logics (Q582037) (← links)
- P-A logic - a compositional proof system for distributed programs (Q757079) (← links)
- A weakest precondition semantics for communicating processes (Q789174) (← links)
- A complete axiomatic semantics of spawning (Q808281) (← links)
- Computation of equilibria in noncooperative games (Q815274) (← links)
- Specification-oriented semantics for communicating processes (Q1060838) (← links)
- An axiomatic semantics for nested concurrency (Q1077155) (← links)
- Total correctness of CSP programs (Q1079011) (← links)
- A model and temporal proof system for networks of processes (Q1079948) (← links)
- A proof system for distributed processes (Q1106014) (← links)
- An assertion-based proof system for multithreaded Java (Q1770359) (← links)
- Corrigenda:Cooperating proofs for distributed programs with multiparty interactions (Q1813353) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- Axiomatic system for proving the properties of simple multimodule programs (Q3829057) (← links)
- AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS∗ (Q4485121) (← links)
- A compositional proof system for distributed programs (Q4560363) (← links)
- Using Hoare Logic in a Process Algebra Setting (Q5164860) (← links)
- An introduction to compositional methods for concurrency and their application to real-time. (Q5955749) (← links)
