Weighted Pushdown Systems and their Application to Interprocedural Dataflow Analysis

Thomas Reps, Stefan Schwoon, Somesh Jha, and David Melski

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.

(Click here to access the paper: PostScript, PDF.)