Refining Interface Alphabets for Compositional Verification
From MaRDI portal
Recommendations
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Computer Aided Verification
- Automated Assume-Guarantee Reasoning by Abstraction Refinement
- scientific article; zbMATH DE number 1956591
- Automatic symbolic compositional verification by learning assumptions
Cited in
(13)- Automated circular assume-guarantee reasoning
- A framework for compositional verification of multi-valued systems via abstraction-refinement
- Automated Assume-Guarantee Reasoning by Abstraction Refinement
- Learning Minimal Separating DFA’s for Compositional Verification
- Learning register automata: from languages to program structures
- Abstraction and learning for infinite-state compositional verification
- Assume, guarantee or repair
- Compositional CSP traces refinement checking
- Automated program repair using formal verification techniques
- Learning assumptions for compositional verification of timed automata
- Automatic assume-guarantee reasoning for safety and liveness using passive learning
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Verification of evolving software via component substitutability analysis
This page was built for publication: Refining Interface Alphabets for Compositional Verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5758115)