Visibly pushdown languages
From MaRDI portal
Publication:3580970
DOI10.1145/1007352.1007390zbMATH Open1192.68396DBLPconf/stoc/AlurM04OpenAlexW2151033407WikidataQ29038653 ScholiaQ29038653MaRDI QIDQ3580970FDOQ3580970
Authors: Parthasarathy Madhusudan, Rajeev Alur 
Publication date: 15 August 2010
Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://repository.upenn.edu/cis_papers/191
Recommendations
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (only showing first 100 items - show all)
- Additive number theory via automata theory
- A perfect class of context-sensitive timed languages
- Visibly pushdown Kleene algebra and its use in interprocedural analysis of (mutually) recursive programs
- Deciding path size of nondeterministic (and input-driven) pushdown automata
- A note on an extension of PDL
- Context-free timed formalisms: robust automata and linear temporal logics
- When input-driven pushdown automata meet reversiblity
- Cost register automata for nested words
- Digging input-driven pushdown automata
- Diagnosis and opacity problems for infinite state systems modeled by recursive tile systems
- ML and extended branching VASS
- Trimming visibly pushdown automata
- Edit distance neighbourhoods of input-driven pushdown automata
- The word problem for visibly pushdown languages described by grammars
- Third-order Idealized Algol with iteration is decidable
- Sums of Palindromes: an Approach via Automata
- Temporal logics with language parameters
- On the decidability of infix inclusion problem
- Counting paths in VPA is complete for \(\#\mathrm{NC}^1\)
- Visibly counter languages and the structure of \(\mathrm {NC}^{1}\)
- Temporal Logic with Recursion.
- Conjunctive visibly-pushdown path queries
- Early nested word automata for XPath query answering on XML streams
- On the determinization of event-clock input-driven pushdown automata
- Colored nested words
- Algorithmic games for full ground references
- Beyond Language Equivalence on Visibly Pushdown Automata
- Grammatical characterizations of NPDAs and VPDAs with counters
- Consensus string problem for multiple regular languages
- Title not available (Why is that?)
- Checking regular invariance under tightly-controlled string modifications
- Word equations in the context of string solving
- String analysis as an abstract interpretation
- Weighted register automata and weighted logic on data words
- Weighted register automata and weighted logic on data words
- Deterministic input-driven queue automata: finite turns, decidability, and closure properties
- VLDL satisfiability and model checking via tree automata
- On the power of pushing or stationary moves for input-driven pushdown automata
- Temporal logic with recursion
- An Infinite Automaton Characterization of Double Exponential Time
- Logics for weighted timed pushdown automata
- Parameterized linear temporal logics meet costs: still not costlier than LTL
- Input-driven languages are linear conjunctive
- Logic for \(\omega\)-pushdown automata
- Multi-matching nested relations
- Synchronization of Regular Automata
- On the overlap assembly of strings and languages
- Program synthesis for interactive-security systems
- Visibly pushdown transducers
- Precedence automata and languages
- Edit-distance between visibly pushdown languages
- CaRet with forgettable past
- Input-driven pushdown automata on well-nested infinite strings
- A logical characterization of timed pushdown languages
- A survey of timed automata for the development of real-time systems
- Model checking probabilistic systems against pushdown specifications
- Evolving schemas for streaming XML
- On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
- Visibly linear temporal logic
- A complete refinement procedure for regular separability of context-free languages
- Model-checking structured context-free languages
- Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}}
- Automata-based verification of programs with tree updates
- Summarization for termination: No return!
- Visibly linear dynamic logic
- Leaf languages and string compression
- Queries on XML streams with bounded delay and concurrency
- Realizability of Concurrent Recursive Programs
- Automata, Languages and Programming
- Hardest languages for conjunctive and Boolean grammars
- Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages
- Automata for XML -- a survey
- Model checking procedural programs
- Comparing linear conjunctive languages to subfamilies of the context-free languages
- Streaming tree automata
- Query Automata for Nested Words
- Reachability relations of timed pushdown automata
- An automata-theoretic approach to infinite-state systems
- On the Membership Problem for Visibly Pushdown Languages
- P-hardness of the emptiness problem for visibly pushdown languages
- Fine hierarchies and m-reducibilities in theoretical computer science
- Descriptional complexity of unambiguous input-driven pushdown automata
- Sofic-Dyck shifts
- Visibly rational expressions
- Visibly rational expressions
- Conjunctive grammars and alternating pushdown automata
- On regular tree languages and deterministic pushdown automata
- Propositional dynamic logic with recursive programs
- Static analysis of XML security views and query rewriting
- Weighted Logics for Nested Words and Algebraic Formal Power Series
- Operator precedence and the visibly pushdown property
- Synchronizing relations on words
- Efficient determinization of visibly and height-deterministic pushdown automata
- Regular languages of nested words: fixed points, automata, and synchronization
- Space Complexity of Stack Automata Models
- Space Complexity of Stack Automata Models
- Ordered multi-stack visibly pushdown automata
- Descriptional complexity of input-driven pushdown automata
- 2-Visibly Pushdown Automata
- Event-Clock Visibly Pushdown Automata
Uses Software
This page was built for publication: Visibly pushdown languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3580970)
