Learning Minimal Separating DFA’s for Compositional Verification
From MaRDI portal
Publication:3617752
Recommendations
- Computing minimal separating DFAs and regular invariants using SAT and SMT solvers
- A sufficient condition to polynomially compute a minimum separating DFA
- Learning Algorithms and Formal Verification (Invited Tutorial)
- Computer Aided Verification
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
Cites work
- scientific article; zbMATH DE number 1956591 (Why is no real title available?)
- Automated Assumption Generation for Compositional Verification
- Computer Aided Verification
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- FM 2005: Formal Methods
- Inference of finite automata using homing sequences
- Inferring Network Invariants Automatically
- Learning Minimal Separating DFA’s for Compositional Verification
- Learning regular sets from queries and counterexamples
- Optimized L*-Based Assume-Guarantee Reasoning
- Refining Interface Alphabets for Compositional Verification
- SAT-Based Compositional Verification Using Lazy Learning
Cited in
(23)- Assume, guarantee or repair
- A sufficient condition to polynomially compute a minimum separating DFA
- Automatically inferring loop invariants via algorithmic learning
- Random Generation of Deterministic Tree (Walking) Automata
- Learning union of integer hypercubes with queries (with applications to monadic decomposition)
- Learning Minimal Separating DFA’s for Compositional Verification
- Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists
- Parametric random generation of deterministic tree automata
- Optimal state reductions of automata with partially specified behaviors
- Minimal consistent DFA revisited
- Computing minimal separating DFAs and regular invariants using SAT and SMT solvers
- Automated circular assume-guarantee reasoning
- Learning algorithms
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Automated program repair using formal verification techniques
- Fundamental results for learning deterministic extended finite state machines from queries
- Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys
- A framework for compositional verification of multi-valued systems via abstraction-refinement
- A multi-parameter analysis of hard problems on deterministic finite automata
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- Certifying DFA bounds for recognition and separation
- Compositional reasoning
- Automated circular assume-guarantee reasoning
This page was built for publication: Learning Minimal Separating DFA’s for Compositional Verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3617752)
