Show simple item record

dc.contributor.authorReps, Thomasen_US
dc.contributor.authorSchwoon, Stefanen_US
dc.contributor.authorJha, Someshen_US
dc.date.accessioned2012-03-15T17:16:55Z
dc.date.available2012-03-15T17:16:55Z
dc.date.created2003en_US
dc.date.issued2003
dc.identifier.citationTR1470en_US
dc.identifier.urihttp://digital.library.wisc.edu/1793/60338
dc.description.abstractRecently, 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.en_US
dc.format.mimetypeapplication/pdfen_US
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleWeighted Pushdown Systems and Their Applications to Interprocedural Dataflow Analysisen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

  • CS Technical Reports
    Technical Reports Archive for the Department of Computer Sciences at the University of Wisconsin-Madison

Show simple item record