{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:48:13Z","timestamp":1725490093152},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540745907"},{"type":"electronic","value":"9783540745914"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74591-4_21","type":"book-chapter","created":{"date-parts":[[2007,8,22]],"date-time":"2007-08-22T14:49:52Z","timestamp":1187794192000},"page":"278-293","source":"Crossref","is-referenced-by-count":4,"title":["Operational Reasoning for Concurrent Caml Programs and Weak Memory Models"],"prefix":"10.1007","author":[{"given":"Tom","family":"Ridge","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/11817963_45","volume-title":"Computer Aided Verification","author":"S. Burckhardt","year":"2006","unstructured":"Burckhardt, S., Alur, R., Martin, M.M.K.: Bounded model checking of concurrent data types on relaxed memory models: A case study. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 489\u2013502. Springer, Heidelberg (2006)"},{"key":"21_CR2","unstructured":"Compton, M.: Stenning\u2019s protocol implemented in UDP and verified in Isabelle. In: Atkinson, M.D., Dehne, F.K.H.A. (eds.) CATS. CRPIT, vol.\u00a041, pp. 21\u201330. Australian Computer Society (2005)"},{"key":"21_CR3","unstructured":"Gonthier, G.: A computer-checked proof of the Four Colour Theorem (2005), \n                  \n                    http:\/\/research.microsoft.com\/~gonthier\/4colproof.pdf"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/978-3-540-27813-9_31","volume-title":"Computer Aided Verification","author":"G. Gopalakrishnan","year":"2004","unstructured":"Gopalakrishnan, G., Yang, Y., Sivaraj, H.: An efficient execution verification tool for memory orderings. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol.\u00a03114, pp. 401\u2013413. Springer, Heidelberg (2004)"},{"key":"21_CR5","unstructured":"Holzmann, G.J., Bosnacki, D.: The design of a multi-core extension of the Spin Model Checker. In: FMCAD. Formal Methods in Computer Aided Design (November 2006)"},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1093\/comjnl\/38.2.131","volume":"38","author":"P.V. Homeier","year":"1995","unstructured":"Homeier, P.V., Martin, D.F.: A mechanically verified verification condition generator. Comput. J.\u00a038(2), 131\u2013141 (1995)","journal-title":"Comput. J."},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Communications of the ACM, 12 (1969)","DOI":"10.1145\/363235.363259"},{"key":"21_CR8","unstructured":"Jones, C.B.: Development methods for computer programs including a notion of interference. Technical Report PRG-25, Programming Research Group, Oxford University Computing Laboratory (1981)"},{"key":"21_CR9","unstructured":"Kawash, J.Y.: Limitations and capabilities of weak memory consistency systems. PhD thesis, Computer Science, University of Calgary (2000)"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/978-3-540-30142-4_14","volume-title":"Theorem Proving in Higher Order Logics","author":"H. Liu","year":"2004","unstructured":"Liu, H., Moore, J.S.: Java program verification via a JVM deep embedding in ACL2. In: Slind, K., Bunker, A., Gopalakrishnan, G.C. (eds.) TPHOLs 2004. LNCS, vol.\u00a03223, pp. 184\u2013200. Springer, Heidelberg (2004)"},{"key":"21_CR11","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"issue":"2","key":"21_CR12","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1109\/MAHC.1984.10017","volume":"6","author":"F.L. Morris","year":"1984","unstructured":"Morris, F.L., Jones, C.B.: An early program proof by Alan Turing. Annals of the History of Computing\u00a06(2), 143\u2013193 (1984)","journal-title":"Annals of the History of Computing"},{"issue":"2-3","key":"21_CR13","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1002\/cpe.771","volume":"16","author":"S.P. Midkiff","year":"2004","unstructured":"Midkiff, S.P., Lee, J., Padua, D.A.: A compiler for multiple memory models. Concurrency and Computation: Practice and Experience\u00a016(2-3), 197\u2013220 (2004)","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.ic.2004.10.007","volume":"199","author":"F. Mehta","year":"2005","unstructured":"Mehta, F., Nipkow, T.: Proving pointer programs in higher-order logic. Information and Computation\u00a0199, 200\u2013227 (2005)","journal-title":"Information and Computation"},{"issue":"3","key":"21_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0020-0190(81)90106-X","volume":"12","author":"G.L. Peterson","year":"1981","unstructured":"Peterson, G.L.: Myths about the mutual exclusion problem. Information Processing Letters\u00a012(3), 115\u2013116 (1981)","journal-title":"Information Processing Letters"},{"key":"21_CR16","unstructured":"Ridge, T.: Simpson\u2019s four slot algorithm in Isabelle\/HOL, available online, at \n                  \n                    http:\/\/www.cl.cam.ac.uk\/~tjr22"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Theorem Proving in Higher Order Logics","author":"T. Ridge","year":"2005","unstructured":"Ridge, T., Margetson, J.: A mechanically verified, sound and complete theorem prover for FOL. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol.\u00a03603, Springer, Heidelberg (2005)"},{"key":"21_CR18","unstructured":"Sewell, P., Nardelli, F.Z., Owens, S., Peskine, G., Ridge, T., Sarkar, S., Strni\u0161a, R.: Ott: Effective tool support for the working semanticist. In: ICFP 2007. The 12th ACM SIGPLAN International Conference on Functional Programming (accepted, 2007)"}],"container-title":["Lecture Notes in Computer Science","Theorem Proving in Higher Order Logics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74591-4_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:28:09Z","timestamp":1619519289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74591-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540745907","9783540745914"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74591-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}