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