A Tighter Bound for the Determinization of Visibly Pushdown Automata (original) (raw)
Related papers
Deterministic Context-Free Model Checking
Model Checking Probabilistic Pushdown Automata
2004
Lecture Notes in Computer Science
A direct symbolic approach to model checking pushdown systems
1997
A Direct Symbolic Approach to Model Checking Pushdown Systems (extended abstract)
Electronic Notes in Theoretical Computer Science, 1997
Branching-Time Model-Checking of Probabilistic Pushdown Automata
Electronic Notes in Theoretical Computer Science, 2009
On the complexity of membership and counting in height-deterministic pushdown automata
Computer ScienceTheory and …, 2008
Automata-theoretic model checking revisited
2007
Verification of automata-based programs
2011
Linear-Time Model Checking: Automata Theory in Practice
Implementation and Application of Automata
An Intersection Type System for Deterministic Pushdown Automata
Lecture Notes in Computer Science, 2012
Alternate Stacking Technique Revisited: Inclusion Problem of Superdeterministic Pushdown Automata
IPSJ Online Transactions, 2008
Height-Deterministic Pushdown Automata
Lecture Notes in Computer Science
IFIP International Federation for Information Processing, 2004
Visibly pushdown automata for streaming XML
2007
Efficient inclusion checking for deterministic tree automata and XML Schemas
Information and Computation, 2009
An automata-theoretic approach to automatic program verification
Proceedings of the First Symposium on Logic in Computer Science, 1986
Efficient reduction of nondeterministic automata with application to language inclusion testing
Log. Methods Comput. Sci., 2019
A partial approach to model checking
1991
SPOT: an extensible model checking library using transition-based generalized buchi automata
The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, 2004. (MASCOTS 2004). Proceedings., 2004
A linear time extension of deterministic pushdown automata
2009
Lecture Notes in Computer Science, 2012
Descriptional Complexity of Push Down Automata
ITAT, 2020
Bounded Model Checking for Region Automata
Lecture Notes in Computer Science, 2004
Streaming Property Testing of Visibly Pushdown Languages
arXiv (Cornell University), 2015
Combining Explicit and Symbolic LTL Model Checking Using Generalized Testing Automata
2015
Automata-Theoretic Verification
Strength-Based Decomposition of the Property Büchi Automaton for Faster Model Checking
Lecture Notes in Computer Science, 2013
Visibly Pushdown Transducers for Approximate Validation of Streaming XML
Lecture Notes in Computer Science
A redefinition of Embedded Push-Down Automata
Runtime Verification Based on Register Automata
Lecture Notes in Computer Science, 2013
2015
Checking ACTL* Properties of Discrete Timed Automata via Bounded Model Checking
2003
An Automata-Theoretic Approach to Branching-Time Model Checking
1998
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA
Lecture Notes in Computer Science, 2002