A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Weighted Pushdown Systems with Indexed Weight Domains
[chapter]
2013
Lecture Notes in Computer Science
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
doi:10.1007/978-3-642-36742-7_17
fatcat:bqp5fnhoqfhhbp2p62xp6j4q5q