Abstract
In this paper, we develop with great details a classical little example1 of refinement from initial specification down to final code. We insist on a few methodological points among which are the following:
-
the importance of a sound mathematical preamble,
-
the systematic usage of data refinement steps based on clear and intuitive technical decisions,
-
the reusability of already specified and refined pieces of code.
The exercise is conducted using an homogeneous notational style based on Abstract Machines and Generalized Substitutions [1].
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
J.R. Abrial Assigning Programs to Meanings Book to appear.
J.R. Abrial A Formal Approach to Large Software Construction 1989.
E.W. Dijkstra A Discipline of Programming Prentice Hall 1976.
E.W. Dijkstra and W.H.J. Feijen A Method of Programming Addison-Wesley 1988.
R.G. Dromey How to Solve it by Computer Prentice Hall International 1982.
D. Gries The Science of Programming Springer Verlag 1981.
J. Misra A Technique of Algorithmic Construction on Sequences IEEE Transaction on Software Engineering January 1978.
D.L.ParnasA Technique for Software Module Specification with Examples CACM 14,5 1972.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abrial, J.R. (1991). A Refinement Case Study (using the Abstract Machine Notation). In: Morris, J.M., Shaw, R.C. (eds) 4th Refinement Workshop. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3756-6_4
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3756-6_4
Publisher Name: Springer, London
Print ISBN: 978-3-540-19657-0
Online ISBN: 978-1-4471-3756-6
eBook Packages: Springer Book Archive