{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:53:26Z","timestamp":1794336806215,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540619840","type":"print"},{"value":"9783540495734","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0024426","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T01:41:39Z","timestamp":1132364499000},"page":"21-66","source":"Crossref","is-referenced-by-count":3,"title":["A TLA solution to the RPC-memory specification problem"],"prefix":"10.1007","author":[{"given":"Mart\u00edn","family":"Abadi","sequence":"first","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"}]}],"member":"297","published-online":{"date-parts":[[2005,6,18]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0304-3975(91)90224-P","volume":"82","author":"M. Abadi","year":"1991","unstructured":"Mart\u00edn Abadi and Leslie Lamport. The existence of refinement mappings. Theoretical Computer Science, 82(2):253\u2013284, May 1991.","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"3_CR2","doi-asserted-by":"publisher","first-page":"1543","DOI":"10.1145\/186025.186058","volume":"16","author":"M. Abadi","year":"1994","unstructured":"Mart\u00edn Abadi and Leslie Lamport. An old-fashioned recipe for real time. ACM Transactions on Programming Languages and Systems, 16(5):1543\u20131571, September 1994.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1145\/203095.201069","volume":"17","author":"M. Abadi","year":"1995","unstructured":"Mart\u00edn Abadi and Leslie Lamport. Conjoining specifications. ACM Transactions on Programming Languages and Systems, 17(3):507\u2013534, May 1995.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"3_CR4","unstructured":"Mart\u00edn Abadi, Leslie Lamport, and Stephan Merz. The Dagstuhl example\u2014a TLA solution. World Wide Web page at http:\/\/www.research. digital.com\/SRC\/dagstuhl\/dagstuhl.html. It can also be found by searching the Web for the 26-letter string formed by concatenating uid and lamportdagstuhlspecprob."},{"key":"3_CR5","unstructured":"Manfred Broy and Leslie Lamport. The RPC-memory specification problem. In this volume. Also available on [4]."},{"key":"3_CR6","volume-title":"Texts and Monographs in Computer Science","author":"N. Francez","year":"1986","unstructured":"Nissim Francez. Fairness. Texts and Monographs in Computer Science. Springer-Verlag, New York, Berlin, Heidelberg, Tokyo, 1986."},{"key":"3_CR7","first-page":"77","volume-title":"volume 630 of Lecture Notes in Computer Science","author":"R. Gerth","year":"1992","unstructured":"Rob Gerth, Ruurd Kuiper, and John Segers. Interface refinement in reactive systems. In W. R. Cleaveland, editor, 3rd International Conference on Concurrency Theory, volume 630 of Lecture Notes in Computer Science, pages 77\u201393, Berlin, Heidelberg, 1992. Springer-Verlag."},{"key":"3_CR8","first-page":"321","volume-title":"Specification and design of (parallel) programs","author":"C. B. Jones","year":"1983","unstructured":"Cliff B. Jones. Specification and design of (parallel) programs. In R. E. A. Mason, editor, Information Processing 83: Proceedings of the IFIP 9th World Congress, pages 321\u2013332, Amsterdam, September 1983. IFIP, North-Holland."},{"key":"3_CR9","unstructured":"Leslie Lamport. TLA\u2014temporal logic of actions. At URL http:\/\/www.research. digital. com\/SRC\/tla\/ on the World Wide Web. It can also be found by searching the Web for the 21-letter string formed by concatenating uid and lamporttlahomepage."},{"issue":"7","key":"3_CR10","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1080\/00029890.1995.12004627","volume":"102","author":"L. Lamport","year":"1993","unstructured":"Leslie Lamport. How to write a proof. American Mathematical Monthly, 102(7):600\u2013608, August\u2013September 1993.","journal-title":"American Mathematical Monthly"},{"key":"3_CR11","series-title":"volume 736 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-57318-6_25","volume-title":"Hybrid Systems","author":"L. Lamport","year":"1993","unstructured":"Leslie Lamport. Hybrid systems in TLA+. In Robert L. Grossman, Anil Nerode, Anders P. Ravn, and Hans Rischel, editors, Hybrid Systems, volume 736 of Lecture Notes in Computer Science, pages 77\u2013102, Berlin, Heidelberg, 1993. Springer-Verlag."},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1145\/177492.177726","volume":"16","author":"L. Lamport","year":"1994","unstructured":"Leslie Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872\u2013923, May 1994.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"9","key":"3_CR13","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1109\/32.464544","volume":"21","author":"L. Lamport","year":"1995","unstructured":"Leslie Lamport. TLA in pictures. IEEE Transactions on Software Engineering, 21(9):768\u2013775, September 1995.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Leslie Lamport and Stephan Merz. Specifying and verifying fault-tolerant systems. In H. Langmaack, W.-P. de Roever, and J. Vytopil, editors, Formal Techniques in Real-Time and Fault-Tolerant Systems, volume 863 of Lecture Notes in Computer Science, pages 41\u201376. Springer-Verlag, September 1994.","DOI":"10.1007\/3-540-58468-4_159"},{"key":"3_CR15","volume-title":"Mathematical Logic and Hilbert's \u03b5-Symbol","author":"A. C. Leisenring","year":"1969","unstructured":"A. C. Leisenring. Mathematical Logic and Hilbert's \u03b5-Symbol. Gordon and Breach, New York, 1969."},{"key":"3_CR16","volume-title":"Introduction to VLSI Systems","author":"C. Mead","year":"1980","unstructured":"Carver Mead and Lynn Conway. Introduction to VLSI Systems, chapter 7. Addison-Wesley, Reading, Massachusetts, 1980."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Amir Pnueli. The temporal semantics of concurrent programs. In Gilles Kahn, editor, Semantics of Concurrent Computation, volume 70 of Lecture Notes in Computer Science, pages 1\u201320. Springer-Verlag, July 1979.","DOI":"10.1007\/BFb0022460"}],"container-title":["Lecture Notes in Computer Science","Formal Systems Specification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024426","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T16:25:39Z","timestamp":1549297539000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024426"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540619840","9783540495734"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0024426","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0024423","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}