Characterising, explaining, and exploiting the approximate nature of static analysis through animation

Proceedings - Sixth IEEE International Workshop on Source Code Analysis and Manipulation, SCAM 2006

Volumn , Issue , 2006, Pages 43-52

  Binkley, David ^a   Harman, Mark ^b   Krinke, Jens ^c  

^a LOYOLA UNIVERSITY MARYLAND   (United States)

^b KING'S COLLEGE LONDON   (United Kingdom)

^c UNIVERSITY OF HAGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANIMATION; APPROXIMATION THEORY; STATIC ANALYSIS;

SOURCE CODE; STATIC DEPENDENCE ANALYSIS;

COMPUTER PROGRAMMING LANGUAGES;

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

References (44)

1. G. Agrawal and L. Guo. Evaluating explicitly context-sensitive program slicing. In Workshop on Program Analysis for Software Tools and Engineering, pages 6-12, 2001.
2. A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, techniques and tools. Addison Wesley, 1986.
3. P. Anderson and T. Teitelbaum. Software inspection using codesurfer. In Workshop on Inspection in Software Engineering (CAV 2001), 2001.
4. G. Antoniol, R. Fiutem, G. Lutteri, P. Tonella, S. Zanfei, and E. Merlo. Program understanding and maintenance with the CANTO environment. In International Conference on Software Maintenance, pages 72-81, 1997.
5. D. C. Atkinson and W. G. Griswold. The design of whole-program analysis tools. In Proceedings of the 18th International Conference on Software Engineering, pages 16-27, 1996.
6. T. Ball and S. G. Eick. Visualizing program slices. In IEEE Symposium on Visual Languages, pages 288-295, 1994.
7. T. Ball and S. G. Eick. Software visualization in the large. IEEE Computer, 29(4):33-43, 1996.
8. F. Balmas. Displaying dependence graphs: a hierarchical approach. In Proc. Eigth Working Conference on Reverse Engineering, pages 261-270, 2001.
9. st IEEE International Conference on Software Maintenance, pages 177-186. IEEE Computer Society Press, 2005.
10. D. W. Binkley. Interprocedural constant propagation using dependence graphs and a data-flow model. In P. Fritzson, editor, Proceedings of the International Conference on Compiler Construction, (Edinburgh, Scotland), pages 374-388. Lecture Notes in Computer Science, Volume 786, Springer Verlag, April 1994.
11. D. W. Binkley and M. Harman. A large-scale empirical study of forward and backward static slice size and context sensitivity. In IEEE International Conference on Software Maintenance, pages 44-53. IEEE Computer Society Press, Sept. 2003.
12. D. W. Binkley and M. Harman. Analysis and visualization of predicate dependence on formal parameters and global variables. IEEE Transactions on Software Engineering, 30(11):715-735, 2004.
13. D. W. Binkley and M. Harman. A survey of empirical results on program slicing. Advances in Computers, 62:105-178, 2004.
14. M. Brown. Algorithm Animation. MIT Press, 1988.
15. C. S. Collberg, S. G. Kobourov, J. Nagra, J. Pitts, and K. Wampler. A system for graph-based visualization of the evolution of software. In Proceedings of the 2003 ACM symposium on Software visualization, pages 77-86, 212-213, 2003.
16. S. Diehl, editor. Software Visualizations, volume 2269 of LNCS. Springer, 2002.
17. M. D. Ernst. Practical fine-grained static slicing of optimized code. Technical Report MSR-TR-94-14, Microsoft Research, Redmond, WA, July 1994.
18. M. D. Ernst, J. Cockrell, W. G. Griswold, and D. Notkin. Dynamically discovering likely program invariants to support program evolution. IEEE Transactions on Software Engineering, 27(2): 1-25, Feb. 2001.
19. J. Ferrante, K. J. Ottenstein, and J. D. Warren. The program dependence graph and its use in optimization. ACM Transactions on Programming Languages and Systems, 9(3):319349, July 1987.
20. K. Gallagher and L. O'Brien. Reducing visualization complexity using decomposition slices. In Software Visualization Workshop, pages 113-118, 1997.
21. M. S. Hecht. Flow Analysis of Computer Programs. Elsevier, 1977.
22. M. Hind. Pointer analysis - haven't we solved this problem yet? In Program Analysis for Software Tools and Engineering (PASTE'01). ACM, June 2001.
23. S. Horwitz, T. Reps, and D. W. Binkley. Interprocedural slicing using dependence graphs. ACM Transactions on Programming Languages and Systems, 12(1):26-61, 1990.
24. D. Jackson and E. J. Rollins. Chopping: A generalisation of slicing. Technical Report CMU-CS-94-169, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, July 1994.
25. th IEEE International Workshop on Program Comprenhesion (IWPC'99), pages 4-11. IEEE Computer Society Press, May 1999.
26. C. Knight and M. Munro. Virtual but visible software. In Information Visualisation, pages 198-205. IEEE Computer Society Press, July 2000.
27. th International Symposium on Software Reliability Engineering (ISSRE 05), Nov. 2005. To appear.
28. J. Krinke. Evaluating context-sensitive slicing and chopping. In IEEE International Conference on Software Maintenance, pages 22-31. IEEE Computer Society Press, Oct. 2002.
29. J. Krinke. Advanced Slicing of Sequential and Concurrent Programs. PhD thesis, Universität Passau, Apr. 2003.
30. J. Krinke. Visualization of program dependence and slices. In Proc. International Conference on Software Maintenance, pages 168-177, 2004.
31. J. Krinke. Effects of context on program slicing. Journal of Systems and Software, 2006. to appear.
32. W. Landi and B. G. Ryder. Pointer-induced aliasing: A problem classification. In In Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, pages 93-103. ACM Press, Jan. 1991.
33. M. Mock, D. C. Atkinson, C. Chambers, and S. J. Eggers. Improving program slicing with dynamic points-to data. In Proceedings of the 10th International Symposium on the Foundations of Software Engineering, 2002.
34. M. Pacione, M. Roper, and M. Wood. A comparative evaluation of dynamic visualization tools. In Proceedings of WCRE '03, pages 80-89. IEEE Computer Society, Nov. 2003.
35. T. Reps. Program analysis via graph reachability. Information and Software Technology, 40(11-12):701-726, 1998.
36. T. Reps, S. Horwitz, M. Sagiv, and G. Rosay. Speeding up slicing. In Proceedings of the ACM SIGSOFT '94 Symposium on the Foundations of Software Engineering, pages 11-20, 1994.
37. D. J. Richardson, T. O. O'Malley, C. T. Moore, and S. L. Aha. Developing and integrating prodag into the arcadia environment. In Proceedings of the Fifth Symposium on Software Development Environments, pages 109-119, 1992.
38. B. G. Ryder, W. Landi, B. Philip, A. Stocks, S. Zhang, and R. Altucher. A schema for interprocedural modification sideeffect analysis with pointer aliasing. ACM Trans. Prog. Lang. Syst., 23(2):105-186, Mar. 2001.
39. J. T. Stasko, M. H. Brown, and B. A. Price, editors. Software Visualization. MIT Press, Cambridge, MA, USA, 1997.
40. C. Steindl. Benefits of a data flow-aware programming environment. In Workshop on Program Analysis for Software Tools and Engineering (PASTE'99), 1999.
41. P. Tonella, G. Antoniol, R. Fiutem, and E. Merlo. Flow insensitive C++ pointers and polymorphism analysis and its application to slicing. In Proceedings of the 19th International Conference on Software Engineering (ICSE '97), pages 433-444. IEEE Computer Society Press, May 1997.
42. M. Weiser. Program slicing. IEEE Transactions on Software Engineering, 10(4):352-357, 1984.
43. J. Yur, B. G. Ryder, and W. A. Landi. An incremental flow-and context-sensitive pointer aliasing analysis. In Proceedings of the 21st International Conference on Software Engineering, pages 442-452. IEEE Computer Society Press, May 1999.
44. A. Zeller. Animating data structures in ddd. In First International Program Visualization Workshop, pages 69-79. University of Joensuu Press, 2001.