Points-to analysis using BDDs

ACM SIGPLAN Notices

Volumn 38, Issue 5, 2003, Pages 103-114

  Berndl, Marc ^a   Lhoták, Ondřej ^a   Qian, Feng ^a   Hendren, Laurie ^a   Umanee, Navindra ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Binary decision diagrams; Points to analysis

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); DATA STRUCTURES; GRAPH THEORY; JAVA PROGRAMMING LANGUAGE; OPTIMIZATION; PROGRAM COMPILERS;

BINARY DECISION DIAGRAMS; POINTS-TO ANALYSIS;

PROGRAM DIAGNOSTICS;

EID: 1442264340     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/780822.781144     Document Type: Conference Paper

References (35)

1. 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/.
3. Thomas Ball and Sriram K. Rajamani. Bebop: A Path-sensitive Interprocedural Dataflow Engine. In Proceedings of PASTE'01, pages 97 - 103, Jun 2001.
4. David Basin, Stefan Friedrich, Marek Gawkowski, and Joachim Posegga. Bytecode Model Checking: An Experimental Analysis. In Dragan Bosnacki and Stefan Leue, editors, Model Checking Software, 9th International SPIN Workshop, volume 2318 of LNCS, pages 42-59. Springer-Verlag, Apr 2002.
5. Randal E. Bryant. Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams. ACM Computing Surveys, 24(3):293-318, 1992.
6. Manuvir Das. Unification-based pointer analysis with directional assignments. In Proceedings of PLDI'00, pages 35-46, Jun 2000.
7. Jeffrey Dean, David Grove, and Craig Chambers. Optimization of object-oriented programs using static class hierarchy analysis. In Walter G. Olthoff, editor, ECOOP'95 - Object-Oriented Programming, 9th European Conference, volume 952 of Lecture Notes in Computer Science, pages 77-101, Åarhus, Denmark, Aug 1995. Springer.
8. Matthew B. Dwyer, John Hatcliff, Roby Joehanes, Shawn Laubach, Corina S. Pasareanu, Robby, Hongjun Zheng, and W. Visser. Tool-Supported Program Abstraction for Finite-State Verification. In Proceedings of ICSE, pages 177-187, 2001.
9. Maryann Emami, Rakesh Ghiya, and Laurie J. Hendren. Context-sensitive interprocedural points-to analysis in the presence of function pointers. In Proceedings of PLDI'94, pages 242-256, 1994.
10. Manuel Fähndrich, Jeffrey S. Foster, Zhendong Su, and Alexander Aiken. Partial online cycle elimination in inclusion constraint graphs. In Proceedings of PLDI'98, pages 85-96, Montreal, Canada, Jun 1998.
11. Nevin Heintze. Analysis of large code bases: The compile-link-analyze model, 1999 http://cm.bell-labs.com/cm/cs/who/nch/cla.ps.
12. Nevin Heintze and Olivier Tardieu. Ultra-fast aliasing analysis using CLA: A million lines of C code in a second. In Proceedings of PLDI'01, pages 254-263, June 2001.
13. Pascal Van Hentenryck, Agostino Cortesi, and Baudouin Le Charlier. Evaluation of the domain Prop. Journal of Logic Programming, 23(3):237-278, 1995.
14. Michael Hind. Pointer Analysis: Haven't We Solved This Problem Yet? In Proceedings of PASTE'01, pages 54-61, Jun 2001.
15. jEdit: Open source programmer's text editor. http://www.jedit.org/.
16. J.R. Burch, E.M. Clarke, D.E. Long, K.L. MacMillan, and D.L. Dill. Symbolic Model Checking for Sequential Circuit Verification. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 13(4):401-424, 1994.
17. Ondrěej Lhoták. Spark: A flexible points-to analysis framework for Java. Master's thesis, McGill University, December 2002.
18. Ondrěej Lhoták and Laurie Hendren. Scaling Java points-to analysis using Spark. In G. Hedin, editor, Compiler Construction, 12th International Conference, Volume 2622 of LNCS, pages 153-169, Warsaw, Poland, April 2003. Springer.
19. Donglin Liang, Maikel Pennings, and Mary Jean Harrold. Extending and evaluating flow-insensitive and context-insensitive points-to analyses for Java. In Proceedings of PASTE'01, pages 73-79, 2001.
20. Jø Lind-Neilsen. Buddy, A Binary Decision Diagram Package, Department of Information Technology, Technical University of Denmark. http://www.itu.dk/research/buddy/.
21. R. Manevich, G. Ramalingam, J. Field, D. Goyal, and M. Sagiv. Compactly Representing First-Order Structures for Static Analysis. In Manuel V. Hermenegildo and German Puebla, editors. Proceedings of SAS'02, volume 2477 of LNCS, Madrid, Spain, September 2002. Springer.
22. Vincenzo Martena and Pierluigi San Pietro. Alias Analysis by Means of a Model Checker. In R. Wilhelm, editor, Compiler Construction, 10th International Conference, volume 2027 of LNCS, pages 3-19, Genova, Italy, April 2001, Springer
23. Cristoph Meinel and Thorsten Theobald. Algorithms and Data Structures in VLSI Design. Springer, 1998.
24. Atanas Rountev and Satish Chandra. Off-line Variable Substitution for Scaling Points-to Analysis. In Proceedings of PLDI'00, pages 47-56, Jun 2000.
25. Atanas Rountev, Ana Milanova, and Barbara Ryder. Points-to analysis for Java using annotated constraints. In Proceedings of OOPSLA'01, pages 43-55, 2001.
26. David A. Schmidt, Data Flow Analysis is Model Checking of Abstract Interpretations. In Proceedings of POPL'98, pages 38-48, Jan 1998.
27. David A. Schmidt and Bernhard Steffen. Program analysis as model checking of abstract interpretations. In Proceedings of SAS'98, pages 351-380, 1998.
28. Marc Shapiro and Susan Horwitz. Fast and accurate flow-insensitive points-to analysis. In Proceedings of POPL'97, pages 1-14, Paris, Frace, Jan 1997.
29. John W. Sias, Wen mei W. Hwu, and David I. August. Accurate and Efficient Predicate Analysis with Binary Decision Diagrams. In Proceedings of the 33rd annual IEEE/ACM International Symposium on Microarchitecture, pages 112-123, Dec 2000.
30. SPEC jbb200 benchmark http://www/spec.org/osg/jbb2000/.
31. SPEC jvm98 benchmarks http://www.spec.org/osg/jvm98/.
32. Bjarne Steensgaard. Points-to analysis in almost linear time. In Proceedings of POPL'96, pages 32-41, Jan 1996.
33. Vijay Sundaresan, Laurie Hendren, Chrislain Razafimahefa, Raja Vallée-Rai, Patrick Lam, Etienne Gagnon, and Charles Godin. Practical virtual method call resolution for Java. In Proceedings of the 2000 OOPSLA, pages 264-280, 2000.
34. John Whaley and Monica Lam. An efficient inclusion-based points-to analysis for strictly-typed languages. In Proceedings of SAS'02, volume 2477 of LNCS, 2002.
35. Aiguo Xie and Peter A. Beerel. Implicit enumeration of strongly connected components. In International Conference on Computer-Aided Design, pages 37-40, Nov 1999.