The need for compositional proof systems: a survey
From MaRDI portal
Cites work
- A compositional axiomatization of statecharts
- A compositional real-time semantics of STATEMATE designs
- A context dependent equivalence between processes
- A generalization of Owicki-Gries's Hoare logic for a concurrent while language
- A logical view of composition
- A model and temporal proof system for networks of processes
- A Proof System for Communicating Sequential Processes
- A proof technique for communicating sequential processes
- An axiomatic basis for computer programming
- An axiomatic proof technique for parallel programs
- An explanatory presentation of composition rules for assumption- commitment specifications
- Application of the composition principle to unity-like specifications
- Axiomatic semantics of communicating sequential processes
- Compositional specification of timed systems
- Compositionality, Concurrency and Partial Correctness. Proof Theories for Networks of Processes, and their Relationship
- Correctness Proofs of Communicating Processes: Three Illustrative Examples From the Literature
- Defining liveness
- scientific article; zbMATH DE number 4180789 (Why is no real title available?)
- scientific article; zbMATH DE number 3890715 (Why is no real title available?)
- scientific article; zbMATH DE number 3902010 (Why is no real title available?)
- scientific article; zbMATH DE number 3903940 (Why is no real title available?)
- scientific article; zbMATH DE number 3926220 (Why is no real title available?)
- scientific article; zbMATH DE number 3938541 (Why is no real title available?)
- scientific article; zbMATH DE number 3956417 (Why is no real title available?)
- scientific article; zbMATH DE number 3963180 (Why is no real title available?)
- scientific article; zbMATH DE number 3784244 (Why is no real title available?)
- 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 54048 (Why is no real title available?)
- scientific article; zbMATH DE number 108539 (Why is no real title available?)
- scientific article; zbMATH DE number 3550181 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 683364 (Why is no real title available?)
- scientific article; zbMATH DE number 1015113 (Why is no real title available?)
- scientific article; zbMATH DE number 1049169 (Why is no real title available?)
- scientific article; zbMATH DE number 1051241 (Why is no real title available?)
- scientific article; zbMATH DE number 4001463 (Why is no real title available?)
- scientific article; zbMATH DE number 868111 (Why is no real title available?)
- scientific article; zbMATH DE number 3302923 (Why is no real title available?)
- P-A logic - a compositional proof system for distributed programs
- Partial specifications and compositional verification
- Proofs of Networks of Processes
- Specification and compositional verification of real-time systems
- Synthesizing different development paradigms: combining top-down with bottom-up reasoning about distributed systems
- Tentative steps toward a development method for interfering programs
- The existence of refinement mappings
- The Rely-Guarantee method for verifying shared variable concurrent programs
- The structure of the “THE”-multiprogramming system
- Verifying part of the ACCESS.bus protocol using PVS
This page was built for publication: The need for compositional proof systems: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7010083)
