Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
DOI10.1007/978-3-540-78800-3_2zbMATH Open1134.68406OpenAlexW2103976262MaRDI QIDQ5458316FDOQ5458316
Authors: Azadeh Farzan, Yu-Fang Chen, Yih-Kuen Tsay, Bow-Yaw Wang, Edmund Clarke 
Publication date: 11 April 2008
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-540-78800-3_2
Recommendations
Formal languages and automata (68Q45) Computational learning theory (68Q32) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (32)
- A framework for compositional verification of multi-valued systems via abstraction-refinement
- Learning one-clock timed automata
- Title not available (Why is that?)
- Learning infinite-word automata with loop-index queries
- Testing language containment for \(\omega\)-automata using BDDs
- Constructing deterministic parity automata from positive and negative examples
- Deciding monadic second order logic over \(\omega \)-words by specialized finite automata
- AUTOMATED COMPOSITIONAL REASONING OF INTUITIONISTICALLY CLOSED REGULAR PROPERTIES
- Automated Compositional Reasoning of Intuitionistically Closed Regular Properties
- Families of DFAs as acceptors of \(\omega\)-regular languages
- Regular \(\omega\)-languages with an informative right congruence
- Concurrent Kleene algebra with observations: from hypotheses to completeness
- Computer Aided Verification
- 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
- Compositional verification and 3-valued abstractions join forces
- Learning regular omega languages
- Compositional probabilistic verification through multi-objective model checking
- Query learning of derived \(\omega\)-tree languages in polynomial time
- Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys
- Mediating for reduction (on minimizing alternating Büchi automata)
- Learning Algorithms and Formal Verification (Invited Tutorial)
- Inferring switched nonlinear dynamical systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Learning Minimal Separating DFA’s for Compositional Verification
- Polynomial identification of \(\omega \)-automata
- Assume-guarantee reasoning with local specifications
- Relational Methods in Computer Science
- How hard is finding shortest counter-example lassos in model checking?
- Inferring regular languages and \(\omega\)-languages
- Compositional reasoning
- A class of automata for the verification of infinite, resource-allocating behaviours
Uses Software
This page was built for publication: Extending Automated Compositional Verification to the Full Class of Omega-Regular Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458316)
