Barrier slicing and chopping

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

Volumn , Issue , 2003, Pages 81-87

  Krinke, J ^a  

^a UNIVERSITY OF PASSAU   (Germany)

Author keywords

Computer science; Conferences; Data analysis; Data flow computing; Data mining; Filtering; Iterative methods; Programming profession; Reachability analysis; User interfaces

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER SCIENCE; DATA FLOW ANALYSIS; DATA MINING; DATA REDUCTION; FILTRATION; ITERATIVE METHODS;

CONFERENCES; DATA FLOW COMPUTING; PROGRAM SLICING; PROGRAMMING PROFESSION; REACHABILITY ANALYSIS;

USER INTERFACES;

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

References (21)

1. P. Anderson and T. Teitelbaum. Software inspection using codesurfer. In Workshop on Inspection in Software Engineering (CAV 2001), 2001.
2. th Conference on Software Engineering (ICSE'93), pages 509-518, 1993.
3. A. De Lucia, M. Harman, R. Hierons, and J. Krinke. Unions of slices are not slices. In 7th European Conference on Software Maintenance and Reengineering, 2003.
4. 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.
5. K. Gallagher and L. O'Brien. Reducing visualization complexity using decomposition slices. In Software Visualization Workshop, pages 113-118, 1997.
6. K. B. Gallagher. Visual impact analysis. In Proceedings of the International Conference on Software Maintenance, pages 52-58, 1996.
7. K. B. Gallagher and J. R. Lyle. Using program slicing in software maintenance. IEEE Transactions on Software Engineering, 17(8):751-761, 1991.
8. W. G. Griswold. Making slicing practical: The final mile, 2001. Invited Talk, PASTE'01.
9. 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.
10. D. Jackson and E. J. Rollins. A new model of program dependences for reverse engineering. In Proceedings of the second ACM SIGSOFT Symposium on Foundations of Software Engineering, pages 2-10, 1994.
11. J. Krinke. Evaluating context-sensitive slicing and chopping. In International Conference on Software Maintenance, pages 22-31, 2002.
12. 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.
13. J. R. Lyle and M. Weiser. Automatic program bug location by program slicing. In 2 International Conference on Computers and Applications, pages 877-882, 1987.
14. A. Orso, S. Sinha, and M. J. Harrold. Incremental slicing based on data-dependences types. In International Conference on Software Maintenance, 2001.
15. 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.
16. T. Reps and G. Rosay. Precise interprocedural chopping. In Proceedings of the 3rd ACM Symposium on the Foundations of Software Engineering, pages 41-52, 1995.
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. C. Steindl. Intermodular slicing of object-oriented programs. In International Conference on Compiler Construction, volume 1383 of LNCS, pages 264-278. Springer, 1998.
19. C. Steindl. Benefits of a data flow-aware programming environment. In Workshop on Program Analysis for Software Tools and Engineering (PASTE'99), 1999.
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.