{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:38Z","timestamp":1725663998787},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584506"},{"type":"electronic","value":"9783540488033"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58450-1_34","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:11:11Z","timestamp":1330254671000},"page":"49-64","source":"Crossref","is-referenced-by-count":1,"title":["Towards a HOL theory of memory"],"prefix":"10.1007","author":[{"given":"J. -P.","family":"Bodeveix","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Filali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Roche","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"4_CR1","unstructured":"A. Arnold. Syst\u00e8mes de transitions finis et s\u00e9mantiques des processus communicants. Etudes et recherches en informatique. MASSON, 1992."},{"key":"4_CR2","unstructured":"M.J.C. Gordon and T.F. Melham. Introduction to HOL. Cambridge University Press, 1994."},{"key":"4_CR3","unstructured":"D. Litaize. Architectures multiprocesseurs \u00e0 m\u00e9moire commune. In Deuxi\u00e8me symposium architectures nouvelles de machines, pages 1\u201340, sep 1990."},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF01383986","volume":"3","author":"P. Loewenstein","year":"1993","unstructured":"P. Loewenstein. A formal theory of simulations between infinite automata. Formal methods in system design, 3:117\u2013149, 1993.","journal-title":"Formal methods in system design"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013151, aug 1987.","DOI":"10.1145\/41840.41852"},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1145\/5001.5007","volume":"3","author":"J. Misra","year":"1986","unstructured":"J. Misra. Axioms for memory access in asynchronous hardware systems. ACM Transactions on Programming Languages and systems, 3:142\u2013153, 1986.","journal-title":"ACM Transactions on Programming Languages and systems"},{"key":"4_CR7","unstructured":"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."},{"issue":"1","key":"4_CR8","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/160551.160553","volume":"27","author":"D. Mosberger","year":"1993","unstructured":"D. Mosberger. Memory consistency models. Operating Systems Review, 27(1):18\u201326, jan 1993.","journal-title":"Operating Systems Review"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"T. Nipkow. Formal verification of data type refinement \u2014 theory and practice. In Stepwise refinement of distributed systems, volume 430 of LNCS, pages 561\u2013591. Springer Verlag, 1992.","DOI":"10.1007\/3-540-52559-9_79"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"F. Pong and M. Dubois. The verification of cache coherence protocols. Technical Report CENG-92-20, USC, nov 1992.","DOI":"10.1145\/165231.165233"},{"issue":"6","key":"4_CR11","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1109\/2.55497","volume":"23","author":"P. Stenstrom","year":"1990","unstructured":"P. Stenstrom. A survey of cache coherence schemes for mutliprocessors. Computer, 23(6):11\u201325, jun 1990.","journal-title":"Computer"},{"key":"4_CR12","unstructured":"A.S. Tanenbaum. Computer Networks. Prentice Hall, 1989."}],"container-title":["Lecture Notes in Computer Science","Higher Order Logic Theorem Proving and Its Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58450-1_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:21:25Z","timestamp":1605630085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58450-1_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584506","9783540488033"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-58450-1_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}