Pigs from sausages? Reengineering from assembler to C via FermaT transformations

Science of Computer Programming

Volumn 52, Issue 1-3, 2004, Pages 213-255

  Ward, M P ^a  

^a DE MONTFORT UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTER SOFTWARE; FORMAL LOGIC; INTEGER PROGRAMMING; LEGACY SYSTEMS; PROGRAM ASSEMBLERS; PROGRAM COMPILERS; THEOREM PROVING;

ASSEMBLER LANGUAGES; COBOL; FERMAT TRANSFORMATION; GENERIC REVERSE ENGINEERING TOOLS (GREET);

COMPUTER PROGRAMMING;

EID: 3042732727     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2004.03.007     Document Type: Article

References (49)

1. 5 Report on the Algorithmic Language Scheme, February, 1998. http://ftp-swiss.ai.mit.edu/~jaffer/r5rs_toc.html.
2. Arnold R.S. Software Reengineering. 1993;IEEE Computer Society.
3. Arsac J. Syntactic source to source transforms and program manipulation. Comm. ACM. 22:1979;43-54.
4. Back R.J.R., von Wright J. Refinement concepts formalised in higher-order logic. Form. Asp. Comput. 2:1990;247-272.
5. Bauer F.L., Moller B., Partsch H., Pepper P. Formal construction by transformation - computer aided intuition guided programming. IEEE Trans. Softw. Eng. 15:1989.
6. Baxter I.D., Mehlich M. Reverse engineering is reverse forward engineering. Fourth Working Conference on Reverse Engineering. October, 1997:1997;IEEE Computer Society, Amsterdam, The Netherlands.
7. Beck K. Extreme Programming Explained. 1999;Addison Wesley, Reading, MA.
8. Bennett K.H. Do program transformations help reverse engineering? International Conference on Software Maintenance. ICSM, Washington DC, USA, November:1998.
9. Burson S., Kotik G.B., Markosian L.Z. A program transformation approach to automating software re-engineering. 14th Annual International Computer Software and Applications Conference. COMPSAC:1990.
10. Dijkstra E.W. A Discipline of Programming. 1976;Prentice-Hall, Englewood Cliffs, NJ.
11. Eastwood A. It's a hard sell - and hard work too (software reengineering). Comput. Canada. 18:1992;35.
12. Gannod G.C., Cheng H.C. Using informal and formal techniques for reverse engineering of C programs. Proceedings of the Third Working Conference on Reverse Engineering. 8-10 November, 1996:1996;249-258 IEEE Computer Society, Monterey, California.
13. Hall A. Seven myths of formal methods. IEEE Software. 7:(5):1990;11-19.
14. Hoare C.A.R., Hayes I.J., Jifeng H.E., Morgan C.C., Roscoe A.W., Sanders J.W., Sørensen I.H., Spivey J.M., Sufrin B.A. Laws of programming. Comm. ACM. 30:1987;672-686.
15. C. Jones, Programming Languages Table, Release 8.2, Software Productivity Research, Inc., March, 1996.
16. Karp C.R. Languages with Expressions of Infinite Length. 1964;North-Holland, Amsterdam.
17. Klusener S., Lämmel R., Verhoef C. Architectural Modifications to Deployed Software, 2002. http://www.cs.vu.nl/~x/am.
18. Knuth D.E. Structured programming with the GOTO statement. Comput. Surv. 6:1974;261-301.
19. Lämmel R., Verhoef C. Cracking the 500-Language problem. IEEE Software. 18:(6):2001;78-88.
20. Lämmel R., Verhoef C. Semi-automatic grammar recovery. Softw. - Pract. Exp. 31:2001;1395-1438.
21. Lano K. The B Language and Method: A Guide to Practical Formal Development. 1996;Springer-Verlag. ISBN 3-540-76033-4.
22. Lano K.C., Haughton H.P. Formal development in B. Inform. Softw. Technol. 37:1995;303-316.
23. Morgan C.C. The specification statement. Trans. Program. Lang. Syst. 10:1988;403-419.
24. Morgan C.C. Programming from Specifications. Second edn. 1994;Prentice-Hall, Englewood Cliffs, NJ.
25. Morgan C.C., Robinson K. Specification statements and refinements. IBM J. Res. Dev. 31:1987.
26. Morgan C.C., Vickers T. On the Refinement Calculus. 1993;Springer-Verlag, New York, Heidelberg, Berlin.
27. C.C. Morgan, K. Robinson, P. Gardiner, On the Refinement Calculus, Technical Monograph PRG-70, Oxford University, October, 1988.
28. Neighbors J.M. The Draco approach to constructing software from reusable components. IEEE Trans. Softw. Eng. SE-10:1984.
29. Neighbors J.M. Draco: a method for engineering reusable software systems. Biggerstaff T.J., Perlis A.J. Software Reusability - Concepts and Models. 1989;295-319 ACM Press.
30. Paige R. Future directions in program transformations. ACM Comput. Surv. 28A:1996;170-174.
31. Partsch H., Steinbrügen R. Program transformation systems. Comput. Surv. 15:1983.
32. Post E.L. Formal reduction of the general combinatorial decision problem. Amer. J. Math. 1943.
33. Spivey J.M. The Z Notation: A Reference Manual. 2nd edition: 1992;Prentice-Hall International, Hemel Hempstead.
34. Stepney S., Cooper D., Woodcock J. More powerful Z data refinement: pushing the state of the art in industrial refinement. Bowen J.P., Fett A., Hinchey M.G. The Z Formal Specification Notation, 11th International Conference of Z Users. Berlin, September, 1998 Lecture Notes in Computer Science. vol. 1493:1998;284-307 Springer-Verlag, New York, Heidelberg, Berlin.
35. Taylor D. An alternative to current looping syntax. SIGPLAN Not. 19:1984;48-53.
36. M. Ward, Proving program refinements and transformations. DPhil Thesis, Oxford University, 1989.
37. Ward M. Derivation of a sorting algorithm. Technical Report, Durham University, 1990. http://www.dur.ac.uk/~dcs0mpw/martin/papers/sorting-t.ps.gz.
38. Ward M. A definition of abstraction. J. Softw. Maint.: Res. Pract. 7:1995;443-450 http://www.dur.ac.uk/~dcs0mpw/martin/papers/abstraction-t.ps.gz.
39. Ward M. Derivation of data intensive algorithms by formal transformation. IEEE Trans. Softw. Eng. 22:1996;665-686 http://www.dur.ac.uk/~dcs0mpw/martin/ papers/sw-alg.ps.gz.
40. Ward M. Assembler to C Migration using the FermaT transformation system. International Conference on Software Maintenance. Oxford, England, August 30-September 3, 1999:1999.
41. Ward M. Recursion removal/introduction by formal transformation: an aid to program development and program comprehension. Comput. J. 42:1999;650-673.
42. Ward M. Reverse engineering from assembler to formal specifications via program transformations. 7th Working Conference on Reverse Engineering. Brisbane, Queensland, Australia, November 23-25, 2000:2000; http://www.dur.ac. uk/~dcs0mpw/martin/papers/wcre2000.ps.gz.
43. Ward M., Calliss F.W., Munro M. The maintainer's assistant. Conference on Software Maintenance. Miami, Florida, October 16-19, 1989:1989; http://www.dur.ac.uk/~dcs0mpw/martin/papers/MA-89.ps.gz.
44. Wirth N. Program development by stepwise refinement. Comm. ACM. 14:1971;221-227.
45. Wordsworth J. Software Engineering with B. 1996;Addison Wesley Longman. ISBN 0-201-40356-0.
46. Yang H. The supporting environment for a reverse engineering system - the maintainer's assistant. Conference on Software Maintenance. Sorrento, Italy, December:1991.
47. Yang H., Ward M. Successful Evolution of Software Systems. 2003;Artech House. ISBN 1-58053-349-3.
48. Zhang X., Munro M., Harman M., Hu L. Weakest precondition for general recursive programs formalized in Coq. Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics. TPHOLs Lecture Notes in Computer Science. 2002;Springer-Verlag, New York, Heidelberg, Berlin.
49. Zhang X., Munro M., Harman M., Hu L. Mechanized operational semantics of WSL. IEEE International Workshop on Source Code Analysis and Manipulation. SCAM, Los Alamitos, California, USA:2002.