A generic worklist algorithm for graph reachability problems in program analysis

Proceedings of the European Conference on Software Maintenance and Reengineering, CSMR

Volumn , Issue , 2002, Pages 67-76

  Rayside, D ^a   Kontogiannis, K ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ESCAPE ANALYSIS; GENERIC ALGORITHM; PROGRAM ANALYSIS; RAPID TYPE ANALYSIS; REACHABILITY; REACHABILITY PROBLEM;

COMPUTER PROGRAMMING; COMPUTER SOFTWARE MAINTENANCE; REENGINEERING;

ALGORITHMS;

EID: 0010603124     PISSN: 15345351     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSMR.2002.995791     Document Type: Conference Paper

References (32)

1. David F. Bacon. Fast and Effective Optimization of Statically Typed Object-Oriented Languages. P h D thesis, University of California at Berkeley, December 1997. Supervised by Susan Graham. UCB/CSD-98-1017.
2. David F. Bacon and Peter F. Sweeney. Fast static analysis of C++ virtual function calls. In Coplien [6], pages 324-341.
3. Michael Blaha, Alex Quilici, and Chris Verhoef, editors. Proceedings of the 5th IEEEWorking Conference on Reverse Engineering (WCRE), Honolulu, October 1998.
4. Shawn A. Bohner and Robert S. Arnold. Software Change Impact Analysis. IEEE Computer Society Press, 1996.
5. Jong-Deok Choi, Manish Gupta, Mauricio Serrano, Vugranam C. Sreedhar, and Sam Midkiff. Escape analysis for Java. In Northrop [18], pages 1-19.
6. James Coplien, editor. Proceedings of ACM/SIGPLAN Conference on Object-Oriented Systems, Languages and Applications (OOPSLA), San Jose, California, October 1996.
7. Jeffrey Dean, David Grove, and Craig Chambers. Optimization of object-oriented programs using static class hierarchy analysis. In W. Olthoff, editor, ECOOP'95, ?Arhus, Denmark, August 1995. Springer-Verlag. LNCS 952.
8. Amer Diwan, J. Eliot B. Moss, and Kathryn S. McKinley. Simple and effective analysis of statically-typed object-oriented programs. In Coplien [6], pages 292-305.
9. Etienne Gagnon, Laurie J. Hendren, and Guillaume Marceau. Efficient inference of static types for Java bytecode. In SAS'00, pages 199-219, Santa Barbara, California, June 2000.
10. Richard C. Holt. Structural manipulations of software architecture using Tarski relational algebra. In Blaha et al. [3], pages 210-219.
11. Susan Horwitz, Thomas Reps, and David Binkley. Interprocedural slicing using dependence graphs. In PLDI'88, pages 35-46, Atlanta, Georgia, USA, June 1988. Conference version of [12].
12. Susan Horwitz, Thomas Reps, and David Binkley. Interprocedural slicing using dependence graphs. ACM Transactions on Programming Languages and Systems (TOPLAS), 12(1), January 1990. Journal version of [11].
13. Daniel Jackson and Eugene J. Rollins. A new model of program dependences for reverse engineering. In FSE'94, pages 2-10, New Orleans, Louisiana, December 1994.
14. Gary A. Kildall. A unified approach to global program optimization. In POPL'73, pages 194-206, Boston, MA, October 1973.
15. Loren Larsen and Mary Jean-Harrold. Slicing objectoriented software. In ICSE'96, pages 495-505, March 1996.
16. Doug Lea, editor. Proceedings of ACM/SIGPLAN Conference on Object-Oriented Systems, Languages and Applications (OOPSLA), Minneapolis, Minnesota, October 2000.
17. Steven S. Muchnick. Advanced Compiler Design and Implementation. Morgan Kaufmann, 1997.
18. Linda Northrop, editor. Proceedings of ACM/SIGPLAN Conference on Object-Oriented Systems, Languages and Applications (OOPSLA), Denver, Colorado, November 1999.
19. Sara Porat, Bilha Mendelson, and Irina Shapira. Sharpening global static analysis to cope with Java. In Stephen A. MacKay and J. Howard Johnson, editors, CASCON'98, pages 303-316, Toronto, December 1998.
20. Ghassan Z. Qadah, Lawrence J. Henschen, and Jung J. Kim. Efficient algorithms for the instantiated transitive closure queries. IEEE Transactions on Software Engineering, 17(3):296-309, March 1991. Reprinted in [4].
21. Derek Rayside. A generic worklist algorithm for graph reachability problems in program analysis. Master's thesis, University of Waterloo, 2001. Supervised by Kostas Kontogiannis.
22. Derek Rayside, Scott Kerr, and Kostas Kontogiannis. Change and adaptive maintenance detection in Java software systems. In Blaha et al. [3], pages 10-19.
23. Derek Rayside and Kostas Kontogiannis. Extracting Java library subsets for deployment on embedded systems. Science of Computer Programming. To appear. An extended version of [24].
24. Derek Rayside and Kostas Kontogiannis. Extracting Java library subsets for deployment on embedded systems. In Paolo Nesi and Chris Verhoef, editors, CSMR'99, pages 102-110, Amsterdam, March 1999. Best Paper Award.
25. Derek Rayside and Kostas Kontogiannis. On the Syllogistic Structure of Object-Oriented Programming. In Hausi Müller, Mary-Jean Harrold, and Willhelm Shäfer, editors, ICSE'01, pages 113-122, Toronto, Canada, May 2001.
26. Derek Rayside, Steve Reuss, Erik Hedges, and Kostas Kontogiannis. The effect of call graph construction algorithms for object-oriented programs on automatic clustering. In Margaret-Anne Storey, Anneliese von Mayrhauser, and Harald Gall, editors, IWPC'00, pages 191-200, Limerick, Ireland, June 2000.
27. Thomas Reps. Program analysis via graph reachability. Information and Software Technology, 40(11):701-726,November 1998.
28. Vijay Sundaresan, Laurie Hendren, Chrislain Razafimahefa, Raja Vallée-Rai, Patrick Lam, and Etienne Gagnon. Practical virtual method call resolution for Java. In Lea [16], pages 264-280.
29. Frank Tip, Chris Laffra, Peter F. Sweeney, and David Streeter. Practical experience with an application extractor for Java. In Northrop [18], pages 292-305.
30. Frank Tip and Jens Palsberg. Scalable propagationbased call graph construction algorithms. In Lea [16], pages 281-293.
31. L. G. Valiant. General context-free recognition in less than cubic time. J. Comp. Syst. Sci., 2(10):308-315, April 1975.
32. D. H. Younger. Recognition and parsing of contextfree languages in time n3. Inf. and Cont., 10:189-208, 1967.