{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,23]],"date-time":"2026-10-23T03:30:26Z","timestamp":1792726226309,"version":"4.5.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642327582","type":"print"},{"value":"9783642327599","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32759-9_14","type":"book-chapter","created":{"date-parts":[[2012,8,21]],"date-time":"2012-08-21T06:12:30Z","timestamp":1345529550000},"page":"147-154","source":"Crossref","is-referenced-by-count":66,"title":["TLA\u2009+\u2009 Proofs"],"prefix":"10.1007","author":[{"given":"Denis","family":"Cousineau","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Damien","family":"Doligez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leslie","family":"Lamport","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephan","family":"Merz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Ricketts","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hern\u00e1n","family":"Vanzetto","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/3-540-46428-X_25","volume-title":"Fundamental Approaches to Software Engineering","author":"M. Balser","year":"2000","unstructured":"Balser, M., Reif, W., Schellhorn, G., Stenzel, K., Thums, A.: Formal System Development with KIV. In: Maibaum, T. (ed.) FASE 2000. LNCS, vol.\u00a01783, pp. 363\u2013366. Springer, Heidelberg (2000)"},{"key":"14_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-540-75560-9_13","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"R. Bonichon","year":"2007","unstructured":"Bonichon, R., Delahaye, D., Doligez, D.: Zenon: An Extensible Automated Theorem Prover Producing Checkable Proofs. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol.\u00a04790, pp. 151\u2013165. Springer, Heidelberg (2007)"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-14203-1_12","volume-title":"Automated Reasoning","author":"K. Chaudhuri","year":"2010","unstructured":"Chaudhuri, K., et al.: Verifying Safety Properties with the TLA\u2009+\u2009 Proof System. In: Giesl, J., H\u00e4hnle, R. (eds.) IJCAR 2010. LNCS, vol.\u00a06173, pp. 142\u2013148. Springer, Heidelberg (2010)"},{"key":"14_CR4","unstructured":"Lamport, L.: What good is temporal logic? In: Mason, R.E.A. (ed.) Information Processing 1983. IFIP, pp. 657\u2013668, North-Holland, Paris (September 1983)"},{"key":"14_CR5","unstructured":"Lamport, L.: Specifying Systems: The TLA\u2009+\u2009 Language and Tools for Hardware and Software Engineers. Addison-Wesley (2003)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-03466-4_2","volume-title":"Theoretical Aspects of Computing - ICTAC 2009","author":"L. Lamport","year":"2009","unstructured":"Lamport, L.: The PlusCal Algorithm Language. In: Leucker, M., Morgan, C. (eds.) ICTAC 2009. LNCS, vol.\u00a05684, pp. 36\u201360. Springer, Heidelberg (2009)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Lamport, L.: Byzantizing Paxos by refinement (2011), \n                  \n                    http:\/\/research.microsoft.com\/en-us\/um\/people\/lamport\/pubs\/web-byzpaxos.pdf","DOI":"10.1007\/978-3-642-24100-0_22"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Lamport, L.: How to write a 21st century proof. Journal of Fixed Point Theory and Applications (March 2012), doi:10.1007\/s11784-012-0071-6","DOI":"10.1007\/s11784-012-0071-6"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-21461-5_16","volume-title":"Formal Techniques for Distributed Systems","author":"T. Lu","year":"2011","unstructured":"Lu, T., Merz, S., Weidenbach, C.: Towards Verification of the Pastry Protocol Using TLA\u2009+\u2009. In: Bruni, R., Dingel, J. (eds.) FORTE 2011 and FMOODS 2011. LNCS, vol.\u00a06722, pp. 244\u2013258. Springer, Heidelberg (2011)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-28717-6_23","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"S. Merz","year":"2012","unstructured":"Merz, S., Vanzetto, H.: Automatic Verification of TLA\u2009+\u2009 Proof Obligations with SMT Solvers. In: Bj\u00f8rner, N., Voronkov, A. (eds.) LPAR-18 2012. LNCS, vol.\u00a07180, pp. 289\u2013303. Springer, Heidelberg (2012)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Parno, B., Lorch, J.R., Douceur, J.R., Mickens, J., McCune, J.M.: Memoir: Practical state continuity for protected modules. In: Security and Privacy, pp. 379\u2013394. IEEE (2011)","DOI":"10.1109\/SP.2011.38"},{"issue":"3","key":"14_CR12","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. Inf. Process. Lett.\u00a012(3), 115\u2013116 (1981)","journal-title":"Inf. Process. Lett."},{"key":"14_CR13","unstructured":"The TLAPS Project. Web page, \n                  \n                    http:\/\/msr-inria.inria.fr\/~doligez\/tlaps\/"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-71067-7_7","volume-title":"Theorem Proving in Higher Order Logics","author":"M. Wenzel","year":"2008","unstructured":"Wenzel, M., Paulson, L.C., Nipkow, T.: The Isabelle Framework. In: Mohamed, O.A., Mu\u00f1oz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol.\u00a05170, pp. 33\u201338. Springer, Heidelberg (2008)"},{"key":"14_CR15","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"The Seventeen Provers of the World","year":"2006","unstructured":"Wiedijk, F. (ed.): The Seventeen Provers of the World. LNCS (LNAI), vol.\u00a03600. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","FM 2012: Formal Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32759-9_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:14:50Z","timestamp":1620116090000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32759-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642327582","9783642327599"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32759-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}