Loading...
Please wait, while we are loading the content...
Similar Documents
A.: Projection Merging: Reducing Redundancies in Inclusion Constraint Graphs (2000)
| Content Provider | CiteSeerX |
|---|---|
| Author | Su, Zhendong Aiken, Alexander |
| Description | Inclusion-based program analyses are implemented by adding new edges to directed graphs. In most analyses, there are many dierent ways to add a transitive edge between two nodes, namely through each dierent path connecting the nodes. This path redundancy limits the scalability of these analyses. We present projection merging, a technique to reduce path redundancy. Combined with cycle elimina-tion [7], projection merging achieves orders of magnitude speedup of analysis time on programs over that of using cy-cle elimination alone. 1 |
| File Format | |
| Language | English |
| Publisher Date | 2000-01-01 |
| Publisher Institution | In: Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM |
| Access Restriction | Open |
| Subject Keyword | Analysis Time Dierent Path Cy-cle Elimination Projection Merging Path Redundancy Transitive Edge Inclusion Constraint Graph Many Dierent Way Inclusion-based Program Analysis Achieves Order Cycle Elimina-tion Present Projection Merging New Edge Magnitude Speedup |
| Content Type | Text |
| Resource Type | Article |
