A Generic Worklist Algorithm for Graph Reachability Problems in Program Analysis (2001)
Cached
Download Links
- [swen.uwaterloo.ca]
- [swen.uwaterloo.ca]
- [www.swen.uwaterloo.ca]
- DBLP
Other Repositories/Bibliography
| Venue: | Proceedings of the Business and Industry Simulation Symposium. Washington D.C. [SCS |
| Citations: | 4 - 2 self |
BibTeX
@TECHREPORT{Rayside01ageneric,
author = {Derek Rayside and Kostas Kontogiannis},
title = {A Generic Worklist Algorithm for Graph Reachability Problems in Program Analysis},
institution = {Proceedings of the Business and Industry Simulation Symposium. Washington D.C. [SCS},
year = {2001}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Many program analyses involve, or can be expressed in terms of, a graph reachability problem. We present a generic worklist-style algorithm capable of expressing and solving the graph reachability components of many such analyses. We compare our framework with the language reachability framework proposed by Thomas Reps, and show that some problems are expressible in both frameworks, and some problems can be expressed in only one of the frameworks.
