Program simplification as a means of approximating undecidable propositions

Proceedings - 7th International Workshop on Program Comprehension, IWPC 1999

Volumn , Issue , 1999, Pages 208-217

  Harman, Mark ^a   Fox, Chris ^a   Hierons, Robert ^a   Binkley, David ^b   Danicic, Sebastian ^c  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b LOYOLA UNIVERSITY MARYLAND   (United States)

^c LONDON METROPOLITAN UNIVERSITY   (United Kingdom)

Author keywords

Slicing; Testing; Transformation

Indexed keywords

AUTOMATION; COMPUTER PROGRAMMING; STATIC ANALYSIS; TESTING;

AUTOMATED SYSTEMS; MANIPULATION TECHNOLOGIES; PROGRAM COMPREHENSION; PROGRAM SIMPLIFICATION; SLICING; TEST PROGRAM; TRANSFORMATION;

SOFTWARE TESTING;

EID: 77956782567     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WPC.1999.777760     Document Type: Conference Paper

References (22)

1. Bennett, K., Bull, T., Younger, E., and Luo, Z. Bylands: reverse engineering safety-critical systems. In IEEE International Conference on Software Maintenance (1995), IEEE Computer Society Press, Los Alamitos, California, USA, pp. 358-366.
2. Bennett, K., and Ward, M. Formal methods to aid the evolution of software. Journal of Software Engineering and Knowledge Engineering 5, 1 (1995), 25-47.
3. Bernot, G., Gaudel, M. C., and Marre, B. A formal approach to software testing. In Proceedings of the Second International Conference on Algebraic Methodology and Software Technology (Iowa City, Iowa, May 1991), The University of Iowa, Department of Computer Science, pp. 163-170.
4. Bieman, J. M., and Ott, L. M. Measuring functional cohesion. IEEE Transactions on Software Engineering 20, 8 (Aug. 1994), 644-657.
5. Binkley, D. W. The application of program slicing to regression testing. In Journal of Information and Software Technology Special Issue on Program Slicing, M. Harman and K. Gallagher, Eds., vol. 40. Elsevier Science B. V., 1998. to appear.
6. Binkley, D. W. Computing amorphous program slices using dependence graphs. In ACM Symposium on Applied Computing (The Menger, San Antonio, Texas, U.S.A., 1999), ACM Press, New York, NY, USA. to appear.
7. Canfora, G., Cimitile, A., and De Lucia, A. Conditioned program slicing. In Journal of Information and Software Technology Special Issue on Program Slicing, M. Harman and K. Gallagher, Eds., vol. 40. Elsevier Science B. V., 1998. to appear.
8. Canfora, G., Cimitile, A., De Lucia, A., and Lucca, G. A. D. Software salvaging based on conditions. In International Conference on Software Maintenance (ICSM'96) (Victoria, Canada, Sept. 1994), IEEE Computer Society Press, Los Alamitos, California, USA, pp. 424-433.
9. Chu, W. C., Luker, P., and Yang, H. Code understanding through program transformation for reusable component identification. In 5th IEEE Internation Workshop on Program Comprehesion (IWPC'97) (Dearborn, Michigan, USA, May 1997), IEEE Computer Society Press, Los Alamitos, California, USA.
10. Cimitile, A., De Lucia, A., and Munro, M. A specification driven slicing process for identifying reusable functions. Software maintenance: Research and Practice 8 (1996), 145-178.
11. Danicic, S., Harman, M., and Sivagurunathan, Y. A parallel algorithm for static program slicing. Information Processing Letters 56, 6 (Dec. 1995), 307-313.
12. De Lucia, A., Fasolino, A. R., and Munro, M. Understanding function behaviours through program slicing. In 4th IEEE Workshop on Program Comprehension (Berlin, Germany, Mar. 1996), IEEE Computer Society Press, Los Alamitos, California, USA, pp. 9-18.
13. Ferrante, J., Ottenstein, K. J., and Warren, J. D. The program dependence graph and its use in optimization. ACM Transactions on Programming Languages and Systems 9, 3 (July 1987), 319-349.
14. Harman, M., and Danicic, S. Using program slicing to simplify testing. Journal of Software Testing, Verification and Reliability 5, 3 (Sept. 1995), 143-162.
15. Harman, M., and Danicic, S. Amorphous program slicing. In 5th IEEE Internation Workshop on Program Comprehesion (IWPC'97) (Dearborn, Michigan, USA, May 1997), IEEE Computer Society Press, Los Alamitos, California, USA, pp. 70-79.
16. Harman, M., Sivagurunathan, Y., and Danicic, S. Analysis of dynamic memory access using amorphous slicing. In IEEE International Conference on Software Maintenance (ICSM'98) (Bethesda, Maryland, USA, Nov. 1998), IEEE Computer Society Press, Los Alamitos, California, USA, pp. 336-345.
17. Horwitz, S., Reps, T., and Binkley, D. Interprocedural slicing using dependence graphs. ACM Transactions on Programming Languages and Systems 12, 1 (1990), 26-61.
18. Jackson, D., and Rollins, E. J. Chopping: A generalisation of slicing. Tech. Rep. CMU-CS-94-169, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, July 1994.
19. Lakhotia, A. Rulebased approach to computing module cohesion. In Proceedings of the 15th Conference on Software Engineering (ICSE-15) (1993), pp. 34-44.
20. Lyle, J. R., and Weiser, M. Automatic program bug location by program slicing. In 2nd International Conference on Computers and Applications (Peking, 1987), IEEE Computer Society Press, Los Alamitos, California, USA, pp. 877-882.
21. Ott, L. M., and Thuss, J. J. The relationship between slices and module cohesion. In Proceedings of the 11th ACM conference on Software Engineering (May 1989), pp. 198-204.
22. Weiser, M. Program slicing. IEEE Transactions on Software Engineering 10, 4 (1984), 352-357.