Abstract
The transformational programming, method of algorithm derivation starts with a formal specification of the result to be achieved (which provides no indication of how the result is to be achieved), plus some informal ideas as to what techniques will be used in the implementation. The formal specification is then transformed into an implementation, by means of correctness-preserving refinement and transformation steps. The informal ideas are used to guide the selection of transformations to apply: since they only guide the selection of valid transformations, the ideas do not themselves have to be formalised.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ralph-Johan Back, “Invariant Based Programming: Basic Approach and Teaching Experiences,” Formal Aspects of Computing 21#3 (May, 2009), 227–244.
E. W. Dijkstra, “A Constructive Approach to the Problem of Program Correctness.,” Technische Hogeschool Eindhoven, EWD209, http://www.cs.utexas.edu/users/EWD/ewd02xx/EWD209.PDF.
C. C. Morgan, Programming from Specifications, Prentice-Hall, Englewood Cliffs, NJ, 1994, Second Edition.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media B.V.
About this paper
Cite this paper
Ward, M., Zedan, H. (2011). Transformational Programming and the Derivation of Algorithms. In: Gelenbe, E., Lent, R., Sakellari, G., Sacan, A., Toroslu, H., Yazici, A. (eds) Computer and Information Sciences. Lecture Notes in Electrical Engineering, vol 62. Springer, Dordrecht. https://doi.org/10.1007/978-90-481-9794-1_4
Download citation
DOI: https://doi.org/10.1007/978-90-481-9794-1_4
Published:
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-9793-4
Online ISBN: 978-90-481-9794-1
eBook Packages: EngineeringEngineering (R0)