{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:06:08Z","timestamp":1794341168739,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540648963","type":"print"},{"value":"9783540684558","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055631","type":"book-chapter","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T03:31:00Z","timestamp":1153971060000},"page":"317-331","source":"Crossref","is-referenced-by-count":28,"title":["Reduction in TLA"],"prefix":"10.1007","author":[{"given":"Ernie","family":"Cohen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leslie","family":"Lamport","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,5,28]]},"reference":[{"issue":"2","key":"20_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":"4","key":"20_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0020-0190(85)90056-0","volume":"21","author":"B. Alpern","year":"1985","unstructured":"Bowen Alpern and Fred B. Schneider. Defining liveness. Information Processing Letters, 21(4):181\u2013185, October 1985.","journal-title":"Information Processing Letters"},{"key":"20_CR3","unstructured":"R. J. R. Back. Refining atomicity in parallel algorithms. Reports on Computer Science and Mathematics Ser. A, No 57, Swedish University of \u00e5bo, February 1988."},{"key":"20_CR4","unstructured":"Ernie Cohen. Compositional Proofs of Asynchronous Programs. PhD thesis, University of Texas at Austin, May 1993."},{"key":"20_CR5","unstructured":"Ernie Cohen. A guide to reduction. Technical Report TM-ARH-023816, Bellcore, 1993. Available from the author at ernie@bellcore.com."},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Thomas W. Doeppner, Jr. Parallel program correctness through refinement. In Fourth Annual ACM Symposium on Principles of Programming Languages, pages 155\u2013169. ACM, January 1977.","DOI":"10.1145\/512950.512965"},{"issue":"5","key":"20_CR7","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0020-0190(87)90207-9","volume":"25","author":"D. Gries","year":"1987","unstructured":"David Gries and Ivan Stojmenovi\u0107. A note on Graham's convex hull algorithm. Information Processing Letters, 25(5):323\u2013327, July 1987.","journal-title":"Information Processing Letters"},{"issue":"3","key":"20_CR8","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"},{"key":"20_CR9","unstructured":"Leslie Lamport and Fred B. Schneider. Pretending atomicity. Research Report 44, Digital Equipment Corporation, Systems Research Center, May 1989."},{"issue":"12","key":"20_CR10","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1145\/361227.361234","volume":"18","author":"R. J. Lipton","year":"1975","unstructured":"Richard J. Lipton. Reduction: A method of proving properties of parallel programs. Communications of the ACM, 18(12):717\u2013721, December 1975.","journal-title":"Communications of the ACM"},{"issue":"4","key":"20_CR11","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. Owicki","year":"1976","unstructured":"S. Owicki and D. Gries. An axiomatic proof technique for parallel programs I. Acta Informatica, 6(4):319\u2013340, 1976.","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","CONCUR'98 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055631","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T06:22:02Z","timestamp":1549866122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055631"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648963","9783540684558"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0055631","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0055611","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}