Weighted Pushdown Systems and Their Application to Interprocedural Dataflow Analysis

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-allpaths 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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2006
Accession Number
ADA449102

Entities

People

  • Somesh Jha
  • Stefan Schwoon
  • Thomas Reps

Organizations

  • University of Wisconsin Madison Department of Computer Science

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Automata
  • Coding
  • Computations
  • Computer Science
  • Context Free Grammars
  • Decoding
  • Environment
  • Grammars
  • Language
  • Models
  • Notation
  • Production
  • Sequences
  • Symbols
  • Transformers

Readers

  • Mathematical Modeling and Probability Theory.
  • Parallel and Distributed Computing.