P-A logic - a compositional proof system for distributed programs

DOI10.1007/BF02311231zbMATH Open0723.68075OpenAlexW2039277865MaRDI QIDQ757079FDOQ757079

Authors: Paritosh K. Pandya, Mathai Joseph 

Publication date: 1991

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02311231

Recommendations

• A compositional proof system for distributed programs
• scientific article; zbMATH DE number 4201637
• A proof system for distributed processes
• A Hoare logic for dynamic networks of asynchronously communicating deterministic processes
• Proof rules for fault tolerant distributed programs

zbMATH Keywords

proof systemSafetylifenessOCCAM

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Distributed algorithms (68W15)

Cites Work

• Title not available (Why is that?)
• Communicating sequential processes
• Title not available (Why is that?)
• Proofs of Networks of Processes
• Defining liveness
• A Proof System for Communicating Sequential Processes
• A calculus of total correctness for communicating processes
• A proof technique for communicating sequential processes
• Title not available (Why is that?)
• Total correctness of CSP programs
• A proof method for cyclic programs
• Correctness proofs of CSP programs

Cited In (18)

• Title not available (Why is that?)
• A Logic For Distributed Processes
• A proof system for distributed processes
• Logical foundations for compositional verification and development of concurrent programs in UNITY
• A compositional proof system for distributed programs
• Parallel composition of assumption-commitment specifications: A unifying approach for shared variable and distributed message passing concurrency
• A Hoare logic for dynamic networks of asynchronously communicating deterministic processes
• An explanatory presentation of composition rules for assumption- commitment specifications
• A foundation for modular reasoning about safety and progress properties of state-based concurrent programs
• Programming Languages and Systems
• Modular verification of multithreaded programs
• A trace-based compositional proof theory for fault tolerant distributed systems
• Theory and methodology of assumption/commitment based system interface specification and architectural contracts
• Specification and refinement of networks of asynchronously communicating agents using the assumption/commitment paradigm
• An introduction to compositional methods for concurrency and their application to real-time.
• Title not available (Why is that?)
• Proof rules for fault tolerant distributed programs
• Distributed automata in an assumption-commitment framework

This page was built for publication: P-A logic - a compositional proof system for distributed programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q757079)