Reasoning About Regular Properties: A Comparative Study
From MaRDI portal
Cites work
- A symbolic decision procedure for symbolic alternating finite automata
- Abstraction refinement for emptiness checking of alternating data automata
- Alternation
- An automata-theoretic approach to branching-time model checking
- An efficient simulation algorithm based on abstract interpretation
- Antichain algorithms for finite automata
- Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata
- Antichains: A New Algorithm for Checking Universality of Finite Automata
- Automated technology for verification and analysis. 6th international symposium, ATVA 2008, Seoul, Korea, October 20--23, 2008. Proceedings
- Chain-free string constraints
- Checking NFA equivalence with bisimulations up to congruence
- Constructions for alternating finite automata∗
- Diophantine equations, Presburger arithmetic and finite automata
- Efficient inclusion checking on explicit and semi-symbolic tree automata
- Even Faster Conflicts and Lazier Reductions for String Solvers
- Experimental Evaluation of Classical Automata Constructions
- Fixed point guided abstraction refinement for alternating automata
- Foundation for a series of efficient simulation algorithms
- Generalized property directed reachability
- scientific article; zbMATH DE number 3460178 (Why is no real title available?)
- scientific article; zbMATH DE number 1306878 (Why is no real title available?)
- scientific article; zbMATH DE number 1479635 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- scientific article; zbMATH DE number 3266653 (Why is no real title available?)
- scientific article; zbMATH DE number 3189697 (Why is no real title available?)
- Interpolation and SAT-based model checking.
- Lazy Abstraction with Interpolants
- Minimization of symbolic automata
- Minimization of symbolic tree automata
- On equations for regular languages, finite automata, and sequential networks
- On Equivalence Checking of Nondeterministic Finite Automata
- On the power of alternation in automata theory
- Optimizing an LTS-simulation algorithm
- Qex: symbolic SQL query explorer
- SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking
- Simple bisimilarity minimization in O(m n) time
- Simplifying Alternating Automata for Emptiness Testing
- Simulation algorithms for symbolic automata
- String Analysis via Automata Manipulation with Logic Circuit Representation
- The power of symbolic automata and transducers
- Theory and Applications of Satisfiability Testing
- Theory Is Forever
- Three Partition Refinement Algorithms
- Unbounded model-checking with interpolation for regular language constraints
- VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
- Weak alternating automata are not that weak
- When simulation meets antichains. (On checking language inclusion of nondeterministic finite (tree) automata)
Cited in
(2)
This page was built for publication: Reasoning About Regular Properties: A Comparative Study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6492750)
