Local Symmetry and Compositional Verification

DOI10.1007/978-3-642-27940-9_23zbMath1326.68103OpenAlexW115289033MaRDI QIDQ2891426

Kedar S. Namjoshi, Richard Trefler

Publication date: 15 June 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-27940-9_23

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (2)

Compositional Reasoning ⋮ Cut-off theorems for the \textit{PV}-model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local proofs for global safety properties
• On the completeness of compositional reasoning methods
• The ``Hoare Logic of CSP, and All That
• Local Proofs for Linear-Time Properties of Concurrent Programs
• Tentative steps toward a development method for interfering programs
• From Groups to Groupoids: a Brief Survey
• Proofs of Networks of Processes
• Verifying properties of parallel programs
• Proving the Correctness of Multiprocess Programs
• Predicate abstraction and refinement for verifying multi-threaded programs
• Local Proofs for Global Safety Properties
• Symmetry and Completeness in the Analysis of Parameterized Systems
• Nonlinear dynamics of networks: the groupoid formalism
• On Reasoning About Rings

This page was built for publication: Local Symmetry and Compositional Verification