Weighted pushdown systems and their application to interprocedural dataflow analysis

  • Authors:
  • Thomas Reps;Stefan Schwoon;Somesh Jha;David Melski

  • Affiliations:
  • Computer Sciences Department, University of Wisconsin and GrammaTech, Inc.;Institut für Formale Methoden der Informatik, Universität Stuttgart, Germany;Computer Sciences Department, University of Wisconsin;GrammaTech, Inc.

  • Venue:
  • Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.