Visibly Pushdown Languages

Visibly Pushdown Languages (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Rajeev Alur , P. Madhusudan

Citations:

99 - 14 self

BibTeX

@MISC{Alur03visiblypushdown,
    author = {Rajeev Alur and P. Madhusudan},
    title = {Visibly Pushdown Languages},
    year = {2003}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

this paper, we propose visibly pushdown languages as the answer with desirable closure properties, tractable decision problems, multiple equivalentcharacterizations, and adequate for formulating program analysis questions

Citations

3377	Introduction to Automata Theory Languages and Computation. 2nd edition. Addison-Wesley Publishing Company, 2000. de - Hopcroft, Ullman - 2004
743	First-Order Dynamic Logic - Harel - 1997
510	P.: An automata-theoretic approach to automatic program verification - Vardi, Wolper - 1986
430	Automata on infinite objects - Thomas - 1990
320	Precise interprocedural dataflow analysis with applications to constant propagation - Sagiv, Reps, et al. - 1996
239	O.: Reachability analysis of pushdown automata: Application to model-checking - Bouajjani, Esparza, et al. - 1997
233	An n log n algorithm for minimizing states in a finite automation - Hopcroft - 1971
209	P.: Reasoning about infinite computations - Vardi, Wolper - 1994
194	Bebop: A symbolic model checker for boolean programs - Ball, Rajamani
178	MOPS: An infrastructure for examining security properties of software - Chen, Wagner - 2002
90	M.: Analysis of recursive state machines - Alur, Benedikt, et al. - 2005
78	Automata on in objects - Thomas - 1990
75	On the complexity of ω-automata - Safra - 1988
73	Local Model-Checking for Context-Free Processes - Hungar, Steffen - 1993
67	On the complexity of !-automata - Safra - 1988
66	W.: Temporal-safety proofs for systems code - Henzinger, Jhala, et al. - 2002
62	Verification of control flow based security properties - Jensen, Métayer, et al. - 1999
52	Linear automaton transformations - Nerode - 1958
50	Model checking LTL with regular valuations for pushdown systems - Esparza, Kucera, et al.
48	Context-Free Languages and Push-Down Automata - Autebert, Berstel, et al. - 1997
46	A temporal logic of nested calls and returns - Alur, Etessami, et al. - 2004
32	Parenthesis grammars - McNaughton - 1967
22	Logics for context-free languages - Lautemann, Schwentick, et al. - 1994
20	A characterization of parenthesis languages - KNUTH
18	M.: Tree automata techniques and applications. Draft, Available at http://www.grappa.univ-lille3.fr/tata - Comon, Dauchet, et al. - 2002
18	Stack size analysis for interrupt-driven programs - Chatterjee, Ma, et al. - 2004
17	Visibly pushdown games - Löding, Madhusudan, et al.
17	Pushdown games with unboundedness and regular conditions - Bouquet, Serre, et al. - 2003
16	Third-order idealized algol with iteration is decidable - Murawski, Walukiewicz - 2005
15	Precise interprocedural data analysis via graph reachability - Reps, Horwitz, et al.
14	Solving pushdown games with a Σ3 winning condition - Cachat, Duparc, et al. - 2002
13	Balanced grammars and their languages - Berstel, Boasson - 2002
10	Visibly pushdown expression effects for xml stream processing - Pitcher - 2005
10	A fixpoint calculus for local and global program flows, in - Alur, Chaudhuri, et al. - 2006
5	Veri of control based security properties - Jensen, Metayer, et al. - 1999
2	Theory of omega-Languages. I. Characterizations of omegaContext -Free Languages. JCSS 15(2 - Cohen, Gold - 1977
1	A temporal logic of nested calls and returns. Submitted for publication (available at - Alur, Etessami, et al. - 2003
1	Solving pushdown games with a # winning condition - Cachat, Duparc, et al. - 2002