Weighted Pushdown Systems with Indexed Weight Domains

The reachability analysis of weighted pushdown systems is a very powerful technique in verification and analysis of recursive programs. Each transition rule of a weighted pushdown system is associated with an element of a bounded semiring representing the weight of the rule. However, we have realized that the restriction of the boundedness is too strict and the formulation of weighted pushdown systems is not general enough for some applications. To generalize weighted pushdown systems, we first introduce the notion of stack signatures that summarize the effect of a computation of a pushdown system and formulate pushdown systems as automata over the monoid of stack signatures. We then generalize weighted pushdown systems by introducing semirings indexed by the monoid and weaken the boundedness to local boundedness.

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

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

[3]  Dominique Perrin,et al.  Finite Automata , 1958, Philosophy.

[4]  Eliahu Shamir,et al.  A Representation Theorem for Algebraic and Context-Free Power Series in Noncommuting Variables , 1967, Inf. Control..

[5]  Akihiko Tozawa,et al.  XML Validation for Context-Free Grammars , 2006, APLAS.

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

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

[8]  Dejvuth Suwimonteerabuth.  Reachability in pushdown systems: algorithms and applications , 2009 .

[9]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..

[10]  Yasuhiko Minamide.  Verified Decision Procedures on Context-Free Grammars , 2007, TPHOLs.

[11]  Jacques Sakarovitch,et al.  Elements of Automata Theory , 2009 .

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

[13]  Mizuhito Ogawa,et al.  Well-Structured Pushdown Systems , 2013, CONCUR.

[14]  Somesh Jha,et al.  Weighted pushdown systems and their application to interprocedural dataflow analysis , 2003, Sci. Comput. Program..

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

[16]  Yasuhiko Minamide,et al.  Pushdown Systems with Stack Manipulation , 2013, ATVA.

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

[18]  Akihiko Tozawa,et al.  Complexity Results on Balanced Context-Free Languages , 2007, FoSSaCS.