Article ID Journal Published Year Pages File Type
9657410 Science of Computer Programming 2005 58 Pages PDF
Abstract
Recently, pushdown systems (PDSs) have been extended to weighted PDSs, in which each transition is labeled with a value, and the goal is to determine the meet-over-all-paths value (for paths that meet a certain criterion). This paper shows how weighted PDSs yield new algorithms for certain classes of interprocedural dataflow-analysis problems.
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Weighted pushdown systems and their application to interprocedural dataflow analysis
Authors
, , , ,