Weighted pushdown systems and their application to interprocedural dataflow analysis (2003)
Cached
Download Links
- [www.cs.wisc.edu]
- [www.cs.wisc.edu]
- [www.cs.wisc.edu]
- [research.cs.wisc.edu]
- [www.cs.wisc.edu]
- [www.cs.wisc.edu]
- [research.cs.wisc.edu]
- [research.cs.wisc.edu]
- DBLP
Other Repositories/Bibliography
by
Thomas Reps
,
Stefan Schwoon
,
Somesh Jha
| Venue: | Sci. of Comp. Prog |
| Citations: | 96 - 31 self |
BibTeX
@INPROCEEDINGS{Reps03weightedpushdown,
author = {Thomas Reps and Stefan Schwoon and Somesh Jha},
title = {Weighted pushdown systems and their application to interprocedural dataflow analysis},
booktitle = {Sci. of Comp. Prog},
year = {2003},
pages = {189--213}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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. 1
