On the completeness of compositional reasoning methods
DOI10.1145/1740582.1740584zbMATH Open1351.68184OpenAlexW2108096932MaRDI QIDQ2946604FDOQ2946604
Authors: Kedar S. Namjoshi, Richard Trefler 
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
Recommendations
automated reasoningassume-guarantee reasoningcompositional reasoningconcurrent systemssyntactically circular reasoning
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (17)
- The refinement calculus of reactive systems
- Completion Is an Instance of Abstract Canonical System Inference
- Conditions of contracts for separating responsibilities in heterogeneous systems
- Title not available (Why is that?)
- AUTOMATED COMPOSITIONAL REASONING OF INTUITIONISTICALLY CLOSED REGULAR PROPERTIES
- Title not available (Why is that?)
- Abstract patterns of compositional reasoning.
- Automatic Derivation of Compositional Rules in Automated Compositional Reasoning
- Automated circular assume-guarantee reasoning
- Compositional models for credal sets
- Completeness for cut-based abduction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Local symmetry and compositional verification
- Title not available (Why is that?)
- Title not available (Why is that?)
- Compositional reasoning
This page was built for publication: On the completeness of compositional reasoning methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946604)
