Derivation of data intensive algorithms by formal transformation: the schnorr-waite graph marking algorithm

IEEE Transactions on Software Engineering

Volumn 22, Issue 9, 1996, Pages 665-686

  Ward, Martin ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Data refinement; Ghost variables; Graph marking; Pointer switching; Program development; Recursion removal; Schorr waite; Transformation; Transformational development refinement

Indexed keywords

EID: 0012579827     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/32.541437     Document Type: Article

References (49)

1. J.R. Abrial, S.T. Davis, M.K.O. Lee, D.S. Neilson, P.N. Scharbach, and I.H. S0rensen, The B Method, BP Research, Sunbury Research Centre, U.K., 1991.
2. J. Arsac, "Transformation of Recursive Procedures," Tools and Notations for Program Construction, D. Keel, ed. Cambridge, U.K.: Cambridge Univ. Press, 1982.
3. J. Arsac, "Syntactic Source to Source Program Transformations and Program Manipulation," Comtn ACM, vol. 22, Jan. 1982.
4. R.J.R. Back, Correctness Preserving Program Refinements. Mathematical Centre Iracts #131, Mathematisch Centrum, Amsterdam, 1980.
5. R.J.R. Back and J. von Wright, "Refinement Concepts Formalised in Higher-Order Logic," Formal Aspects of Computing 2,1990.
6. R. Balzer, "A 15 Year Perspective on Automatic Programming," IEEE Tram. Software Eng., vol. 11, Nov. 1985.
7. F.L. Bauer, B. Moller, H. Partsch, and P. Pepper, "Formal Construction by Transformalion-Computer Aided Intuition Guided Programming," IEEE Trans. Software Eng., vol. 15, Feb. 1989.
8. R. Bird, "Lectures nn Constructive Functional Programming," Oxford Univ., Technical Monograph PRG-69, Sept. 1988.
9. M. Broy and P. Pepper, "Combining Algebraic and Algorithmic Reasoning: An Approach to the Schnorr-Waite Algorithm," Trans. Programming Languages and Systems, vol. 4, July 1982.
10. B.A. Davey and H.A. Priestley, Introduction to Lattices and Order. Cambridge, U.K.: Cambridge Univ. Press, 1990.
11. N. Derschowitz, "The Schnorr-Waite Marking Algorithm Revisited," Information Processing Letters, vol. 11,1980.
12. R.B.K. Dewar, A. Grand, S.C. Liu, and J.T. Schwartz, "Programming by Refinement as Exemplified by the SETL Representation Sublanguage," ACM Trans. Programming Languages and Systems, vol. 1, July 1979.
13. E.W. Dijkstra, A Discipline of Programming. Englewood Cliffs, N.J.: Prentice Hall, 1976.
14. E. Engeler, Formal Languages: Automata and Structures. Chicago: Markham, 1968.
15. ]15] S.E. Gerhart, "A Derivation-Oriented Proof of the Schnorr-Waite Graph Marking Algorithm," Program Construction, G. Goos and H. Hartmanis, eds., Lecture Notes in Computer Science #69, New York, Heidelberg, Berlin: Springer-Verlag, 1979.
16. D. Gries, "Is Sometimes Ever Better than Always?" Program Construction, G. Goos and H. Harmanis, cds., Lecture Notes in Com puter Science $69, New York, Heidelberg, Berlin: Springer-Verlag, 1979.
17. D. Gries, "The Schnorr-Wiate Graph Marking Algorithm," Actu hifnrmatica, vol. 11,1979.
18. D. Gries, The Science of Programming. New York, Heidelberg, Berlin: Springer-Verlag, 1981.
19. M. Griffiths, Development of the Schnorr-Waite Algorithm, Lecture Notes in Computer Science #69, New York, Heidelberg, Berlin: Springer-Verlag, 1981.
20. l.J. Hayes, Specification Case Studies. Englewood Cliffs, K.J.: Prentice Hall, 1987.
21. C.A.R. Hoare, "An Axiomatic Basis for Computer Programming," Comm. ACM, 1969.
22. [22[ C.B. Jones, Systematic Software Development Using VSJM.. Knglewood Cliffs, N.J.: Prentice Hall, 1986.
23. C.B. Jones, K.D. Jones, P.A. Lindsay, and R. Moore, mural: A Formal Development Support System. New York, Heidelberg, Berlin: Springer-Verlag, 1991.
24. Jorring and Scherlis, "Deriving and Using Destructive Data Types," Program Spécification and Transformation: Proc. IFIP TC2/WG 2.1 Working COMJ., L.G.E.T. Meertens, ed., Bad Tolz, Germany, Apr. 15-17,1986. Amsterdam: NIorth Holland, 1987.
25. C.R> Karp, Languages with Expressions of Infinite Length. Amsterdam: North Holland, 1964.
26. D.E. Knuth, "Structured Programming with the GOTO Statement," Computing Surveys, vol. 6,1974.
27. R. Kowalski, "Algorithm = Logic + Control," Comm. ACM, vol. 22, July 1979.
28. Z. Manna and R. Waldinger, "Is 'Sometime' Sometimes Better Than 'Always'? Intermittent Assertions in Proving Program Correctness," Comm. ACM, vol. 21,1978.
29. C.C. Morgan, Programming from Specifications, second edition. Englewood Cliffs, N.J.: Prentice Hall, 1994.
30. J.H. Morris, "A Proof of the Schnorr-Waite Algorithm," Theoretical Foundations of Programming Metlwdology, M. Broy and G. Schmidt, eds., Int'l Summer School, Marktoberdorf, 1981. Dordrecht: Reidel, 1982.
31. M. Ncilson, K. Havclund, K.R. Wagner, and E, Saaman, "The RAISE Language, Method and Tools," Formal Aspects of Computing, vol. 1,1989.
32. H. Partsch, "The CIP Transformation System," Program Transformation and Programming Environments, report on a workshop directed by F.L. Bauer and H. Remus, P. Pepper, ed. New York, Heidelberg, Berlin: Springer-Verlag, 1984.
33. E.L. Post, "Formal Reduction of the General Combinatorial Decision Problem," Am. J. Math., 1943.
34. W.P. de Roever, "On Backtracking and Greatest Fixpoints," Formal Description of Programming Constructs, E.J. Neuhold, ed. Amsterdam: North Holland, 1978.
35. H. Schnorr and W.M. Waite, "An Efficient Machine-Independent Procedure for Garbage Collection in Various List Structures/' Comm. ACM, Aug. 1967.
36. C.T. Sennett, "Using Refinement to Convince: Lessons Learned from a Case Study," Proc. Refinement Workshop, Hursley Park, Winchester, U.K., Jan. 8-11,1990.
37. [37[ D. Taylor, "An Alternative to Current Looping Syntax," SIGPLAN Notices, vol. 19, Dec. 1984.
38. R.W. Topor, "The Correctness of the Schnorr-Waite List Marking Algorithm," Ada Informatica, vol. 11,1979.
39. M. Ward, "Proving Program Refinements and Transformation," DPhil thesis, Oxford Univ., 1989.
40. M. Ward, "Derivation of a Sorting Algorithm," technical report, Durham Univ., 1991.
41. M. Ward, "'A Recursion Removal Theorem-Proof and Applications," technical report, Durham Univ., 1991.
42. M. Ward, "A Resursion Removal Theorem," Proc. Fifth Refinement Workshop, New York, Heidelberg, Berlin: Springer-Verlag, 1992. http://ws-mj3.dur.ac.Uk/martin/papers/rei-ws~5.ps.g/,
43. M. Ward, "Foundations for a Practical Theory of Program Refinement and Transformation/' technical report, Durham Univ., 1994.
44. M. Ward, "Using Formal Transformations to Construct a Component Repository," Software Reuse: The European Approach. New York, Heidelberg, Berlin: Springer-Verlag, Feb. 1991. http://wsmj3.dur.ac.uk/martin/papers/reuse.ps.gz.
45. M. Ward, "ion a Specification from Code," J. Software Maintenance: Research and Practice, vol. 5, June 1993.
46. M. Ward and K.H. Bennett, "A Practical Program Transformation Ssytem for Reverse Engineering," Proc. Working Conf. Reverse Eng., Baltimore, May 21-23,1993. http:/ / ws-mj3.dur.ac.uk/martin/papers/icse.ps.gz.
47. D. Wile, "Type Transformations," IEEE Ttans. Software Eng., vol. 7, (an. 1981.
48. L. Yelowitz and A.G. Duncan, "ions, Instantiations and Proofs of Marking Algorithms," S1GPLAN Notices,vol. 12,1977. http://ws-mj3.dur.ac.uk/martin/papcrs/prog-spcc.ps.gz.
49. E.J. Younger and M. Ward, "Inverse Engineering a Simple Real Time Program," J. Software Maintenance: Research and Practice, vol. 6, 1993.