Online cycle detection and difference propagation for pointer analysis

Proceedings - 3rd IEEE International Workshop on Source Code Analysis and Manipulation, SCAM 2003

Volumn , Issue , 2003, Pages 3-12

  Pearce, D J ^a   Kelly, P H J ^a   Hankin, C ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Algorithm design and analysis; Change detection algorithms; Conferences; Educational institutions; Runtime

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); SIGNAL DETECTION;

ALGORITHM DESIGN AND ANALYSIS; CHANGE DETECTION ALGORITHMS; CONFERENCES; EDUCATIONAL INSTITUTIONS; RUNTIMES;

C (PROGRAMMING LANGUAGE);

EID: 84944327016     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SCAM.2003.1238026     Document Type: Conference Paper

References (23)

1. Boost C++ libraries, http://www.boost.org.
2. The SUIF 2 research compiler, Stanford University,http://suif.stanford.edu.
3. A. Aiken. Introduction to set constraint-based program analysis.Science of Computer Programming, 35(2-3):79-111, Nov. 1999.
4. A. Aiken and E. L. Wimmers. Solving systems of set constraints.In Proc. 7th Annual IEEE Symposium on Logic in Computer Science, pages 329-340, 1992.
5. B. Alpern, R. Hoover, B. K. Rosen, P. F. Sweeney, and F. K. Zadeck. Incremental evaluation of computational circuits.In Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms,pages 32-42, 1990.
6. L. O. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, University of Copenhagen, 1994.
7. F. Bourdoncle. Efficient chaotic iteration strategies with widenings. In Proc. Conference on Formal Methods in Programming and their Applications, pages 128-141, 1993.
8. L.-L. Chen and W. L. Harrison. An efficient approach to computing fixpoints for complex program analysis. In Proc. ACM Conference on Supercomputing, pages 98-106, 1994.
9. M. Das. Unification-based pointer analysis with directional assignments. In Proc. ACM Conference on Programming Language Design and Implementation, pages 35-46, 2000.
10. M. Fähndrich, J. S. Foster, Z. Su, and A. Aiken. Partial online cycle elimination in inclusion constraint graphs. In Proc. ACM Conference on Programming Language Design and Implementation, pages 85-96, 1998.
11. M. Fähndrich, J. Rehof, and M. Das. Scalable context-sensitive flow analysis using instantiation constraints. In Proc. ACM Conference on Programming Language Design and Implementation, pages 253-263, 2000.
12. C. Fecht and H. Seidl. An even faster solver for general systems of equations. In Proc. Static Analysis Symposium,pages 189-204, 1996.
13. C. Fecht and H. Seidl. Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems.In Proc. European Symposium on Programming, pages 90-104, 1998.
14. N. Heintze and O. Tardieu. Ultra-fast aliasing analysis using CLA: A million lines of C code in a second. In Proc. ACM Conference on Programming Language Design and Implementation,pages 254-263, 2001.
15. S. Horwitz, A. J. Demers, and T. Teitelbaum. An efficient general iterative algorithm for dataflow analysis. Acta Informatica,24(6):679-694, 1987.
16. L. G. Jones. Efficient evaluation of circular attribute grammars.ACM Transactions on Programming Languages and Systems, 12(3):429-462, 1990.
17. A. Kanamori and D. Weise. Worklist management strategies.Technical Report MSR-TR-94-12, Microsoft Research, 1994.
18. A. Marchetti-Spaccamela, U. Nanni, and H. Rohnert. Maintaining a topological order under edge insertions. Information Processing Letters, 59(1):53-58, 1996.
19. F. Nielson, H. R. Nielson, and C. L. Hankin. Principles of Program Analysis. Springer-Verlag, 1999.
20. D. J. Pearce and P. H. J. Kelly. Online algorithms for maintaining the topological order of a directed acyclic graph(work in progess, available upon request). Technical report, Imperial College, 2003.
21. A. Rouhtev and S. Chandra. Off-line variable substitution for scaling points-to analysis. In Proc. ACM Conference on Programming Language Design and Implementation, pages 47-56, 2000.
22. B. Steensgaard. Points-to analysis by type inference of programs with structures and unions. In Proc. 6th International Conference on Compiler Construction, pages 136-150, 1996.
23. B. Steensgaard. Points-to analysis in almost linear time. In Proc. ACM Symposium on Principles of Programming Languages,pages 32-41, 1996.