Automated assume-guarantee reasoning for simulation conformance
From MaRDI portal
Recommendations
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Three optimizations for assume-guarantee reasoning with \(L^{*}\)
- Symbolic compositional verification by learning assumptions
- Automated Assumption Generation for Compositional Verification
- Optimized L*-Based Assume-Guarantee Reasoning
Cited in
(17)- Local proofs for global safety properties
- Automated circular assume-guarantee reasoning
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Compositional verification and 3-valued abstractions join forces
- A framework for compositional verification of multi-valued systems via abstraction-refinement
- Learning to verify branching time properties
- Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys
- Automated formal analysis and verification: an overview
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- The Birth of Model Checking
- Automated Assume-Guarantee Reasoning by Abstraction Refinement
- Learning Meets Verification
- Automated circular assume-guarantee reasoning
- Optimized L*-Based Assume-Guarantee Reasoning
- CEGAR for compositional analysis of qualitative properties in Markov decision processes
- Three optimizations for assume-guarantee reasoning with \(L^{*}\)
- Verification of evolving software via component substitutability analysis
This page was built for publication: Automated assume-guarantee reasoning for simulation conformance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716595)
