Symbolic compositional verification by learning assumptions
From MaRDI portal
Recommendations
- Automatic symbolic compositional verification by learning assumptions
- Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
- Learning assumptions for compositional verification
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Automated Assumption Generation for Compositional Verification
Cited in
(39)- Automated circular assume-guarantee reasoning
- Verification of asynchronous systems with an unspecified component
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- A learning-based approach to synthesizing invariants for incomplete verification engines
- Compositional verification and 3-valued abstractions join forces
- Learning to verify branching time properties
- Automated formal analysis and verification: an overview
- Compositionality Entails Sequentializability
- Learning-based compositional verification for synchronous probabilistic systems
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- A Minimized Assumption Generation Method for Component-Based Software Verification
- The Birth of Model Checking
- Automated Assume-Guarantee Reasoning by Abstraction Refinement
- Learning-Based Symbolic Assume-Guarantee Reasoning with Automatic Decomposition
- Learning Meets Verification
- Assume-guarantee verification for probabilistic systems
- Automatic Synthesis of Assumptions for Compositional Model Checking
- Grey-Box Checking
- Learning Minimal Separating DFA’s for Compositional Verification
- Learning assumptions for compositional verification
- Abstraction and learning for infinite-state compositional verification
- Compositional CSP traces refinement checking
- Automated circular assume-guarantee reasoning
- SAT-Based Compositional Verification Using Lazy Learning
- Automated Assumption Generation for Compositional Verification
- Learning Algorithms and Formal Verification (Invited Tutorial)
- Automated assume-guarantee reasoning for simulation conformance
- Refining Interface Alphabets for Compositional Verification
- Optimized L*-Based Assume-Guarantee Reasoning
- Compositional automata learning of synchronous systems
- Learning assumptions for compositional verification of timed automata
- Automatic assume-guarantee reasoning for safety and liveness using passive learning
- Learning deterministic multi-clock timed automata
- Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists
- Three optimizations for assume-guarantee reasoning with \(L^{*}\)
- Learning to divide and conquer: applying the \(L^*\) algorithm to automate assume-guarantee reasoning
- Automated assumption generation for compositional verification
- Verification of evolving software via component substitutability analysis
- Automatic symbolic compositional verification by learning assumptions
This page was built for publication: Symbolic compositional verification by learning assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716596)
