Advanced slicing of sequential and concurrent programs

IEEE International Conference on Software Maintenance, ICSM

Volumn , Issue , 2004, Pages 464-468

  Krinke, Jens ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANSI C PROGRAMS; CHOPPING ALGORITHMS; CONCURRENT PROGRAMS; SLICING;

ALGORITHMS; C (PROGRAMMING LANGUAGE); FORMAL LANGUAGES; GRAPH THEORY; PROBLEM SOLVING; SOFTWARE ENGINEERING;

COMPUTER SOFTWARE;

EID: 18044364797     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICSM.2004.1357836     Document Type: Conference Paper

References (24)

1. D. Binkley and K. B. Gallagher. Program slicing. Advances in Computers, 43:1-50, 1996.
2. A. De Lucia. Program slicing: Methods and applications. In IEEE workshop on Source Code Analysis and Manipulation (SCAM 2001), 2001. Invited paper.
3. 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.
4. W. G. Griswold. Making slicing practical: The final mile, 2001. Invited Talk, PASTE'01.
5. M. Harman and K. B. Gallagher. Program slicing. Information and Software Technology, 40(11-12):577-581, 1998.
6. M. Harman and R. Hierons. An overview of program slicing. Software Focus, 2(3):85-92, 2001.
7. 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.
8. J. Krinke. Static slicing of threaded programs. In Proc. ACM SIGPLAN/SIGFSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE'98), pages 35-42. ACM Press, 1998. ACM SIGPLAN Notices 33(7).
9. J. Krinke. Identifying similar code with program dependence graphs. In Proc. Eigth Working Conference on Reverse Engineering, pages 301-309, 2001.
10. J. Krinke. Evaluating context-sensitive slicing and chopping. In International Conference on Software Maintenance, pages 22-31, 2002.
11. J. Krinke. Advanced Slicing of Sequential and Concurrent Programs. PhD thesis, Universität Passau, 2003.
12. J. Krinke. Context-sensitive slicing of concurrent programs. In Proceedings ESEC/FSE, pages 178-187, 2003.
13. J. Krinke. Slicing, chopping, and path conditions with barriers. Software Quality Journal, 12(4), 2004.
14. J. Krinke. Visualization of program dependence and slices. In International Conference on Software Maintenance, 2004.
15. 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.
16. M. Müller-Olm and H. Seidl. On optimal slicing of parallel programs. In STOC 2001 (33th ACM Symposium on Theory of Computing), pages 647-656, 2001.
17. T. Robschink and G. Snelting. Efficient path conditions in dependence graphs. In Proceedings of the 24th International Conference of Software Engineering (ICSE), pages 478-488, 2002.
18. M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In Program Flow Analysis: Theory and Applications, pages 189-233. Prentice-Hall, 1981.
19. G. Snelting. Combining slicing and constraint solving for validation of measurement software. In Static Analysis Symposium, volume 1145 of LNCS, pages 332-348. Springer, 1996.
20. G. Snelting, T. Robschink, and J. Krinke. Efficient path conditions in dependence graphs for software safety analysis. Submitted for publication, 2003.
21. F. Tip. A survey of program slicing techniques. Journal of programming languages, 3(3), Sept. 1995.
22. M. Weiser. Program slices: formal, psychological, and practical investigations of an automatic program abstraction method. PhD thesis, University of Michigan, Ann Arbor, 1979.
23. M. Weiser. Programmers use slices when debugging. Commun. ACM, 25(7):446-452, 1982.
24. M. Weiser. Program slicing. IEEE Trans. Softw. Eng., 10(4):352-357, July 1984.