Originally published on sciencedirect.com
Authors:
Thomas W. Reps, Stefan Schwoon, Somesh Jha and David Melski
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.