Pushdown Systems with Stack Manipulation

Pushdown systems are a model of computation equipped with one stack where only the top of the stack is inspected and modified in each step of transitions. Although this is a natural restriction, some extensions of pushdown systems require more general operations on stack: conditional pushdown systems inspect the whole stack contents and discrete timed pushdown systems increment the ages of the whole stack contents.

[1]  Antoni Mazurkiewicz,et al.  CONCUR '97: Concurrency Theory , 1997, Lecture Notes in Computer Science.

[2]  Parosh Aziz Abdulla,et al.  Dense-Timed Pushdown Automata , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[3]  Charles E. Hughes,et al.  The Finite Power Property for Context-Free Languages , 1981, Theor. Comput. Sci..

[4]  Mizuhito Ogawa,et al.  Conditional weighted pushdown systems and applications , 2010, PEPM '10.

[5]  Yasuhiko Minamide,et al.  Weighted Pushdown Systems with Indexed Weight Domains , 2013, TACAS.

[6]  Javier Esparza,et al.  Reachability Analysis of Pushdown Automata: Application to Model-Checking , 1997, CONCUR.

[7]  Wojciech Rytter,et al.  On the Maximal Number of Cubic Runs in a String , 2010, LATA.

[8]  Matthew Might,et al.  Introspective pushdown analysis of higher-order programs , 2012, ICFP.

[9]  Javier Esparza,et al.  Efficient Algorithms for Model Checking Pushdown Systems , 2000, CAV.

[10]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[11]  Marcus Nilsson,et al.  Regular Model Checking , 2000, CAV.

[12]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[13]  Javier Esparza,et al.  Model-Checking LTL with Regular Valuations for Pushdown Systems , 2001, TACS.

[14]  Pierre Wolper,et al.  A direct symbolic approach to model checking pushdown systems , 1997, INFINITY.

[15]  Frits W. Vaandrager,et al.  Automata Learning through Counterexample Guided Abstraction Refinement , 2012, FM.

[16]  Parosh Aziz Abdulla,et al.  The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems , 2012, LATA.

[17]  Javier Esparza,et al.  Rewriting Models of Boolean Programs , 2006, RTA.

[18]  Philip Wadler.  Call-by-Value Is Dual to Call-by-Name - Reloaded , 2005, RTA.

[19]  Shunsuke Mori,et al.  Reachability Analysis of the HTML5 Parser Specification and Its Application to Compatibility Testing , 2012, FM.