On the completeness of compositional reasoning methods

DOI10.1145/1740582.1740584zbMath1351.68184OpenAlexW2108096932MaRDI QIDQ2946604

Richard Trefler, Kedar S. Namjoshi

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1740582.1740584

zbMATH Keywords

concurrent systemsautomated reasoningcompositional reasoningassume-guarantee reasoningsyntactically circular reasoning

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)

Related Items (4)

Local Symmetry and Compositional Verification ⋮ Compositional Reasoning ⋮ The refinement calculus of reactive systems ⋮ Conditions of contracts for separating responsibilities in heterogeneous systems

This page was built for publication: On the completeness of compositional reasoning methods