Projection merging: reducing redundancies in inclusion constraint graphs

  • Authors:

  • Zhendong Su;Manuel Fähndrich;Alexander Aiken

  • Affiliations:

  • EECS Department, University of California, Berkeley, 387 Soda Hall #1776, Berkeley, CA;One Microsoft Way, Redmond, WA and EECS Department, University of California, Berkeley, 387 Soda Hall #1776, Berkeley, CA;EECS Department, University of California, Berkeley, 387 Soda Hall #1776, Berkeley, CA

  • Venue:
  • Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Inclusion-based program analyses are implemented by adding new edges to directed graphs. In most analyses, there are many different ways to add a transitive edge between two nodes, namely through each different 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 elimination [7], projection merging achieves orders of magnitude speedup of analysis time on programs over that of using cycle elimination alone.