{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:41:57Z","timestamp":1780994517747,"version":"3.54.1"},"reference-count":26,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:00:00Z","timestamp":1649203200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Program. Lang. Syst."],"published-print":{"date-parts":[[2022,6,30]]},"abstract":"<jats:p>Prophecy variables were introduced in the article \u201cThe Existence of Refinement Mappings\u201d by Abadi and Lamport. They were difficult to use in practice. We describe a new kind of prophecy variable that we find much easier to use. We also reformulate ideas from that article in a more mathematical way.<\/jats:p>","DOI":"10.1145\/3492545","type":"journal-article","created":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T13:43:49Z","timestamp":1649252629000},"page":"1-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Prophecy Made Simple"],"prefix":"10.1145","volume":"44","author":[{"given":"Leslie","family":"Lamport","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0974-1844","authenticated-orcid":false,"given":"Stephan","family":"Merz","sequence":"additional","affiliation":[{"name":"University of Lorraine, CNRS, Inria, LORIA, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,4,6]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/978-3-662-46675-9_23","volume-title":"Fundamental Approaches to Software Engineering (Lecture Notes in Computer Science)","author":"Abadi Mart\u00edn","year":"2015","unstructured":"Mart\u00edn Abadi. 2015. The prophecy of undo. In Fundamental Approaches to Software Engineering (Lecture Notes in Computer Science), Alexander Egyed and Ina Schaefer (Eds.), Vol. 9033. Springer, Berlin, 347\u2013361."},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90224-P"},{"key":"e_1_3_2_4_2","doi-asserted-by":"crossref","unstructured":"Yehuda Afek Hagit Attiya Danny Dolev Eli Gafni Michael Merritt and Nir Shavit. 1993. Atomic snapshots of shared memory. Journal of the ACM 40 4 (Sept. 1993) 873\u2013890.","DOI":"10.1145\/153724.153741"},{"key":"e_1_3_2_5_2","doi-asserted-by":"crossref","unstructured":"Bowen Alpern and Fred B. Schneider. 1985. Defining liveness. Information Processing Letters 21 4 (Oct. 1985) 181\u2013185.","DOI":"10.1016\/0020-0190(85)90056-0"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01872848"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-11(1:20)2015"},{"key":"e_1_3_2_8_2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BFb0055631","volume-title":"Concurrency Theory","author":"Cohen Ernie","year":"1998","unstructured":"Ernie Cohen and Leslie Lamport. 1998. Reduction in TLA. In Concurrency Theory(CONCUR\u201998) (Lecture Notes in Computer Science), David Sangiorgi and Robert de Simone (Eds.), Vol. 1466. Springer-Verlag, 317\u2013331."},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926431"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"e_1_3_2_11_2","doi-asserted-by":"crossref","unstructured":"Maurice P. Herlihy and Jeannette M. Wing. 1990. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems 12 3 (Jan. 1990) 463\u2013492.","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/1042038.1042044"},{"key":"e_1_3_2_13_2","doi-asserted-by":"crossref","unstructured":"C. A. R. Hoare. 1969. An axiomatic basis for computer programming. Communications of the ACM 12 10 (Oct. 1969) 576\u2013583.","DOI":"10.1145\/363235.363259"},{"key":"e_1_3_2_14_2","doi-asserted-by":"crossref","unstructured":"C. A. R. Hoare. 1972. Proof of correctness of data representations. Acta Informatica 1 (1972) 271\u2013281.","DOI":"10.1007\/BF00289507"},{"key":"e_1_3_2_15_2","unstructured":"C. A. R. Hoare. 2019. (2019). Personal communication."},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3371113"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00153-3"},{"key":"e_1_3_2_18_2","volume-title":"Specifying Systems","author":"Lamport Leslie","year":"2003","unstructured":"Leslie Lamport. 2003. Specifying Systems. Addison-Wesley, Boston. Also available at http:\/\/lamport.org."},{"key":"e_1_3_2_19_2","unstructured":"Leslie Lamport and Stephan Merz. 2017. Auxiliary Variables in TLA+. arXiv:1703.05121 (https:\/\/arxiv.org\/abs\/1703.05121.). Also available together with TLA \\( ^{+} \\)  specifications at http:\/\/lamport.azurewebsites.net\/tla\/auxiliary\/auxiliary.html."},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462189"},{"key":"e_1_3_2_21_2","doi-asserted-by":"crossref","unstructured":"Richard J. Lipton. 1975. Reduction: A method of proving properties of parallel programs. Communications of the ACM 18 12 (Dec. 1975) 717\u2013721.","DOI":"10.1145\/361227.361234"},{"key":"e_1_3_2_22_2","doi-asserted-by":"crossref","unstructured":"Susan Owicki and David Gries. 1976. Verifying properties of parallel programs: An axiomatic approach. Communications of the ACM 19 5 (May 1976) 279\u2013284.","DOI":"10.1145\/360051.360224"},{"key":"e_1_3_2_23_2","volume-title":"Axiomatic Proof Techniques for Parallel Programs","author":"Owicki Susan Speer","year":"1975","unstructured":"Susan Speer Owicki. 1975. Axiomatic Proof Techniques for Parallel Programs. Ph.D. Dissertation. Cornell University."},{"key":"e_1_3_2_24_2","first-page":"1","volume-title":"2018 Formal Methods in Computer Aided Design (FMCAD\u201918)","author":"Padon Oded","year":"2018","unstructured":"Oded Padon, Jochen Hoenicke, Kenneth L. McMillan, Andreas Podelski, Mooly Sagiv, and Sharon Shoham. 2018. Temporal prophecy for proving temporal properties of infinite-state systems. In 2018 Formal Methods in Computer Aided Design (FMCAD\u201918), Nikolaj Bj\u00f8rner and Arie Gurfinkel (Eds.). IEEE, 1\u201311."},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.32"},{"key":"e_1_3_2_26_2","volume-title":"Back and Forth: Prophecy Variables for Static Verification of Concurrent Programs","author":"Qadeer Shaz","year":"2009","unstructured":"Shaz Qadeer, Ali Sezgin, and Serdar Tasiran. 2009. Back and Forth: Prophecy Variables for Static Verification of Concurrent Programs. Technical Report MSR-TR-2009-142. Microsoft."},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29952-0_12"}],"container-title":["ACM Transactions on Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3492545","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3492545","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:51Z","timestamp":1750188651000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3492545"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,6]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6,30]]}},"alternative-id":["10.1145\/3492545"],"URL":"https:\/\/doi.org\/10.1145\/3492545","relation":{},"ISSN":["0164-0925","1558-4593"],"issn-type":[{"value":"0164-0925","type":"print"},{"value":"1558-4593","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,6]]},"assertion":[{"value":"2020-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-04-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}