Learning Minimal Separating DFA’s for Compositional Verification
DOI10.1007/978-3-642-00768-2_3zbMATH Open1234.68166OpenAlexW98666333MaRDI QIDQ3617752FDOQ3617752
Authors: Yu-Fang Chen, Azadeh Farzan, Yih-Kuen Tsay, Bow-Yaw Wang, Edmund Clarke 
Publication date: 31 March 2009
Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00768-2_3
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
Formal languages and automata (68Q45) Computational learning theory (68Q32) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Learning regular sets from queries and counterexamples
- Learning Minimal Separating DFA’s for Compositional Verification
- Title not available (Why is that?)
- SAT-Based Compositional Verification Using Lazy Learning
- Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
- Refining Interface Alphabets for Compositional Verification
- Optimized L*-Based Assume-Guarantee Reasoning
- Inference of finite automata using homing sequences
- Inferring Network Invariants Automatically
- Computer Aided Verification
- Automated Assumption Generation for Compositional Verification
- FM 2005: Formal Methods
Cited In (23)
- A framework for compositional verification of multi-valued systems via abstraction-refinement
- Assume, guarantee or repair
- Learning union of integer hypercubes with queries (with applications to monadic decomposition)
- Automatically inferring loop invariants via algorithmic learning
- Optimal state reductions of automata with partially specified behaviors
- Minimal consistent DFA revisited
- Certifying DFA bounds for recognition and separation
- Random Generation of Deterministic Tree (Walking) Automata
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- A novel learning algorithm for Büchi automata based on family of DFAs and classification trees
- A sufficient condition to polynomially compute a minimum separating DFA
- Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys
- Automated circular assume-guarantee reasoning
- A multi-parameter analysis of hard problems on deterministic finite automata
- Parametric random generation of deterministic tree automata
- Computing minimal separating DFAs and regular invariants using SAT and SMT solvers
- Fundamental results for learning deterministic extended finite state machines from queries
- Automated program repair using formal verification techniques
- Learning Minimal Separating DFA’s for Compositional Verification
- Learning algorithms
- Compositional reasoning
- Quantified data automata for linear data structures: a register automaton model with applications to learning invariants of programs manipulating arrays and lists
- 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)
