A proof system for asynchronously communicating deterministic processes
From MaRDI portal
Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Recommendations
Cites work
- A Proof System for Communicating Sequential Processes
- An axiomatic proof technique for parallel programs
- scientific article; zbMATH DE number 3903940 (Why is no real title available?)
- scientific article; zbMATH DE number 3963180 (Why is no real title available?)
- scientific article; zbMATH DE number 4092735 (Why is no real title available?)
- scientific article; zbMATH DE number 53100 (Why is no real title available?)
- scientific article; zbMATH DE number 192929 (Why is no real title available?)
Cited in
(8)- scientific article; zbMATH DE number 3900139 (Why is no real title available?)
- scientific article; zbMATH DE number 3900140 (Why is no real title available?)
- scientific article; zbMATH DE number 3938554 (Why is no real title available?)
- scientific article; zbMATH DE number 1304366 (Why is no real title available?)
- Correspondence assertions for process synchronization in concurrent communications
- A Proof System for Compositional Verification of Probabilistic Concurrent Processes
- scientific article; zbMATH DE number 1418350 (Why is no real title available?)
- A Hoare logic for dynamic networks of asynchronously communicating deterministic processes
This page was built for publication: A proof system for asynchronously communicating deterministic processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096883)