Automated circular assume-guarantee reasoning
DOI10.1007/978-3-319-19249-9_3zbMATH Open1427.68194OpenAlexW641899672MaRDI QIDQ5206947FDOQ5206947
Authors: Karam Abd Elkader, Orna Grumberg, Sharon Shoham, Corina S. Păsăreanu 
Publication date: 19 December 2019
Published in: FM 2015: Formal Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-19249-9_3
Recommendations
- Automated circular assume-guarantee reasoning
- Automated circular assume-guarantee reasoning with N-way decomposition and alphabet refinement
- scientific article; zbMATH DE number 1754638
- Automated Assumption Generation for Compositional Verification
- Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Automated Assume-Guarantee Reasoning by Abstraction Refinement
- Learning Minimal Separating DFA’s for Compositional Verification
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computer Aided Verification
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Automated assumption generation for compositional verification
- Proofs of Networks of Processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computer Aided Verification
- Title not available (Why is that?)
Cited In (11)
- Assume, guarantee or repair
- Assume-guarantee verification for probabilistic systems
- Title not available (Why is that?)
- Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
- Automated circular assume-guarantee reasoning
- Synthesis of circular compositional program proofs via abduction
- Automated circular assume-guarantee reasoning with N-way decomposition and alphabet refinement
- Automated program repair using formal verification techniques
- Automated Assumption Generation for Compositional Verification
- Title not available (Why is that?)
- APML: an architecture proof modeling language
This page was built for publication: Automated circular assume-guarantee reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206947)
