Equivalence of conservative, free, linear program schemas is decidable

Theoretical Computer Science

Volumn 290, Issue 1, 2003, Pages 831-862

  Laurence, Michael R ^a   Danicic, Sebastian ^a   Harman, Mark ^b   Hierons, Rob ^b   Howroyd, John ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b BRUNEL UNIVERSITY   (United Kingdom)

Author keywords

Conservative schemas; Decidability; Free schemas; Linear schemas; Program schemas

Indexed keywords

ALGORITHMS; COMPUTER PROGRAM LISTINGS; COMPUTER PROGRAMMING; LINEAR PROGRAMMING; SEMANTICS; THEOREM PROVING;

PROGRAM SCHEMAS;

COMPUTABILITY AND DECIDABILITY;

EID: 0037209762     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00374-2     Document Type: Article

References (50)

1. Agrawal H., DeMillo R.A., Spafford E.H. Debugging with dynamic slicing and backtracking. Software Practice Experience. 23(6):1993;589-616.
2. J. Beck, D. Eichmann, Program and interface slicing for reverse engineering, in: Proc. IEEE/ACM 15th Conf. on Software Engineering (ICSE'93), IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 509-518.
3. Bieman J.M., Ott L.M. Measuring functional cohesion. IEEE Trans. Software Eng. 20(8):1994;644-657.
4. Binkley D.W. The application of program slicing to regression testing. Harman M., Gallagher K. Information and Software Technology Special Issue on Program Slicing. Vol. 40:1998;583-594 Elsevier, Amsterdam.
5. Binkley D.W., Gallagher K.B. Program slicing. Zelkowitz M. Advances in Computers. Vol. 43:1996;1-50 Academic Press, New York.
6. Binkley D.W., Horwitz S., Reps T. Program integration for languages with procedure calls. ACM Trans. Software Eng. Methodol. 4(1):1995;3-35.
7. G. Canfora, A. Cimitile, A. De Lucia, G.A.D. Lucca, Software salvaging based on conditions, in: Proc. Internat. Conf. on Software Maintenance (ICSM'96), Victoria, Canada, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 424-433.
8. 2: reverse engineering and reuse re-engineering J. Software Maintenance: Res. Practice. 6(2):1994;53-72.
9. R. Cartwright, M. Felleisen, The semantics of program dependence, in: Proc. IEEE Computer Society Press, Los Alamitos, CA, ACM SIGPLAN Conf. on Programming Language Design and Implementation, 1989, pp. 13-27.
10. A. Cimitile, A. De Lucia, M. Munro, Identifying reusable functions using specification driven program slicing: a case study, in: Proc. IEEE Internat. Conf. on Software Maintenance (ICSM'95), Nice, France, IEEE Computer Society Press, Los Alamitos, CA, 1995, pp. 124-133.
11. Cimitile A., De Lucia A., Munro M. A specification driven slicing process for identifying reusable functions. Software Maintenance: Res. Practice. 8:1996;145-178.
12. S. Danicic, Dataflow minimal slicing, Ph.D. Thesis, University of North London, UK, School of Informatics, April 1999.
13. Danicic S., Harman M., Sivagurunathan Y. A parallel algorithm for static program slicing. Inform. Process. Lett. 56(6):1995;307-313.
14. A. De Lucia, Program slicing: methods and applications, in: Proc. 1st IEEE Internat. Workshop on Source Code Analysis and Manipulation, IEEE Computer Society Press, Los Alamitos, CA, Florence, Italy, 2001, pp. 142-149.
15. A. De Lucia, A.R. Fasolino, M. Munro, Understanding function behaviours through program slicing, in: Proc. 4th IEEE Workshop on Program Comprehension, Berlin, Germany, IEEE Computer Society Press, Los Alamitos, CA, 1996, pp. 9-18.
16. A.P. Ershov, Theory of program schemata, Inform. Process. (1971).
17. J. Field, G. Ramalingam, F. Tip, Parametric program slicing, in: Proc. 22nd ACM Symp. on Principles of Programming Languages, San Francisco, CA, 1995, pp. 379-392.
18. K.B. Gallagher, Evaluating the surgeon's assistant: results of a pilot study, in: Proc. Internat. Conf. on Software Maintenance, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 236-244.
19. Gallagher K.B., Lyle J.R. Using program slicing in software maintenance. IEEE Trans. Software Eng. 17(8):1991;751-761.
20. Greibach S. Theory of Program Structures: Schemes, Semantics, Verification. Lecture Notes in Computer Science. Vol. 36:1975;Springer, New York.
21. R. Gupta, M.J. Harrold, M.L. Soffa, An approach to regression testing using slicing, in: Proc. IEEE Conf. on Software Maintenance, Orlando, FL, IEEE Computer Society Press, Los Alamitos, CA, 1992, pp. 299-308.
22. Harman M., Danicic S. Using program slicing to simplify testing. Software Testing Verification Reliability. 5(3):1995;143-162.
23. M. Harman, S. Danicic, Amorphous program slicing, in: Proc. 5th IEEE Internat. Workshop on Program Comprehension (IWPC'97), Dearborn, MI, IEEE Computer Society Press, Los Alamitos, CA, 1997, pp. 70-79.
24. Harman M., Hierons R.M. An overview of program slicing. Software Focus. 2(3):2001;85-92.
25. M. Harman, R.M. Hierons, S. Danicic, J. Howroyd, C. Fox, Pre/post conditioned slicing, in: Proc. IEEE Internat. Conf. on Software Maintenance (ICSM'01), Florence, Italy, IEEE Computer Society Press, Los Alamitos, CA, 2001, pp. 138-147.
26. Harman M., Simpson D., Danicic S. Slicing programs in the presence of errors. Formal Aspects Comput. 8(4):1996;490-497.
27. Hecht M.S. Flow Analysis of Computer Programs. 1977;Elsevier, Amsterdam.
28. Hierons R.M., Harman M., Danicic S. Using program slicing to assist in the detection of equivalent mutants. Software Testing Verification Reliability. 9(4):1999;233-262.
29. R.M. Hierons, M. Harman, C. Fox, L. Ouarbya, M. Daoudi, Conditioned slicing supports partition testing, Software Testing Verification Reliability, in preparation.
30. Horwitz S., Prins J., Reps T. Integrating non-interfering versions of programs. ACM Trans. Programming Languages Systems. 11(3):1989;345-387.
31. S. Horwitz, T. Reps, D.W. Binkley, Interprocedural slicing using dependence graphs, in: Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, Atlanta, GA, 1988, pp. 25-46; Proc. in SIGPLAN Notices 23(7) (1988) 35-46.
32. S. Horwitz, T. Reps, D.W. Binkley, Interprocedural slicing using dependence graphs, in: Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, Atlanta, GA, 1988, pp. 25-46; Proc. in SIGPLAN Notices 23(7) (1988) 35-46.
33. Horwitz S., Reps T., Binkley D.W. Interprocedural slicing using dependence graphs. ACM Trans. Programming Languages Systems. 12(1):1990;26-61.
34. Y.I. Ianov, The logical schemes of algorithms, in: Problems of Cybernetics, Vol. 1, Pergamon Press, New York, 1960, pp. 82-140.
35. M. Kamkar, Interprocedural dynamic slicing with applications to debugging and testing, Ph.D. Thesis, Department of Computer Science and Information Science, Linköping University, Sweden, available as Linköping Studies in Science and Technology, Dissertations, Number 297, 1993.
36. A. Lakhotia, Rule-based approach to computing module cohesion, in: Proc. 15th Conf. on Software Engineering (ICSE-15), 1993, pp. 34-44.
37. Luckham D.C., Park D.M.R., Paterson M.S. On formalised computer programs. J. Comput. System Sci. 4:1970;220-249.
38. J.R. Lyle, M. Weiser, Automatic program bug location by program slicing, in: Proc. 2nd Internat. Conf. on Computers and Applications, Peking, IEEE Computer Society Press, Los Alamitos, CA, 1987, pp. 877-882.
39. Manna Z. Mathematical Theory of Computation. 1974;McGraw-Hill, New York.
40. L.M. Ott, J.J. Thuss, Slice based metrics for estimating cohesion, in: Proc. IEEE-CS Internat. Metrics Symp., Baltimore, MD, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 71-81.
41. M.S. Paterson, Equivalence problems in a model of computation, Ph.D. Thesis, University of Cambridge, UK, 1967.
42. Sabelfeld V.K. An algorithm for deciding functional equivalence in a new class of program schemes. J. Theoret. Computer Sci. 71:1990;265-279.
43. Simpson D., Valentine S.H., Mitchell R., Liu L., Ellis R. Recoup - maintaining fortran. ACM Fortran Forum. 12(3):1993;26-32.
44. G. Snelting, Combining slicing and constraint solving for validation of measurement software, in: Static Analysis Symposium (SAS'96), Lecture Notes in Computer Science, Vol. 1145, Springer, Berlin, 1996, pp. 332-348.
45. Tip F. A survey of program slicing techniques. J. Programming Languages. 3(3):1995;121-189.
46. M. Weiser, Program slices: formal, psychological, and practical investigations of an automatic program abstraction method, Ph.D. Thesis, University of Michigan, Ann Arbor, MI, 1979.
47. Weiser M. Program slicing. IEEE Trans. Software Eng. 10(4):1984;352-357.
48. M. Weiser, J.R. Lyle, Experiments on slicing-based debugging aids, in: Soloway, Iyengar (Eds.), Empirical Studies of Programmers, Molex, 1985, Chap. 12, pp. 187-197.
49. Weyuker E.J. Translatability and decidability questions for restricted classes of program schemas. SIAM J. Comput. 8(4):1979;587-598.
50. Weyuker E.J. Modifications of the program scheme model. J. Comput. System Sci. 18(3):1979;281-293.