Slicing as a program transformation

ACM Transactions on Programming Languages and Systems

Volumn 29, Issue 2, 2007, Pages

  Ward, Martin ^a   Zedan, Hussein ^a  

^a DE MONTFORT UNIVERSITY   (United Kingdom)

Author keywords

FermaT; Formal methods; Program transformation; Reengineering; Reverse engineering; Slicing

Indexed keywords

ENCODING (SYMBOLS); FORMAL METHODS; MATHEMATICAL TRANSFORMATIONS; REENGINEERING; REVERSE ENGINEERING; SEMANTICS;

FERMAT; OPERATIONAL SLICING; PROGRAM TRANSFORMATION; SLICING;

COMPUTER PROGRAMMING LANGUAGES;

EID: 34247264314     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1216374.1216375     Document Type: Article

References (47)

1. AGRAWAL, H. AND HORGAN, J. R. 1990. Dynamic program slicing. SIGPLAN Not. 25, (Jun.), 246-256.
2. BACK, R. J. R. 1980. Correctness preserving program refinements. Mathematical Centre Tracts No. 131, Mathematisch Centrum, Amsterdam.
3. BACK, R. J. R. 1988. A calculus of refinements for program derivations. Acta Inf. 26, 593-624.
4. BACK, R. J. R. AND VON WRIGHT, J. 1990. Refinement concepts formalised in higher-order logic. Formal Aspects Comput. 2, 247-272.
5. BALZER, R. 1969. EXDAMS - EXtendable debugging and monitoring system. In Proceedings of the AFIPS SJCC.
6. BESZEDAS, A., FARAGO, C., SZABO, Z. M., CSIRIK, J., AND GYIMOTHY, T. 2002. Union slices for program maintenance. In 18th International Conference on Software Maintenance (ICSM) (Montreal, Quebec, Oct. 3-6).
7. BILARDI, G. AND PINGALI, K. 1999. The static single assignment form and its computation. Tech. Rep., Cornell University, July. http://www.cs.cornell.edu/Info/Projects/Bernoulli/papers/ssa.ps.
8. BINKLEY, D., HARMAN, M., AND DANICIC, S. 2003. Amorphous program slicing. J. Syst. Softw. 68, (Oct.) 45-64.
9. BINKLEY, D. AND GALLAGHER, K. 1996. A survey of program slicing. In Advances in Computers, M. Zelkowitz, ed. Academic Press, San Diego, CA.
10. BOHM, C. AND JACOPINI, G. 1966. Flow diagrams, Turing machines and languages with only two formation rules. Commun. ACM 9, (May), 366-371.
11. CANFORA, G., CIMITILE, A., AND DE LUCIA, A. 1998. Conditioned program slicing. Inf. Softw. Technol. 40, 595-607.
12. CYTRON, R., FERRANTE, J., ROSEN, B. K., WEGMAN, M. N., AND ZADECK, F. K. 1991. Efficiently computing static single assignment form and the control dependance graph. ACM Trans. Program. Lang. Syst. 13, (Jul.), 451-490.
13. DANICIC, S. 1999. Dataflow minimal slicing. Ph.D. thesis, London University.
14. DE LUCIA., A., HARMAN, M., HIERONS, R., AND KRINKE, J. 2003. Unions of slices are not slices. In the 7th European Conference on Software Maintenance and Reengineering (Benevento, Italy, Mar.).
15. DIJKSTRA, E. W. 1976. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, NJ.
16. FORGACS, I. AND GYIMOTHY, T. 1997. An efficient interprocedural slicing method for large programs. In Proceedings of the SEKE, 9th International Conference on Software Engineering and Knowledge Engineering (Madrid, Spain).
17. HARMAN, M. AND DANICIC, S. 1997. Amorphous program slicing. In the 5th IEEE International Workshop on Program Comprehension (IWPC) (Dearborn, MI, May).
18. HARMAN, M., DANICIC, S., AND HIERONS, R. M. 2000. ConSIT: A conditioned program slicer. In the 5th IEEE International Conference on Software Maintenance (ICSM) (San Jose, CA, Oct.).
19. HARMON, M., HU, L., MUNRO, M., AND ZHANG, X. 2001. GUSTT: An amorphous slicing system which combines slicing and transformation. In Proceedings of the 8th Working Conference on Reverse Engineering (WCRE) (Los Alamitos, CA).
20. HORWITZ, S., REPS, T., AND BINKLEY, D. 1990. Interprocedural slicing using dependence graphs. ACM Trans. Program. Lang. Syst. 12, (Jan.), 26-60.
21. KARP, C. R. 1964. Languages with Expressions of Infinite Length. North-Holland, Amsterdam.
22. KOREL, B. AND LASKI, J. 1988. Dynamic program slicing. Inf. Process. Lett. 29, (Oct.), 155-163.
23. nd ed. Prentice-Hall, Englewood Cliffs, NJ.
24. MORGAN, C. C. AND ROBINSON, K. 1987. Specification statements and refinements. IBM J. Res. Develop, 31.
25. PINGALI, K. AND BILARDI, G. 1997. Optimal control dependence computation and the Roman Chariots problem. ACM Trans. Program. Lang. Syst., (May). http://www.cs.cornell.edu/Info/Projects/ Bernoulli/papers/toplas97.ps.
26. STOY, J. E. 1977. Denotational Semantics: The Scott-Strachy Approach to Programming Language Theory. MIT Press, Cambridge, MA.
27. TENNET, R. D. 1976. The denotational semantics of programming languages. Commun. ACM 19, (Aug.), 437-453.
28. TIP, F. 1995. A survey of program slicing techniques. J. Program. Lang. 3, (Sept.), 121-189.
29. VENKATESH, G. A. 1991. The semantic approach to program slicing. SIGPLAN Not. 26, 107-119. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation (Jun. 26-28).
30. WARD, M. 1989. Proving program refinements and transformations. Ph.D. thesis, Oxford University.
31. WARD, M. 1990. Derivation of a sorting algorithm. Tech. Rep., Durham University. http://www.cse.dmu.ac.uk/~m-ward/martin/papers/foundation2-t. ps.gz.
32. WARD, M. 1993. Abstracting a specification from code. J. Softw. Maintenance Res, Pract. 5, (Jun.), 101-122. http://www.cse.dmu.ac.uk/ ~m-ward/martin/papers/prog-spec.ps.gz.
33. WARD, M. 1994a. Foundations for a practical theory of program refinement and transformation. Tech. Rep., Durham University, http://www.cse.dmu.ac.uk/~m-ward/martin/papers/foundation2-t.ps.gz.
34. WARD, M. 1994b. Reverse engineering through formal transformation Knuth's Polynomial Addition algorithm. Comput. J. 37, 795-813. http://www.cse.dmu.ac.uk/~m-ward/martin/papers/polyt.ps.gz.
35. WARD, M. 1995. A definition of abstraction. J. Softw. Maintenance Res. Pract. 7, (Nov.), 443-450. http://www.cse.dmu.ac.uk/~m- ward/martin/papers/abstraction-t.ps.gz.
36. WARD, M. 1996. Derivation of data intensive algorithms by formal transformation. IEEE Trans. Softw. Eng. 22, (Sept.), 665-686. http://www.cse.dmu.ac.uk/~m-ward/martin/papers/sw-alg.ps.gz.
37. WARD, M. 1999. Assembler to C migration using the FermaT transformation system. In the International Conference on Software Maintenance (Oxford, UK, Aug. 30-Sept. 3).
38. WARD, M. 2000. Reverse engineering from assembler to formal specifications via program transformations. In Proceedings of the 7th Working Conference on Reverse Engineering (Brisbane, Queensland, Australia, Nov. 23-25). http://www.cse.dmu.ac.uk/~m-ward/martin/papers/wcre2000.ps.gz.
39. WARD, M. 2001. The formal transformation approach to source code analysis and manipulation. In the IEEE International Workshop on Source Code Analysis and Manipulation (Florence, Italy, Nov. 10).
40. WARD, M. 2004. Pigs from sausages? Reengineering from assembler to C via FermaT transformations. Sci. Comput. Program. 52, 213-255.
41. WARD, M. AND BENNETT, K. H. 1995. Formal methods to aid the evolution of software. Int. J. Softw. Eng. Knowl. Eng. 5, 25-47. http://www.cse.dmu.ac.uk/~m-ward/martin/papers/evolution-t.ps.gz.
42. WARD, M., ZEDAN, H., AND HARDCASTLE, T. 2005. Conditioned semantic slicing via abstraction and refinement in FermaT. In the 9th European Conference on Software Maintenance and Reengineering (CSMR) (Manchester, UK, Mar. 21-23).
43. WEISER, M. 1984a. Program slicing. IEEE Trans. Softw. Eng. 10, (Jul.), 352-357.
44. WEISER, M. 1984b. Programmers use slices when debugging. Commun. ACM25. (Jul.), 352-357.
45. YANG, H. AND WARD, M. 2003. Successful Evolution of Software Systems. Artech House. ISBN 1-58053-349-3.
46. YOUNGER, E. J. AND WARD, M. 1993. Inverse engineering is a simple real time program. J. Softw. Maintenance Res. Pract. 6, 197-234. http://www.cse.dmu.ac.uk/~m-ward/martin/papers/eddy-t.ps.gz.
47. ZHANG, X., MUNRO, M., HARMAN, M., AND HU, L. 2002. Mechanized operational semantics of WSL. In the IEEE International Workshop on Source Code Analysis and Manipulation (SCAM) (Los Alamitos, CA).