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.
Unable to display preview. Download preview PDF.
- [Eil74]Eilenberg, S.: Automata, Languages, and Machines, vol. A. Academic Press (1974)Google Scholar
- [ÉK09]Ésik, Z., Kuich, W.: Finite automata. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata, ch. 3, pp. 69–104. Springer (2009)Google Scholar
- [FWW97]Finkel, A., Willems, B., Wolper, P.: A direct symbolic approach to model checking pushdown systems. In: INFINITY 1997. ENTCS, vol. 9, pp. 27–39 (1997)Google Scholar
- [LO10]Li, X., Ogawa, M.: Conditional weighted pushdown systems and applications. In: Proceedings of the 2010 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, pp. 141–150 (2010)Google Scholar
- [Sak09]Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)Google Scholar
- [Suw09]Suwimonteerabuth, D.: Reachability in Pushdown Systems: Algorithms and Applications. PhD thesis, Technischen Universität München (2009)Google Scholar