Reasoning About Regular Properties: A Comparative Study (Q6492750): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Chain-Free String Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Simulation Meets Antichains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking NFA equivalence with bisimulations up to congruence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diophantine equations, Presburger arithmetic and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equations for regular languages, finite automata, and sequential networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5725992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5525343 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5144615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A symbolic decision procedure for symbolic alternating finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of symbolic automata and transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of symbolic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization of Symbolic Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated technology for verification and analysis. 6th international symposium, ATVA 2008, Seoul, Korea, October 20--23, 2008. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antichain Algorithms for Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions for alternating finite automata<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Equivalence Checking of Nondeterministic Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded Model-Checking with Interpolation for Regular Language Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed point guided abstraction refinement for alternating automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Property Directed Reachability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulation algorithms for symbolic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2970249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4045961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of alternation in automata theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5551191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory Is Forever / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstraction refinement for emptiness checking of alternating data automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak alternating automata are not that weak / rank
 
Normal rank
Property / cites work
 
Property / cites work: An automata-theoretic approach to branching-time model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lazy Abstraction with Interpolants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even Faster Conflicts and Lazier Reductions for String Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three Partition Refinement Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient simulation algorithm based on abstract interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental Evaluation of Classical Automata Constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Bisimilarity Minimization in O(m log n) Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4490750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplifying Alternating Automata for Emptiness Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Qex: Symbolic SQL Query Explorer / rank
 
Normal rank
Property / cites work
 
Property / cites work: String Analysis via Automata Manipulation with Logic Circuit Representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antichains: A New Algorithm for Checking Universality of Finite Automata / rank
 
Normal rank

Latest revision as of 13:00, 3 December 2024

scientific article; zbMATH DE number 7838493
Language Label Description Also known as
English
Reasoning About Regular Properties: A Comparative Study
scientific article; zbMATH DE number 7838493

    Statements

    Reasoning About Regular Properties: A Comparative Study (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2024
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers