On the completeness of compositional reasoning

DOI10.1007/10722167_14MaRDI QIDQ2754080zbMATH OpenFDO

Authors Kedar S. Namjoshi, Richard Trefler

Publication date 11 November 2001

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

Full work available at URL https://doi.org/10.1007/10722167_14

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On the completeness of compositional reasoning methods
• scientific article; zbMATH DE number 1956523
• Foundations for circular compositional reasoning
• Abstract patterns of compositional reasoning.
• A set-theoretic framework for assume-guarantee reasoning

Cited in

(25)

• Tool support for learning Büchi automata and linear temporal logic
• Theory and methodology of assumption/commitment based system interface specification and architectural contracts
• Automated circular assume-guarantee reasoning
• Compositional models for credal sets
• Completeness for ancestral logic via a computationally-meaningful semantics
• On the completeness of compositional reasoning methods
• Learning Meets Verification
• Automatic Derivation of Compositional Rules in Automated Compositional Reasoning
• Automatic Synthesis of Assumptions for Compositional Model Checking
• scientific article; zbMATH DE number 978247 (Why is no real title available?)
• scientific article; zbMATH DE number 1956523 (Why is no real title available?)
• A set-theoretic framework for assume-guarantee reasoning
• Foundations for circular compositional reasoning
• Reasoning about composition using property transformers and their conjugates
• Compositional Reasoning about Shared Futures
• Assume, guarantee or repair
• Automated circular assume-guarantee reasoning
• Completion Is an Instance of Abstract Canonical System Inference
• Abstract patterns of compositional reasoning.
• Observational Completeness on Abstract Interpretation
• Automated program repair using formal verification techniques
• Automatic assume-guarantee reasoning for safety and liveness using passive learning
• On conceptual completeness of syntactic-semantical systems
• Automated compositional proofs for real-time systems
• Automatic symbolic compositional verification by learning assumptions

Describes a project that uses

Uses Software

• CESAR

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

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