{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:51Z","timestamp":1772164011794,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,6,11]],"date-time":"2012-06-11T00:00:00Z","timestamp":1339372800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,6,11]]},"DOI":"10.1145\/2254064.2254072","type":"proceedings-article","created":{"date-parts":[[2012,6,11]],"date-time":"2012-06-11T09:03:31Z","timestamp":1339405411000},"page":"55-66","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Speculative linearizability"],"prefix":"10.1145","author":[{"given":"Rachid","family":"Guerraoui","sequence":"first","affiliation":[{"name":"Swiss Federal Institute of Technology Lausanne (EPFL), Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Viktor","family":"Kuncak","sequence":"additional","affiliation":[{"name":"Swiss Federal Institute of Technology Lausanne (EPFL), Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuliano","family":"Losa","sequence":"additional","affiliation":[{"name":"Swiss Federal Institute of Technology Lausanne (EPFL), Lausanne, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281107"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/646528.695058"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. NSDI. USENIX Assoc.","author":"Bolosky W. J.","year":"2011","unstructured":"W. J. Bolosky , D. Bradshaw , R. B. Haagens , N. P. Kusters , and P. Li . Paxos replicated state machines as the basis of a high-performance data store . In Proc. NSDI. USENIX Assoc. , 2011 . W. J. Bolosky, D. Bradshaw, R. B. Haagens, N. P. Kusters, and P. Li. Paxos replicated state machines as the basis of a high-performance data store. In Proc. NSDI. USENIX Assoc., 2011."},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. OSDI. USENIX Assoc.","author":"Burrows M.","year":"2006","unstructured":"M. Burrows . The Chubby lock service for loosely-coupled distributed systems . In Proc. OSDI. USENIX Assoc. , 2006 . M. Burrows. The Chubby lock service for loosely-coupled distributed systems. In Proc. OSDI. USENIX Assoc., 2006."},{"key":"e_1_3_2_1_5_1","volume-title":"MIT","author":"Castro M.","year":"1999","unstructured":"M. Castro and B. Liskov . A correctness proof for a practical byzantine-fault-tolerant replication algorithm. Technical report , MIT , 1999 . M. Castro and B. Liskov. A correctness proof for a practical byzantine-fault-tolerant replication algorithm. Technical report, MIT, 1999."},{"key":"e_1_3_2_1_6_1","volume-title":"OSDI","author":"Castro M.","year":"1999","unstructured":"M. Castro and B. Liskov . Practical Byzantine fault tolerance . In OSDI , 1999 . M. Castro and B. Liskov. Practical Byzantine fault tolerance. In OSDI, 1999."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-002-0070-8"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1755913.1755950"},{"key":"e_1_3_2_1_10_1","unstructured":"R. Guerraoui V. Kuncak and G. Losa. Abortable linearizable modules. In G. Klein T. Nipkow and L. Paulson editors The Archive of Formal Proofs. http:\/\/afp.sf.net\/entries\/Abortable_Linearizable_Modules.shtml 2012. Formal proof development.  R. Guerraoui V. Kuncak and G. Losa. Abortable linearizable modules. In G. Klein T. Nipkow and L. Paulson editors The Archive of Formal Proofs. http:\/\/afp.sf.net\/entries\/Abortable_Linearizable_Modules.shtml 2012. Formal proof development."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_13_1","unstructured":"M. Jaskelioff and S. Merz. Proving the correctness of Disk Paxos. In G. Klein T. Nipkow and L. Paulson editors The Archive of Formal Proofs. http:\/\/afp.sf.net\/entries\/DiskPaxos.shtml June 2005. Formal proof development.  M. Jaskelioff and S. Merz. Proving the correctness of Disk Paxos. In G. Klein T. Nipkow and L. Paulson editors The Archive of Formal Proofs. http:\/\/afp.sf.net\/entries\/DiskPaxos.shtml June 2005. Formal proof development."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872079"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294267"},{"key":"e_1_3_2_1_16_1","first-page":"95","article-title":"The implementation of reliable distributed multiprocess systems","volume":"2","author":"Lamport L.","year":"1978","unstructured":"L. Lamport . The implementation of reliable distributed multiprocess systems . Computer Networks , 2 : 95 -- 114 , 1978 . L. Lamport. The implementation of reliable distributed multiprocess systems. Computer Networks, 2:95--114, 1978.","journal-title":"Computer Networks"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01786227"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01786228"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/7351.7352"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1134"},{"key":"e_1_3_2_1_21_1","first-page":"219","article-title":"An introduction to input\/output automata","volume":"2","author":"Lynch N. A.","year":"1989","unstructured":"N. A. Lynch and M. R. Tuttle . An introduction to input\/output automata . CWI Quarterly , 2 : 219 -- 246 , 1989 . N. A. Lynch and M. R. Tuttle. An introduction to input\/output automata. CWI Quarterly, 2:219--246, 1989.","journal-title":"CWI Quarterly"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/646525.694871"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.970581"},{"key":"e_1_3_2_1_24_1","volume-title":"NSDI","author":"Singh A.","year":"2008","unstructured":"A. Singh , T. Das , P. Maniatis , P. Druschel , and T. Roscoe . BFT protocols under fire . In NSDI , 2008 . A. Singh, T. Das, P. Maniatis, P. Druschel, and T. Roscoe. BFT protocols under fire. In NSDI, 2008."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39989-6_4"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/646526.694887"}],"event":{"name":"PLDI '12: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Beijing China","acronym":"PLDI '12","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2254064.2254072","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2254064.2254072","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:00:38Z","timestamp":1750262438000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2254064.2254072"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,11]]},"references-count":25,"alternative-id":["10.1145\/2254064.2254072","10.1145\/2254064"],"URL":"https:\/\/doi.org\/10.1145\/2254064.2254072","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2345156.2254072","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2012,6,11]]},"assertion":[{"value":"2012-06-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}