A proof system for distributed processes

DOI10.1007/BF02737106MaRDI QIDQ1106014zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

compositionalitypartial correctnessproofs of programsexternal behaviorprogramming language Distributed processes

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3903940 (Why is no real title available?)
• scientific article; zbMATH DE number 3776836 (Why is no real title available?)
• A Proof System for Communicating Sequential Processes
• A proof technique for communicating sequential processes
• An axiomatic basis for computer programming
• Distributed processes
• Guarded commands, nondeterminacy and formal derivation of programs
• The ``Hoare Logic of CSP, and All That

Cited in

(5)

• scientific article; zbMATH DE number 3900140 (Why is no real title available?)
• scientific article; zbMATH DE number 3963180 (Why is no real title available?)
• scientific article; zbMATH DE number 3900139 (Why is no real title available?)
• A compositional proof system for distributed programs
• A trace-based compositional proof theory for fault tolerant distributed systems

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)