Affiliation:
1. McGill University, Montreal, CANADA
Abstract
This paper reports on a new approach to solving a subset-based points-to analysis for Java using Binary Decision Diagrams (BDDs). In the model checking community, BDDs have been shown very effective for representing large sets and solving very large verification problems. Our work shows that BDDs can also be very effective for developing a points-to analysis that is simple to implement and that scales well, in both space and time, to large programs.The paper first introduces BDDs and operations on BDDs using some simple points-to examples. Then, a complete subset-based points-to algorithm is presented, expressed completely using BDDs and BDD operations. This algorithm is then refined by finding appropriate variable orderings and by making the algorithm propagate sets incrementally, in order to arrive at a very efficient algorithm. Experimental results are given to justify the choice of variable ordering, to demonstrate the improvement due to incrementalization, and to compare the performance of the BDD-based solver to an efficient hand-coded graph-based solver. Finally, based on the results of the BDD-based solver, a variety of BDD-based queries are presented, including the points-to query.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference35 articles.
1. Lars Ole Andersen. Program Analysis and Specialization for the C Programming Language May 1994. Ph.D thesis DIKU University of Copenhagen.]] Lars Ole Andersen. Program Analysis and Specialization for the C Programming Language May 1994. Ph.D thesis DIKU University of Copenhagen.]]
2. Ashes suite collection http://www.sable.mcgill.ca/software/.]] Ashes suite collection http://www.sable.mcgill.ca/software/.]]
3. Bebop
4. LNCS;Basin David,2002
5. Symbolic Boolean manipulation with ordered binary-decision diagrams
Cited by
47 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献