Abstract
This paper introduces a formalization of memory models for multiprocessor architectures based on transition systems. Relations between memory models can be expressed as simulations between the corresponding transition systems. We show how simulation relations are preserved by structuring operators over transition systems. We derive from them proof tactics used to establish simulation relations between basic memory models. These memory models are also proved correct against a formal characterization of memory consistencies.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Arnold. Systèmes de transitions finis et sémantiques des processus communicants. Etudes et recherches en informatique. MASSON, 1992.
M.J.C. Gordon and T.F. Melham. Introduction to HOL. Cambridge University Press, 1994.
D. Litaize. Architectures multiprocesseurs à mémoire commune. In Deuxième symposium architectures nouvelles de machines, pages 1–40, sep 1990.
P. Loewenstein. A formal theory of simulations between infinite automata. Formal methods in system design, 3:117–149, 1993.
N.A. Lynch and M.R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the sixth annual ACM symposium on principles of distributed computing, pages 137–151, aug 1987.
J. Misra. Axioms for memory access in asynchronous hardware systems. ACM Transactions on Programming Languages and systems, 3:142–153, 1986.
M. Mizuno, M. Raynal, G. Singh, and M.L. Neilsen. An efficient implementation of sequentially consistent distributed shared memories. Technical Report 764, IRISA, oct 1993.
D. Mosberger. Memory consistency models. Operating Systems Review, 27(1):18–26, jan 1993.
T. Nipkow. Formal verification of data type refinement — theory and practice. In Stepwise refinement of distributed systems, volume 430 of LNCS, pages 561–591. Springer Verlag, 1992.
F. Pong and M. Dubois. The verification of cache coherence protocols. Technical Report CENG-92-20, USC, nov 1992.
P. Stenstrom. A survey of cache coherence schemes for mutliprocessors. Computer, 23(6):11–25, jun 1990.
A.S. Tanenbaum. Computer Networks. Prentice Hall, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bodeveix, J.P., Filali, M., Roche, P. (1994). Towards a HOL theory of memory. In: Melham, T.F., Camilleri, J. (eds) Higher Order Logic Theorem Proving and Its Applications. HUG 1994. Lecture Notes in Computer Science, vol 859. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58450-1_34
Download citation
DOI: https://doi.org/10.1007/3-540-58450-1_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58450-6
Online ISBN: 978-3-540-48803-3
eBook Packages: Springer Book Archive