Search results for "PushDown"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
154	Xin Li 0010, Mizuhito Ogawa	Conditional weighted pushdown systems and applications.	PEPM	2010	DBLP DOI BibTeX RDF	weighted pushdown systems, model checking
146	Markus Holzer 0001, Martin Kutrib	Flip-Pushdown Automata: Nondeterminism Is Better than Determinism.	Developments in Language Theory	2003	DBLP DOI BibTeX RDF
126	Christof Löding, P. Madhusudan, Olivier Serre	Visibly Pushdown Games.	FSTTCS	2004	DBLP DOI BibTeX RDF
110	Markus Holzer 0001, Martin Kutrib	Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k.	ICALP	2003	DBLP DOI BibTeX RDF
106	Juraj Hromkovic, Georg Schnitger	On the Power of Randomized Pushdown Automata.	Developments in Language Theory	2001	DBLP DOI BibTeX RDF
96	Benjamin Aminof, Aniello Murano, Moshe Y. Vardi	Pushdown Module Checking with Imperfect Information.	CONCUR	2007	DBLP DOI BibTeX RDF
93	Rajeev Alur, P. Madhusudan	Visibly pushdown languages.	STOC	2004	DBLP DOI BibTeX RDF	?-languages, verification, logic, context-free languages, pushdown automata, regular tree languages
83	Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre	Winning Regions of Higher-Order Pushdown Games.	LICS	2008	DBLP DOI BibTeX RDF	higher-order pushdown automata, mu-calculus model-checking, parity games, higher-order recursion schemes
83	Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre	Collapsible Pushdown Automata and Recursion Schemes.	LICS	2008	DBLP DOI BibTeX RDF	Higher-order pushdown automata, game semantics, higher-order recursion schemes
83	Richard Mayr	On the Complexity of Bisimulation Problems for Pushdown Automata.	IFIP TCS	2000	DBLP DOI BibTeX RDF	verification, complexity, bisimulation, Pushdown automata
79	Rajeev Alur, Swarat Chaudhuri, P. Madhusudan	A fixpoint calculus for local and global program flows.	POPL	2006	DBLP DOI BibTeX RDF	infinite-state, model-checking, verification, games, specification, logic, ?-calculus, pushdown systems
75	Nutan Limaye, Meena Mahajan, Antoine Meyer	On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata.	CSR	2008	DBLP DOI BibTeX RDF
75	Henning Bordihn, Markus Holzer 0001, Martin Kutrib	Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages.	Developments in Language Theory	2004	DBLP DOI BibTeX RDF
75	Zhe Dang, Tevfik Bultan, Oscar H. Ibarra, Richard A. Kemmerer	Past Pushdown Timed Automata.	CIAA	2001	DBLP DOI BibTeX RDF
73	Viraj Kumar, P. Madhusudan, Mahesh Viswanathan 0001	Visibly pushdown automata for streaming XML.	WWW	2007	DBLP DOI BibTeX RDF	XML, query, typing, schema, streaming algorithms, pushdown automata
73	Jianliang Xu, Yun-Xia Liu, Tsunehiro Yoshinaga	A Note on Non-Closure Property of Sublogarithmic Space-Bounded 1-Inkdot Alternating Pushdown Automata with Only Existential (Universal) States.	J. Comput. Sci. Technol.	2006	DBLP DOI BibTeX RDF	alternating pushdown automata, 1-inkdot, sublogarithmic space, closure property
69	Petr Jancar, Jirí Srba	Undecidability of bisimilarity by defender's forcing.	J. ACM	2008	DBLP DOI BibTeX RDF	process algebra, undecidability, pushdown automata, Bisimilarity
65	Alexander Kartzow	FO Model Checking on Nested Pushdown Trees.	MFCS	2009	DBLP DOI BibTeX RDF
65	Jean-François Raskin, Frédéric Servais	Visibly Pushdown Transducers.	ICALP (2)	2008	DBLP DOI BibTeX RDF
65	Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl	Emptiness of Multi-pushdown Automata Is 2ETIME-Complete.	Developments in Language Theory	2008	DBLP DOI BibTeX RDF
65	Benjamin Aminof, Axel Legay, Aniello Murano, Olivier Serre	µ-calculus Pushdown Module Checking with Imperfect State Information.	IFIP TCS	2008	DBLP DOI BibTeX RDF
65	Birgit Jenner, Bernd Kirsig	Characterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata.	STACS	1988	DBLP DOI BibTeX RDF
63	Vineet Kahlon, Aarti Gupta	On the analysis of interacting pushdown systems.	POPL	2007	DBLP DOI BibTeX RDF	model checking, concurrency, dataflow analysis, LTL, mu-calculus, pushdown systems
63	Martin Kutrib, Andreas Malcher, Larissa Werlein	Regulated Nondeterminism in Pushdown Automata.	CIAA	2007	DBLP DOI BibTeX RDF	regulated nondeterminism, limited nondeterminism, pushdown automata, closure properties
63	Juraj Hromkovic, Georg Schnitger	Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes.	ICALP	2003	DBLP DOI BibTeX RDF	multicounter machines, randomization, nondeterminism, complexity theory, pushdown automata
63	Jae-Young Chang, Sang-goo Lee	An optimization of disjunctive queries: union-pushdown.	COMPSAC	1997	DBLP DOI BibTeX RDF	disjunctive query optimization, disjunctive predicates, plan generation, union-pushdown, performance analysis, query processing, query optimizers
61	Gerhard Buntrock, Albrecht Hoene	Reversals and Alternation.	STACS	1989	DBLP DOI BibTeX RDF
55	Claude Bolduc, Béchir Ktari	Visibly Pushdown Kleene Algebra and Its Use in Interprocedural Analysis of (Mutually) Recursive Programs.	RelMiCS	2009	DBLP DOI BibTeX RDF
55	Arnaud Carayol, Michaela Slaats	Positional Strategies for Higher-Order Pushdown Parity Games.	MFCS	2008	DBLP DOI BibTeX RDF
55	Giovanni Pighizzini	Deterministic Pushdown Automata and Unary Languages.	CIAA	2008	DBLP DOI BibTeX RDF
55	Amashini Naidoo, Nelishia Pillay	Evolving pushdown automata.	SAICSIT	2007	DBLP DOI BibTeX RDF	genetic programming, grammatical inference
55	Laura Bozzelli	Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages.	CONCUR	2007	DBLP DOI BibTeX RDF
55	Alexander Meduna	Deep pushdown automata.	Acta Informatica	2006	DBLP DOI BibTeX RDF
55	Didier Caucal	Synchronization of Pushdown Automata.	Developments in Language Theory	2006	DBLP DOI BibTeX RDF
55	Vince Bárány, Christof Löding, Olivier Serre	Regularity Problems for Visibly Pushdown Languages.	STACS	2006	DBLP DOI BibTeX RDF
55	Masaki Nakanishi	On the Power of One-Sided Error Quantum Pushdown Automata with Classical Stack Operations.	COCOON	2004	DBLP DOI BibTeX RDF
55	Maurice H. ter Beek, Erzsébet Csuhaj-Varjú, Victor Mitrana	Teams of Pushdown Automata.	Ershov Memorial Conference	2003	DBLP DOI BibTeX RDF
55	George Rahonis	Alphabetic Pushdown Tree Transducers.	Developments in Language Theory	2003	DBLP DOI BibTeX RDF
55	Oscar H. Ibarra, Zhe Dang	On Removing the Pushdown Stack in Reachability Constructions.	ISAAC	2001	DBLP DOI BibTeX RDF
55	Zhe Dang	Binary Reachability Analysis of Pushdown Timed Automata with Dense Clocks.	CAV	2001	DBLP DOI BibTeX RDF
55	Thierry Cachat	Two-Way Tree Automata Solving Pushdown Games.	Automata, Logics, and Infinite Games	2001	DBLP DOI BibTeX RDF
55	Marats Golovkins	Quantum Pushdown Automata.	SOFSEM	2000	DBLP DOI BibTeX RDF
55	Oscar H. Ibarra, Tao Jiang 0001, Nicholas Q. Trân, Hui Wang 0008	On the Equivalence of Two-way Pushdown Automata and Counter Machines over Bounded Languages.	STACS	1993	DBLP DOI BibTeX RDF
53	Alex Thomo, Srinivasan Venkatesh 0001	Rewriting of visibly pushdown languages for xml data integration.	CIKM	2008	DBLP DOI BibTeX RDF	visibly pushdown languages, data integration, xml
53	Salvatore La Torre, Margherita Napoli, Mimmo Parente	The word problem for visibly pushdown languages described by grammars.	Formal Methods Syst. Des.	2007	DBLP DOI BibTeX RDF	Visibly pushdown grammars, XML, Verification
53	Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi	Bottom-Up Tree Pushdown Automata and Rewrite Systems.	RTA	1991	DBLP DOI BibTeX RDF	Rewrite systems (=term rewrite systems), Church-Rosser (=confluent) systems, Noetherian systems, Convergent (=noetherian+confluent) systems, (Deterministic) tree automaton with pushdown store, (Recognizable, Context-free) tree languages
51	Olivier Serre	Parity Games Played on Transition Graphs of One-Counter Processes.	FoSSaCS	2006	DBLP DOI BibTeX RDF
51	Akio Fujiyoshi, Takumi Kasai	Spinal-Formed Context-Free Tree Grammars.	Theory Comput. Syst.	2000	DBLP DOI BibTeX RDF
48	Christopher H. Broadbent, C.-H. Luke Ong	On Global Model Checking Trees Generated by Higher-Order Recursion Schemes.	FoSSaCS	2009	DBLP DOI BibTeX RDF	Collapsible Pushdown Automaton, Parity Game, Model Checking, Game Semantics, Recursion Scheme
45	Nguyen Van Tang, Mizuhito Ogawa	Event-Clock Visibly Pushdown Automata.	SOFSEM	2009	DBLP DOI BibTeX RDF
45	Jan A. Bergstra, Inge Bethke, Alban Ponse	Decision problems for pushdown threads.	Acta Informatica	2007	DBLP DOI BibTeX RDF
45	Dirk Nowotka, Jirí Srba	Height-Deterministic Pushdown Automata.	MFCS	2007	DBLP DOI BibTeX RDF
45	Dario Carotenuto, Aniello Murano, Adriano Peron	2-Visibly Pushdown Automata.	Developments in Language Theory	2007	DBLP DOI BibTeX RDF
45	Jacques Chabin, Pierre Réty	Visibly Pushdown Languages and Term Rewriting.	FroCoS	2007	DBLP DOI BibTeX RDF	term rewriting, tree languages
45	Dietrich Kuske, Markus Lohrey	Monadic Chain Logic Over Iterations and Applications to Pushdown Systems.	LICS	2006	DBLP DOI BibTeX RDF
45	Salvatore La Torre, Margherita Napoli, Mimmo Parente	On the Membership Problem for Visibly Pushdown Languages.	ATVA	2006	DBLP DOI BibTeX RDF
45	Dejvuth Suwimonteerabuth, Stefan Schwoon, Javier Esparza	Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains.	ATVA	2006	DBLP DOI BibTeX RDF
45	Martin Kutrib, Andreas Malcher	Context-Dependent Nondeterminism for Pushdown Automata.	Developments in Language Theory	2006	DBLP DOI BibTeX RDF
45	Jirí Srba	Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation.	CSL	2006	DBLP DOI BibTeX RDF
45	Rajeev Alur, Swarat Chaudhuri	Branching Pushdown Tree Automata.	FSTTCS	2006	DBLP DOI BibTeX RDF
45	Laura Bozzelli, Aniello Murano, Adriano Peron	Pushdown Module Checking.	LPAR	2005	DBLP DOI BibTeX RDF
45	David A. Wagner 0001	Pushdown Model Checking for Security.	SPIN	2005	DBLP DOI BibTeX RDF
45	Arnaud Carayol	Regular Sets of Higher-Order Pushdown Stacks.	MFCS	2005	DBLP DOI BibTeX RDF
45	Markus Holzer 0001, Friedrich Otto	Shrinking Multi-pushdown Automata.	FCT	2005	DBLP DOI BibTeX RDF
45	Orna Kupferman, Nir Piterman, Moshe Y. Vardi	Pushdown Specifications.	LPAR	2002	DBLP DOI BibTeX RDF
45	Teodor Knapik, Damian Niwinski, Pawel Urzyczyn	Higher-Order Pushdown Trees Are Easy.	FoSSaCS	2002	DBLP DOI BibTeX RDF
45	Giovanni Pighizzini	Unary Pushdown Automata and Auxiliary Space Lower Bounds.	MFCS	2000	DBLP DOI BibTeX RDF
45	Igor Walukiewicz	Model Checking CTL Properties of Pushdown Systems.	FSTTCS	2000	DBLP DOI BibTeX RDF
45	Jonathan Goldstine, Hing Leung, Detlef Wotschke	Measuring Nondeterminism in Pushdown Automata.	STACS	1997	DBLP DOI BibTeX RDF
45	Ahmed Bouajjani, Javier Esparza, Oded Maler	Reachability Analysis of Pushdown Automata: Application to Model-Checking.	CONCUR	1997	DBLP DOI BibTeX RDF
45	Olaf Burkart, Bernhard Steffen	Pushdown Processes: Parallel Composition and Model Checking.	CONCUR	1994	DBLP DOI BibTeX RDF
43	Tomás Flouri, Borivoj Melichar, Jan Janousek	Aho-Corasick like multiple subtree matching by pushdown automata.	SAC	2010	DBLP DOI BibTeX RDF	subtree matching, pattern matching, tree, pushdown automata, subtree
43	Elvira Mayordomo, Philippe Moser	Polylog Space Compression Is Incomparable with Lempel-Ziv and Pushdown Compression.	SOFSEM	2009	DBLP DOI BibTeX RDF	plogon, Lempel-Ziv algorithm, pushdown compression, computational complexity, compression algorithms, data stream algorithms
43	Géraud Sénizergues	The Equivalence Problem for Deterministic Pushdown Automata is Decidable.	ICALP	1997	DBLP DOI BibTeX RDF	deterministic pushdown automata, finite dimensional vector spaces, matrix semigroups, complete formal systems, rational series
43	Tirza Hirst, David Harel	On the Power of Bounded Concurrency II: Pushdown Automata.	J. ACM	1994	DBLP DOI BibTeX RDF	cooperative concurrency, pushdown automata, succinctness
41	Salvatore La Torre, Parthasarathy Madhusudan, Gennaro Parlato	A Robust Class of Context-Sensitive Languages.	LICS	2007	DBLP DOI BibTeX RDF
41	Michael Emmi, Rupak Majumdar	Decision Problems for the Verification of Real-Time Software.	HSCC	2006	DBLP DOI BibTeX RDF
41	Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, Jan Strejcek	Reachability Analysis of Multithreaded Software with Asynchronous Communication.	FSTTCS	2005	DBLP DOI BibTeX RDF
41	Rajeev Alur, Kousha Etessami, P. Madhusudan	A Temporal Logic of Nested Calls and Returns.	TACAS	2004	DBLP DOI BibTeX RDF
41	Rahul Santhanam	On Separators, Segregators and Time versus Space.	CCC	2001	DBLP DOI BibTeX RDF
41	Antonín Kucera 0001	On Simulation-Checking with Sequential Systems.	ASIAN	2000	DBLP DOI BibTeX RDF
41	Holger Petersen 0001, John Michael Robson	Efficient Simulations by Queue Machines.	ICALP	1998	DBLP DOI BibTeX RDF
39	Pavol Duris, Zvi Galil	On Reversal-Bounded Counter Machines and on Pushdown Automata with a Bound on the Size of the Pushdown Store.	ICALP	1982	DBLP DOI BibTeX RDF
38	Rajeev Alur, P. Madhusudan	Adding nesting structure to words.	J. ACM	2009	DBLP DOI BibTeX RDF	software model checking, tree automata, Pushdown automata, XML processing
38	Andrzej S. Murawski	Reachability Games and Game Semantics: Comparing Nondeterministic Programs.	LICS	2008	DBLP DOI BibTeX RDF	Idealized Algol, pushdown graphs, reachability games, nondeterminism, game semantics
38	Hyungwoo Kang, Kibom Kim, Soon Jwa Hong, Dong Hoon Lee 0001	A Model for Security Vulnerability Pattern.	ICCSA (3)	2006	DBLP DOI BibTeX RDF	Abstract Syntax Tree (AST), Static analysis, Buffer overflow, Software security, Pushdown Automata (PDA)
38	Olivier Serre	Games with Winning Conditions of High Borel Complexity.	ICALP	2004	DBLP DOI BibTeX RDF	Borel Complexity, Pushdown Automata, Two-player Games
38	Géraud Sénizergues	The Equivalence Problem for t-Turn DPDA Is Co-NP.	ICALP	2003	DBLP DOI BibTeX RDF	deterministic pushdown automata, matrix semi-groups, complexity, equivalence problem
38	Jianjun Chen 0001, David J. DeWitt, Jeffrey F. Naughton	Design and Evaluation of Alternative Selection Placement Strategies in Optimizing Continuous Queries.	ICDE	2002	DBLP DOI BibTeX RDF	Incrmental Group Optimization, Selection Placement Strategies, PushDown, PullUp, Query Optimization, Cost Models, Continuous Queries
38	Vitaly Shmatikov	Probabilistic Analysis of Anonymity.	CSFW	2002	DBLP DOI BibTeX RDF	certificate-chain discovery, certificate-set analysis, model checking, authorization, naming, pushdown system, SPKI/SDSI
38	Somesh Jha, Thomas W. Reps	Analysis of SPKI/SDSI Certificates Using Model Checking.	CSFW	2002	DBLP DOI BibTeX RDF	certificate-chain discovery, certificate-set analysis, model checking, authorization, naming, pushdown system, SPKI/SDSI
38	Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini 0001	Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures.	STACS	2000	DBLP DOI BibTeX RDF	uniform random generation, auxiliary pushdown automata, rational trace languages, inherent ambiguity, context-free languages, approximate counting
38	Géraud Sénizergues	T(A) = T(B)?	ICALP	1999	DBLP DOI BibTeX RDF	deterministic pushdown transducers, finite dimensional vector spaces, matrix semi-groups, complete formal systems, test-sets, rational series
35	Tomasz Jurdzinski	Probabilistic Length-Reducing Two-Pushdown Automata.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF
35	Nutan Limaye, Meena Mahajan	Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata.	LATA	2009	DBLP DOI BibTeX RDF
35	Paul Hänsch, Michaela Slaats, Wolfgang Thomas	Parametrized Regular Infinite Games and Higher-Order Pushdown Strategies.	FCT	2009	DBLP DOI BibTeX RDF
35	Matthew Hague, C.-H. Luke Ong	Winning Regions of Pushdown Parity Games: A Saturation Method.	CONCUR	2009	DBLP DOI BibTeX RDF
35	Anil Seth	Games on Multi-stack Pushdown Systems.	LFCS	2009	DBLP DOI BibTeX RDF
35	Anil Seth	Games on Higher Order Multi-stack Pushdown Systems.	RP	2009	DBLP DOI BibTeX RDF
35	Tamar Aizikowitz, Michael Kaminski	Conjunctive Grammars and Alternating Pushdown Automata.	WoLLIC	2008	DBLP DOI BibTeX RDF