Compositional proofs for concurrent objects

DOI10.1007/3-540-49213-5_11MaRDI QIDQ7010072zbMATH OpenFDO

Authors Jerry James, Ambuj Singh

Publication date 19 March 2025

Full work available at URL https://doi.org/10.1007/3-540-49213-5_11

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• 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 46981 (Why is no real title available?)
• scientific article; zbMATH DE number 194539 (Why is no real title available?)
• scientific article; zbMATH DE number 3300566 (Why is no real title available?)
• A foundation for modular reasoning about safety and progress properties of state-based concurrent programs
• A mechanical proof of Segall's PIF algorithm
• An axiomatic proof technique for parallel programs
• Distributed network protocols
• Formal stystems specification. The RPC-memory specification case study
• P-A logic - a compositional proof system for distributed programs
• The existence of refinement mappings

This page was built for publication: Compositional proofs for concurrent objects

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