Weighted Pushdown Systems and Their Applications to Interprocedural Dataflow Analysis
| dc.contributor.author | Reps, Thomas | en_US |
| dc.contributor.author | Schwoon, Stefan | en_US |
| dc.contributor.author | Jha, Somesh | en_US |
| dc.date.accessioned | 2012-03-15T17:16:55Z | |
| dc.date.available | 2012-03-15T17:16:55Z | |
| dc.date.created | 2003 | en_US |
| dc.date.issued | 2003 | |
| dc.description.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. | en_US |
| dc.format.mimetype | application/pdf | en_US |
| dc.identifier.citation | TR1470 | en_US |
| dc.identifier.uri | http://digital.library.wisc.edu/1793/60338 | |
| dc.publisher | University of Wisconsin-Madison Department of Computer Sciences | en_US |
| dc.title | Weighted Pushdown Systems and Their Applications to Interprocedural Dataflow Analysis | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1