bibliographer - Pushdown automata

Equivalence of pushdown automata via first-order grammars Petr Jančar Thu 10 August 2023
Decidability of DPDA Language Equivalence via First-Order Grammars Petr Jancar Tue 17 January 2023
On the computational complexity of algebraic numbers : the Hartmanis-Stearns problem revisited Boris Adamczewski Julien Cassaigne Marion Le Gonidec Tue 14 December 2021
Good-for-Games ømega-Pushdown Automata Karoliina Lehtinen Martin Zimmermann Sat 04 July 2020
Model Checking LTL with Regular Valuations for Pushdown Systems Javier Esparza Antonín Kucera Stefan Schwoon Thu 15 August 2019
Undecidability of Bisimilarity by Defender's Forcing Petr Jančar Jivří Srba Tue 25 June 2019
Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems Lorenzo Clemente Sławomir Lasota Ranko Lazić Filip Mazowiecki Wed 12 June 2019
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata Antonín Kučera Richard Mayr Mon 21 January 2019
Adding Dense-Timed Stack to Integer Reset Timed Automata Devendra Bhave Shibashis Guha Tue 05 September 2017
Unboundedness and Downward Closures of Higher-order Pushdown Automata Matthew Hague Jonathan Kochems C.-H. Luke Ong Sat 16 January 2016
Logics for Weighted Timed Pushdown Automata Manfred Droste Vitaly Perevoshchikov Sat 26 December 2015
Monadic Chain Logic Over Iterations and Applications to Pushdown Systems Dietrich Kuske Markus Lohrey Fri 18 September 2015
Verification of context-free timed systems using linear hybrid observers Ahmed Bouajjani Rachid Echahed Riadh Robbana Wed 22 October 2014
Left-most Derivation and Shadow-pushdown Automata for Context-sensitive Languages Benedek Nagy Mon 24 February 2014
The reachability problem for vector addition systems with a stack is not elementary Ranko Lazic Sun 10 November 2013
Improving pushdown system model checking Akash Lal Thomas Reps Wed 30 October 2013
Pushdown timed automata: a binary reachability characterization and safety verification Zhe Dang Mon 21 October 2013
Nested timed automata Guoqiang Li Xiaojuan Cai Mizuhito Ogawa Shoji Yuen Fri 18 October 2013
Model Checking Multithreaded Programs with Asynchronous Atomic Methods Koushik Sen Mahesh Viswanathan Wed 02 October 2013
Introspective pushdown analysis Christopher Earl Ilya Sergey J. Ian Johnson Matthew Might David Van Horn Mon 22 July 2013
Pushdown Systems with Stack Manipulation Yuya Uezato Yasuhiko Minamide Mon 22 July 2013
Streamable fragments of forward XPath Olivier Gauwin Joachim Niehren Mon 15 July 2013
Model checking SPKI/SDSI S. Jha T. Reps Thu 13 June 2013
Efficient algorithms for alternating pushdown systems with an application to the computation of certificate chains Dejvuth Suwimonteerabuth Stefan Schwoon Javier Esparza Wed 12 June 2013
Analysing mu-calculus properties of pushdown systems Matthew Hague C.-H. Luke Ong Wed 12 June 2013
Model-Checking LTL with Regular Valuations for Pushdown Systems Javier Esparza Antonín Kucera Stefan Schwoon Thu 11 April 2013
An efficient automata approach to some problems on context-free grammars Ahmed Bouajjani Javier Esparza Alain Finkel Oded Maler Peter Rossmanith Bernard Willems Pierre Wolper Tue 12 March 2013
Symbolic Strategy Synthesis for Games on Pushdown Graphs Thierry Cachat Tue 12 March 2013
A fixpoint calculus for local and global program flows Rajeev Alur Swarat Chaudhuri P. Madhusudan Tue 12 March 2013
An intersection type system for deterministic pushdown automata Takeshi Tsukada Naoki Kobayashi Mon 18 February 2013
Games on Pushdown Graphs and Extensions Thierry Cachat Thu 31 January 2013
Adding nesting structure to words Rajeev Alur P. Madhusudan Tue 22 January 2013
Adding Time to Pushdown Automata Parosh Aziz Abdulla Mohamed Faouzi Atig Jari Stenman Wed 19 December 2012
Regular symbolic analysis of dynamic networks of pushdown systems Ahmed Bouajjani Markus Muller-Olm Tayssir Touili Tue 27 November 2012
On regular tree languages and deterministic pushdown automata Jan Janoušek Bořivoj Melichar Fri 02 November 2012
Reachability Analysis of Communicating Pushdown Systems Alexander Heußner Jérôme Leroux Anca Muscholl Grégoire Sutre Wed 03 October 2012
Automatic verification of recursive procedures with one integer parameter Ahmed Bouajjani Peter Habermehl Richard Mayr Mon 24 September 2012
Dense-Timed Pushdown Automata P. A. Abdulla M. F. Atig J. Stenman Thu 20 September 2012
Analysis of recursively parallel programs Ahmed Bouajjani Michael Emmi Thu 20 September 2012
Subcubic algorithms for recursive state machines Swarat Chaudhuri Wed 11 July 2012
CFA2: a Context-Free Approach to Control-Flow Analysis Dimitrios Vardoulakis Olin Shivers Wed 11 July 2012
Analysis of recursive state machines Rajeev Alur Michael Benedikt Kousha Etessami Patrice Godefroid Thomas Reps Mihalis Yannakakis Tue 10 July 2012
Winning Regions of Pushdown Parity Games: A Saturation Method Matthew Hague C. -H. Ong Thu 05 July 2012
Context-sensitive synchronization-sensitive analysis is undecidable G. Ramalingam Wed 04 July 2012
Analysis of Recursive Game Graphs Using Data Flow Equations K. Etessami Wed 04 July 2012
A Direct Symbolic Approach to Model Checking Pushdown Systems (extended abstract) Alain Finkel Bernard Willems Pierre Wolper Wed 04 July 2012
Analysis of Timed Recursive State Machines M. Benerecetti S. Minopoli A. Peron Sat 30 June 2012
On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures Ahmed Bouajjani Rachid Echahed Riadh Robbana Sat 30 June 2012
Reachability analysis of communicating pushdown systems Alexander Heußner Jérôme Leroux Anca Muscholl Grégoire Sutre Thu 03 May 2012
A saturation method for the modal mu-calculus over pushdown systems M. Hague C.-H.L. Ong Thu 08 March 2012
The theory of ends, pushdown automata, and second-order logic David E. Muller Paul E. Schupp Tue 06 March 2012
Pushdown Processes: Games and Model-Checking Igor Walukiewicz Tue 06 March 2012
Model-Checking Pushdown Systems Stefan Schwoon Tue 06 March 2012
Efficient Algorithms for Model Checking Pushdown Systems Javier Esparza David Hansel Peter Rossmanith Stefan Schwoon Tue 06 March 2012
Reachability analysis of pushdown automata: Application to model-checking and saturation method Ahmed Bouajjani Javier Esparza Oded Maler Tue 06 March 2012

Library Size: 13G (55 entries), Last Updated: Apr 05, 2026, 08:41:35, Build Time: N/A

[show logs] [hide logs]