Evaluating context-sensitive slicing and chopping

Conference on Software Maintenance

Volumn , Issue , 2002, Pages 22-31

  Krinke, Jens ^a  

^a UNIVERSITY OF PASSAU   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER DEBUGGING; DATA FLOW ANALYSIS; PROGRAM DEBUGGING;

CONTEXT-SENSITIVE CHOPPING OPERATIONS; CONTEXT-SENSITIVE SLICING OPERATIONS;

REVERSE ENGINEERING;

EID: 0036441874     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. G. Agrawal and L. Guo. Evaluating explicitly context-sensitive program slicing. In Workshop on Program Analysis for Software Tools and Engineering, 2001.
2. D.C. Atkinson and W.G. Griswold. The design of whole program analysis tools. In Proc. Intl. Conference on Software Engineering, 1996.
3. D.C. Atkinson and W.G. Griswold. Implementation techniques for efficient data-flow analysis of large programs. In Proc. Intl. Conference on Software Maintenance, 2001.
4. L. Bent, D. Atkinson, and W. Griswold. A comparative study of two whole-program slicers for C. Technical Report CS2000-0643, Univer. of California at San Diego, 2000.
5. M. Burke, P. Carini, J.-D. Choi, and M. Hind. Flow-insensitive interprocedural alias analysis in the presence of pointers. In Lecture Notes in Computer Science, 892. 1995.
6. 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), 1987.
7. S.B. Horwitz, T.W. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. ACM Trans. Prog. Lang. Syst., 12(1), 1990.
8. D. Jackson and E. Rollins. A new model of program dependences for reverse engineering. In Proc. Symposium on the Foundations of Software Engineering, 1994.
9. J. Krinke. Static slicing of threaded programs. In Proc. ACM SIGPLAN/SIGFSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE'98), 1998.
10. J. Krinke and G. Snelting. Validation of measurement software as an application of slicing and constraint solving. Information and Software Technology, 40(11-12), 1998.
11. D. Liang and M.J. Harrold. Efficient points-to analysis for whole-program analysis. In ESEC / SIGSOFT FSE, 1999.
12. A. Orso, S. Sinha, and M. Harrold. Effects of pointers on data dependences. In Proc. 9th Intl. Workshop on Program Comprehension, 2001.
13. K.J. Ottenstein and L.M. Ottenstein. The program dependence graph in a software development environment. In Proc. Software Engineering Symposium on Practical Software Development Environments, 1984.
14. T. Reps and G. Rosay. Precise Interprocedural Chopping. In Proc. Third ACM SIGSOFT Symposium on the Foundations of Software Engineering, 1995.
15. T.W. Reps, S.B. Horwitz, M. Sagiv, and G. Rosay. Speeding up slicing. In Proc. Second Symposium on the Foundations of Software Engineering, 1994.
16. T. Robschink and G. Snelting. Efficient path conditions in dependence graphs. In Proc. Intl. Conference on Software Engineering, 2002.
17. B.G. Ryder, W. Landi, B. Philip, A. Stocks, S. Zhang, and R. Altucher. A schema for interprocedural modification side-effect analysis with pointer aliasing. ACM Trans. Prog. Lang. Syst., 2001.
18. M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In Program Flow Analysis: Theory. and Applications. Prentice-Hall, 1981.
19. M. Weiser. Program slicing. IEEE Trans. Softw. Eng., 10(4), 1984.