Context-sensitivity matters, but context does not

Proceedings - Fourth IEEE International Workshop on Source Code Analysis and Manipulation

Volumn , Issue , 2004, Pages 29-35

  Krinke, Jens ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT STACKS; CONTEXT-SENSITIVE PROGRAMS; DEBUGGING; PROCEDURAL DEPENDENCE GRAPH (PDG);

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; DATA REDUCTION; GRAPH THEORY; OPTIMIZATION;

CONTEXT SENSITIVE LANGUAGES;

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

References (21)

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. H. Agrawal and J. R. Horgan. Dynamic program slicing. In Proceedings of the ACM SIGPLAN '90 Conference on Programming Language Design and Implementation, pages 246-256, 1990.
3. P. Anderson and T. Teitelbaum. Software inspection using codesurfer. In Workshop on Inspection in Software Engineering (CAV 2001), 2001.
4. 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.
5. D. Binkley. Semantics guided regression test cost reduction. IEEE Trans. Softw. Eng., 23(8):498-516, Aug. 1997.
6. D. Binkley and M. Harman. A large-scale empirical study of forward and backward static slice size and context sensitivity. In International Conference on Software Maintenance, pages 44-53, 2003.
7. J. Ferrante, K. J. Ottenstein, and J. D. Warren. The program dependence graph and its use in optimization. ACM Trans. Prog. Lang. Syst., 9(3):319-349, July 1987.
8. M. Hind. Pointer analysis: Haven't we solved this problem yet? In 2001 ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE'01), 2001.
9. M. Hind and A. Pioli. Which pointer analysis should i use? In International Symposium on Software Testing and Analysis, pages 113-123, 2000.
10. S. B. Horwitz, T. W. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. ACM Trans. Prog. Lang. Syst., 12(1):26-60, Jan. 1990.
11. B. Korel and J. Laski. Dynamic program slicing. Information Processing Letters, 29(3):155-163, Oct. 1988.
12. J. Krinke. Evaluating context-sensitive slicing and chopping. In International Conference on Software Maintenance, pages 22-31, 2002.
13. J. Krinke. Advanced Slicing of Sequential and Concurrent Programs. PhD thesis, Universität Passau, Apr. 2003.
14. J. Krinke and G. Snelting. Validation of measurement software as an application of slicing and constraint solving. Information and Software Technology, 40(11-12):661-675, Dec. 1998.
15. J. Lyle and D. Wallace. Using the unravel program slicing tool to evaluate high integrity software. In Proceedings of Software Quality Week, 1997.
16. 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.
17. A. Nishimatsu, M. Jihira, S. Kusumoto, and K. Inoue. Call-mark slicing: An efficient and economical way of reducing slice. In International Conference of Software Engineering, pages 422-431, 1999.
18. T. Reps. Program analysis via graph reachability. Information and Software Technology, 40(11-12):701-726, 1998.
19. 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.
20. M. Weiser. Program slices: formal, psychological, and practical investigations of an automatic program abstraction method. PhD thesis, University of Michigan, Ann Arbor, 1979.
21. M. Weiser. Program slicing. IEEE Trans. Softw. Eng., 10(4):352-357, July 1984.