Handbook of theoretical computer science (vol. B)
Precise interprocedural dataflow analysis via graph reachability
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Context-free languages and pushdown automata
Handbook of formal languages, vol. 1
Journal of the ACM (JACM)
Dynamic Logic
MOPS: an infrastructure for examining security properties of software
Proceedings of the 9th ACM conference on Computer and communications security
Bebop: A Symbolic Model Checker for Boolean Programs
Proceedings of the 7th International SPIN Workshop on SPIN Model Checking and Software Verification
Reachability Analysis of Pushdown Automata: Application to Model-Checking
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Model Checking for Context-Free Processes
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
Temporal-Safety Proofs for Systems Code
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Logics For Context-Free Languages
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Solving Pushdown Games with a Sigma3 Winning Condition
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Balanced grammars and their languages
Formal and natural computing
Model checking LTL with regular valuations for pushdown systems
Information and Computation - TACS 2001
Stack size analysis for interrupt-driven programs
SAS'03 Proceedings of the 10th international conference on Static analysis
WWW '05 Proceedings of the 14th international conference on World Wide Web
Functions with local state: regularity and undecidability
Theoretical Computer Science
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The benefits of exposing calls and returns
CONCUR 2005 - Concurrency Theory
A fixpoint calculus for local and global program flows
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Expressiveness and complexity of XML Schema
ACM Transactions on Database Systems (TODS)
Journal of Computer and System Sciences
Visibly pushdown automata for streaming XML
Proceedings of the 16th international conference on World Wide Web
Regularly annotated set constraints
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Guarded models for intrusion detection
Proceedings of the 2007 workshop on Programming languages and analysis for security
Attribute grammars for scalable query processing on XML streams
The VLDB Journal — The International Journal on Very Large Data Bases
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The word problem for visibly pushdown languages described by grammars
Formal Methods in System Design
Third-order Idealized Algol with iteration is decidable
Theoretical Computer Science
Fine hierarchies and m-reducibilities in theoretical computer science
Theoretical Computer Science
Visibly Pushdown Languages and Term Rewriting
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Model Checking: From Tools to Theory
25 Years of Model Checking
SAS '08 Proceedings of the 15th international symposium on Static Analysis
Weighted Logics for Nested Words and Algebraic Formal Power Series
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
An Infinite Automaton Characterization of Double Exponential Time
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Extensional Uniformity for Boolean Circuits
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Rewriting of visibly pushdown languages for xml data integration
Proceedings of the 17th ACM conference on Information and knowledge management
Information Processing Letters
Validation of streaming XML documents with abstract state machines
Proceedings of the 10th International Conference on Information Integration and Web-based Applications & Services
Event-Clock Visibly Pushdown Automata
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Adding nesting structure to words
Journal of the ACM (JACM)
Electronic Notes in Theoretical Computer Science (ENTCS)
Realizability of Concurrent Recursive Programs
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Bounded Delay and Concurrency for Earliest Query Answering
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Homer: A Higher-Order Observational Equivalence Model checkER
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Notions of hyperbolicity in monoids
Theoretical Computer Science
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Automated Deadlock Detection in Synchronized Reentrant Multithreaded Call-Graphs
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Methods for Quantitative Analysis of Probabilistic Pushdown Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Summarization for termination: no return!
Formal Methods in System Design
Tree automata with memory, visibility and structural constraints
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Arithmetizing classes around NC1and L
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
A grammatical representation of visibly pushdown languages
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
DLT'07 Proceedings of the 11th international conference on Developments in language theory
Property-preserving evolution of components using VPA-based aspects
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Visibly pushdown transducers for approximate validation of streaming XML
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Earliest query answering for deterministic nested word automata
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Equivalence of deterministic nested word to word transducers
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
On the complexity of membership and counting in height-deterministic pushdown automata
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Parametric random generation of deterministic tree automata
Theoretical Computer Science
An automata-theoretic approach to infinite-state systems
Time for verification
Properties of visibly pushdown transducers
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
A CTL-based logic for program abstractions
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Counting paths in VPA Is complete for #NC1
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
On the complexity of membership and counting in height-deterministic pushdown automata
Journal of Automata, Languages and Combinatorics
Proceedings of the VLDB Endowment
Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
The tree width of auxiliary storage
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extended computation tree logic
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
P-hardness of the emptiness problem for visibly pushdown languages
Information Processing Letters
Queries on Xml streams with bounded delay and concurrency
Information and Computation
Rigid tree automata and applications
Information and Computation
Verification of common interprocedural compiler optimizations using visibly pushdown kleene algebra
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
String analysis as an abstract interpretation
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Comparing linear conjunctive languages to subfamilies of the context-free languages
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Diagnosability of pushdown systems
HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
Leaf languages and string compression
Information and Computation
XEvolve: an XML schema evolution framework
Proceedings of the 2011 ACM Symposium on Applied Computing
Alternation elimination for automata over nested words
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Evolving schemas for streaming XML
Theoretical Computer Science
Precedence automata and languages
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Checking conformance of a producer and a consumer
Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering
A fragment of ML decidable by visibly pushdown automata
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Hybrid and first-order complete extensions of CaRet
TABLEAUX'11 Proceedings of the 20th international conference on Automated reasoning with analytic tableaux and related methods
Language equivalence of deterministic real-time one-counter automata is NL-complete
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
State complexity of operations on input-driven pushdown automata
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Software model checking using languages of nested trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Pumping visibly pushdown languages
AIASABEBI'11 Proceedings of the 11th WSEAS international conference on Applied informatics and communications, and Proceedings of the 4th WSEAS International conference on Biomedical electronics and biomedical informatics, and Proceedings of the international conference on Computational engineering in systems applications
Formal language constrained reachability and model checking propositional dynamic logics
RP'11 Proceedings of the 5th international conference on Reachability problems
Regularity problems for visibly pushdown languages
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Propositional dynamic logic with recursive programs
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Decision problems for the verification of real-time software
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
Congruences for visibly pushdown languages
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Visibly pushdown automata: from language equivalence to simulation and bisimulation
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Complexity bounds for the verification of real-time software
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
The language theory of bounded context-switching
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Which XML schemas admit 1-pass preorder typing?
ICDT'05 Proceedings of the 10th international conference on Database Theory
On the complexity of error explanation
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Streaming algorithms for some problems in log-space
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Model checking probabilistic systems against pushdown specifications
Information Processing Letters
Third-order idealized algol with iteration is decidable
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Minimization, learning, and conformance testing of boolean programs
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
On the membership problem for visibly pushdown languages
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Arbology: trees and pushdown automata
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Operator precedence and the visibly pushdown property
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Adding nesting structure to words
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Synchronization of pushdown automata
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Evolving schemas for streaming XML
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
Automata-Based verification of programs with tree updates
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Visibly pushdown transducers with look-ahead
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
High-performance complex event processing over XML streams
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
On model checking for visibly pushdown automata
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
On the complexity of the equivalence problem for probabilistic automata
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Prefix rewriting for nested-words and collapsible pushdown automata
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Algorithmic games for full ground references
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Secure programming via visibly pushdown safety games
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
HECTOR: an equivalence checker for a higher-order fragment of ML
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Visibly pushdown automata with multiplicities: finiteness and k-boundedness
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Conformance testing of boolean programs with multiple faults
FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
Test generation from recursive tiles systems
TAP'12 Proceedings of the 6th international conference on Tests and Proofs
Regularity problems for weak pushdown ω-automata and games
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Operator precedence and the visibly pushdown property
Journal of Computer and System Sciences
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Alternating automata and a temporal fixpoint calculus for visibly pushdown languages
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Height-deterministic pushdown automata
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Minimizing variants of visibly pushdown automata
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Regular languages of nested words: fixed points, automata, and synchronization
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
An intersection type system for deterministic pushdown automata
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Fast algorithms for Dyck-CFL-reachability with applications to alias analysis
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Trimming visibly pushdown automata
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Input-Driven queue automata: finite turns, decidability, and closure properties
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Early nested word automata for XPath query answering on XML streams
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
High-performance complex event processing over hierarchical data
ACM Transactions on Database Systems (TODS) - Invited papers issue
Simple tree pattern matching for trees in the prefix bar notation
Discrete Applied Mathematics
Hi-index | 0.01 |
We propose the class of visibly pushdown languages as embeddings of context-free languages that is rich enough to model program analysis questions and yet is tractable and robust like the class of regular languages. In our definition, the input symbol determines when the pushdown automaton can push or pop, and thus the stack depth at every position. We show that the resulting class Vpl of languages is closed under union, intersection, complementation, renaming, concatenation, and Kleene-*, and problems such as inclusion that are undecidable for context-free languages are Exptime-complete for visibly pushdown automata. Our framework explains, unifies, and generalizes many of the decision procedures in the program analysis literature, and allows algorithmic verification of recursive programs with respect to many context-free properties including access control properties via stack inspection and correctness of procedures with respect to pre and post conditions. We demonstrate that the class Vpl is robust by giving two alternative characterizations: a logical characterization using the monadic second order (MSO) theory over words augmented with a binary matching predicate, and a correspondence to regular tree languages. We also consider visibly pushdown languages of infinite words and show that the closure properties, MSO-characterization and the characterization in terms of regular trees carry over. The main difference with respect to the case of finite words turns out to be determinizability: nondeterministic Büchi visibly pushdown automata are strictly more expressive than deterministic Muller visibly pushdown automata.