{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:19:57Z","timestamp":1725455997460},"publisher-location":"Berlin\/Heidelberg","reference-count":9,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354058241X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0013978","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T02:34:32Z","timestamp":1132713272000},"page":"17-29","source":"Crossref","is-referenced-by-count":1,"title":["Global equivalence proofs for ISTL"],"prefix":"10.1007","author":[{"given":"Shmuel","family":"Katz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1145\/151646.151651","volume":"15","author":"Y. Afek","year":"1993","unstructured":"Y. Afek, G. Brown, and M. Merritt. Lazy caching. Transactions of Programming Languages, 15(1):182\u2013206, 1993.","journal-title":"Transactions of Programming Languages"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/4904.4999","volume":"33","author":"E.A. Emerson","year":"1986","unstructured":"E.A. Emerson and J.Y. Halpern. Sometimes and not never revisited: on branching versus linear time temporal logic. Journal of the ACM, 33:151\u2013178, 1986.","journal-title":"Journal of the ACM"},{"key":"2_CR3","unstructured":"R. Gerth(editor). Verifying sequentially consistent memory. Technical report, Esprit React report, 1993."},{"key":"2_CR4","unstructured":"W. Janssen and J. Zwiers. Specifying and proving communication closedness in protocols. In Proceedings 13th IFIP symp. on Protocol Specification, Testing and Verification, 1993."},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0304-3975(90)90096-Z","volume":"75","author":"S. Katz","year":"1990","unstructured":"S. Katz and D. Peled. Interleaving set temporal logic. Theoretical Computer Science, 75:263\u2013287, 1990.","journal-title":"Theoretical Computer Science"},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/0304-3975(92)90054-J","volume":"101","author":"S. Katz","year":"1992","unstructured":"S. Katz and D. Peled. Defining conditional independence using collapses. Theoretical Computer Science, 101:337\u2013359, 1992.","journal-title":"Theoretical Computer Science"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02252682","volume":"6","author":"S. Katz","year":"1992","unstructured":"S. Katz and D. Peled. Verification of distributed programs using representative interleaving sequences. Distributed Computing, 6:107\u2013120, 1992.","journal-title":"Distributed Computing"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"L. Lamport. The temporal logic of actions. ACM Transactions on Programming Languages and Systems. to appear.","DOI":"10.1145\/177492.177726"},{"key":"2_CR9","unstructured":"M. Poel and J. Zwiers. Modular completeness for communication closed layers. In Proceedings CONCUR'93, 1993."}],"container-title":["Lecture Notes in Computer Science","Temporal Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0013978.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T10:08:20Z","timestamp":1607335700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0013978"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354058241X"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0013978","relation":{},"subject":[]}}