Abstract
One of the crucial operations on the path from specification to implementation is the modification of data structures. In this paper we demonstrate how this task can be accomplished constructively.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Lee Blaine, Li-Mei Gilham, Allen Goldberg, Richard Jüllig, Jim McDonald, and Y. V. Srinivas. SLANG Language Manual. Kestrel Institute, June 1994. draft.
M. Broy, B. Möller, P. Pepper, and M. Wirsing. Algebraic implementations preserve program correctness. Science of Computer Programming, (7):35–53, 1986.
M. Broy. Algebraic methods for program construction:The project CIP. In P. Pepper, editor, Proc. of the workshop on program transformation and programming languages, pages 199–222, Berlin, 1984. Springer.
M. Broy. Deductive Program Development: Evaluation in Reverse Polnish Notation as an Example. In Methodik des Programmierens, number MIP-8915, pages 77–97. University of Passau, 1989.
M. Broy and M. Wirsing. Ultra-loose Algebraic Specification. Bulletin of the EATCS, 35:117–128, June 1988.
I. Claßen. ACT ONE — A Language for Parameterized Specification. In H. Ehrig, I. Claßen, W. Fey, and D. Wolz, editors, ACT: Algebraic Specification Techniques and Tools for Software Development, chapter 2. AMAST Series in COMPUTING, 1992. Proposal.
Ernst Denert. Software-Engineering. Springer, 1991.
H.-D. Ehrich et al. Korso Reference Languages: Concepts and Application Domains. In this volume.
H.D. Ehrich. On the theory of specification, implementation, and parameterization of abstract data types. J. ACM, (29(1)):206–277, 1982.
H. Ehrig, H.-J. Kreowski, B. Mahr, and P. Padawitz. Algebraic implementation of abstract data types. Theoret. Comp. Sci., (20):209–263, 1982.
J.A. Goguen, J.A. Thatcher, and E.G. Wagner. An initial algebra approach to the specification correctness, and implementation of abstract data types. In R.T. Yeh, editor, Current Trends in Programming Methodology, volume 4: Data Structuring, pages 49–189. Prentice-Hall, Englewood Cliffs, NJ, 1978.
C.A.R. Hoare. Proofs of correctness of data representations. Acta Informatica, (1):271–281, 1972.
P. Pepper. Algebraic techniques for program specification. In P. Pepper, editor, Program Transformation and Programming Environments, pages 231–244, Berlin, 1984. Springer.
P. Pepper. Transforming Algebraic Specifications — Lessons Learnt from an Example. In B. Möller, editor, Proc. IFIP TC 2 Conf. on Constructing Programs from Specifications, Pacific Grove, California, May 1991, pages 1–27, Amsterdam, 1991. Elsevier.
P. Pepper and M. Wirsing. A Method for the Development of Correct Software. In this volume.
D.T. Sanella and A. Tarlecki. Towards formal development of programs from algebraic specifications: implementation revisited. Acta Informatica, (25):233–281, 1988.
Martin Wirsing. Algebraic Specification. In van Leeuven, editor, Handbook of Theoretical Computer Science. North-Holland, Amsterdam, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Pepper, P., Betschko, R., Dick, S., Didrich, K. (1995). Realizing sets by hash tables. In: Broy, M., Jähnichen, S. (eds) KORSO: Methods, Languages, and Tools for the Construction of Correct Software. Lecture Notes in Computer Science, vol 1009. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015455
Download citation
DOI: https://doi.org/10.1007/BFb0015455
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60589-8
Online ISBN: 978-3-540-47802-7
eBook Packages: Springer Book Archive