Automated Assume-Guarantee Reasoning by Abstraction Refinement
From MaRDI portal
Publication:3512489
DOI10.1007/978-3-540-70545-1_14zbMATH Open1155.68435OpenAlexW1801993675MaRDI QIDQ3512489FDOQ3512489
Authors: Mihaela Gheorghiu Bobaru, Dimitra Giannakopoulou, Corina S. Păsăreanu 
Publication date: 15 July 2008
Published in: Computer Aided Verification (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70545-1_14
Recommendations
- Automated Assumption Generation for Compositional Verification
- Refining Interface Alphabets for Compositional Verification
- scientific article; zbMATH DE number 1956591
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Automatic symbolic compositional verification by learning assumptions
Cites Work
- Learning regular sets from queries and counterexamples
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- SAT-Based Compositional Verification Using Lazy Learning
- Computer Aided Verification
- Refining Interface Alphabets for Compositional Verification
- Optimized L*-Based Assume-Guarantee Reasoning
- Automated compositional abstraction refinement for concurrent C programs: a two-level approach
- Title not available (Why is that?)
- Computer Aided Verification
- Automated Assumption Generation for Compositional Verification
Cited In (23)
- To compose, or not to compose, that is the question: an analysis of compositional state space generation
- A framework for compositional verification of multi-valued systems via abstraction-refinement
- Verification of asynchronous systems with an unspecified component
- Towards Automatic Stability Analysis for Rely-Guarantee Proofs
- Refining Interface Alphabets for Compositional Verification
- Pattern-based refinement of assume-guarantee specifications in reactive synthesis
- Abstraction and abstraction refinement
- Compositional verification and 3-valued abstractions join forces
- Compositional CSP traces refinement checking
- Automated circular assume-guarantee reasoning
- Automated circular assume-guarantee reasoning with N-way decomposition and alphabet refinement
- Modular verification of higher-order functional programs
- Compositional abstraction refinement for control synthesis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Assume-guarantee reasoning with local specifications
- Automata learning with automated alphabet abstraction refinement
- Learning assumptions for compositional verification of timed automata
- APML: an architecture proof modeling language
- Title not available (Why is that?)
- Compositional reasoning
- Interpolation-based GR(1) assumptions refinement
- Automated circular assume-guarantee reasoning
This page was built for publication: Automated Assume-Guarantee Reasoning by Abstraction Refinement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3512489)
