A proof system for distributed processes
DOI10.1007/BF02737106zbMATH Open0649.68016OpenAlexW4250818063MaRDI QIDQ1106014FDOQ1106014
Authors: A. E. K. Sobel, N. Soundararajan 
Publication date: 1988
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02737106
Recommendations
- scientific article; zbMATH DE number 3900140
- scientific article; zbMATH DE number 3963180
- Formal verification of a programming logic for a distributed programming language
- scientific article; zbMATH DE number 4201637
- scientific article; zbMATH DE number 3900139
- Verification of distributed programs using representative interleaving sequences
- A survey of verification techniques for parallel programs
- Using the causal domain to specify and verify distributed programs
- P-A logic - a compositional proof system for distributed programs
compositionalitypartial correctnessproofs of programsexternal behaviorprogramming language Distributed processes
Specification and verification (program logics, model checking, etc.) (68Q60) Semantics in the theory of computing (68Q55) Abstract data types; algebraic specification (68Q65) Theory of operating systems (68N25)
Cites Work
- An axiomatic basis for computer programming
- Guarded commands, nondeterminacy and formal derivation of programs
- A Proof System for Communicating Sequential Processes
- A proof technique for communicating sequential processes
- Title not available (Why is that?)
- Distributed processes
- The ``Hoare Logic of CSP, and All That
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: A proof system for distributed processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1106014)
