An empirical study of amorphous slicing as a program comprehension support tool

Proceedings - IEEE Workshop on Program Comprehension

Volumn 2000-January, Issue , 2000, Pages 161-170

  Binkley, David ^a   Harman, Mark ^b   Raszewski Ross, L ^a   Smith, Christopher ^a  

^a LOYOLA UNIVERSITY MARYLAND   (United States)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Amorphous materials; Councils; Debugging; Educational institutions; Humans; Logic; Power engineering and energy; Programming profession; Safety; Testing

Indexed keywords

ACCIDENT PREVENTION; CODES (SYMBOLS); COMPUTER DEBUGGING; COMPUTER PROGRAMMING; ENGINEERS; MATERIALS TESTING; PROFESSIONAL ASPECTS; SAFETY ENGINEERING; SAFETY TESTING; TESTING;

COUNCILS; EDUCATIONAL INSTITUTIONS; HUMANS; LOGIC; POWER ENGINEERING AND ENERGIES; PROGRAMMING PROFESSION;

AMORPHOUS MATERIALS;

EID: 84950998600     PISSN: 10928138     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WPC.2000.852490     Document Type: Conference Paper

References (14)

1. Binkley, D., "Precise executable interprocedural slices, " ACM Letters on Pro gramming Languages and Systems 2(1-4) pp. 31-45 (1993).
2. Binkley, D. and Gallagher, K., "Program slicing, " Annals of Computing, (1996).
3. Binkley, D., "Computing amorphous program slices using dependence graphs, " Proceedings of the 1999 ACM Symposium on Applied Computing, (San Antonio, Texas, February 1999)., pp. 519-525 (February 1999).
4. Choi, J. and Ferrante, J., "Static slicing in the presence of goto statements, " ACM Transacton on Programming Languages and Systems 16(4) pp. 1097-1113 (July 1991).
5. Ferrante, J., Ottenstein, K., and Warren, J., "The program dependence graph and its use in optimization, " ACM Transactions on Programming Languages and Systems 9(3) pp. 319-349 (July 1987).
6. Grammatech Inc., http://www. grammatech. com/products/codesurfer/codesurfer. html. 1999.
7. Harman, M. and Danicic, S., "Using program slicing to simplify testing, " Journal of Software Testing, Verification, and Reliability 5 pp. 143-162 John Wiley & Sons Ltd, (1995).
8. Harman, M., Sivagurunathan, Y., and Danicic, S., "Analysis of dynamic memory access using amorphous slicing, " IEEE International Conference on Software Maintenance, (Washington, DC, Nov 16-18, 1998), pp. 336-345 IEEE Computer Society, (1998).
9. Harman, M., Binkley, D., and Danicic, S., "Amorphous program slicing, " Loyola College Technical Report CS-TR-00-23, submited for publication, (1999).
10. Harman, M., Fox, C., Hierons, R., Binkley, D., and Danicic, S., "Program simplification as a means of approximating undecidable propositions, " pp. 208-217 in 7th IEEE International Workshop on Program Comprehension, (Pittsburg, PA, May, 1999), IEEE Computer Society, Washington, DC (1999).
11. Horwitz, S., Prins, J., and Reps, T., "Integrating non-interfering versions of programs, " ACM Trans. Program. Lang. Syst. 11(3) pp. 345-387 (July 1989).
12. Horwitz, S., Reps, T., and Binkley, D., "Interprocedural slicing using dependence graphs, " ACM Tr ansactions on Programming Languages and Systems 12(1) pp. 26-60 (January 1990).
13. Tip, F., "A survey of program slicing techniques, " Journal of Programming Languages 3(3) pp. 121-189 (September 1995).
14. Weiser, M., "Program slicing, " IEEE Transactions on Software Engineering SE-10(4) pp. 352-357 (July 1984).