Formal verification of a programming logic for a distributed programming language
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 50008 (Why is no real title available?)
- scientific article; zbMATH DE number 53100 (Why is no real title available?)
- scientific article; zbMATH DE number 108539 (Why is no real title available?)
- scientific article; zbMATH DE number 108540 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- scientific article; zbMATH DE number 234014 (Why is no real title available?)
- Automatic program verification. I: A logical basis and its implementation
- Axiomatic semantics of communicating sequential processes
- Logic and Computation
- The existence of refinement mappings
Cited in
(7)- Language-oriented formal analysis: a case study on protocols and distributed systems
- scientific article; zbMATH DE number 4201637 (Why is no real title available?)
- Formal Verification of Distributed Algorithms
- Verifying distributed systems: the operational approach
- scientific article; zbMATH DE number 5713654 (Why is no real title available?)
- A proof system for distributed processes
- Mostly Automated Formal Verification of Loop Dependencies with Applications to Distributed Stencil Algorithms
This page was built for publication: Formal verification of a programming logic for a distributed programming language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1285659)