{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:16:50Z","timestamp":1725664610386},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540630104"},{"type":"electronic","value":"9783540690580"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63010-4_19","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:58:21Z","timestamp":1330279101000},"page":"280-294","source":"Crossref","is-referenced-by-count":1,"title":["Verification and refinement of distributed programs in a fair framework"],"prefix":"10.1007","author":[{"given":"Luis A.","family":"Gal\u00e1n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Pe\u00f1a","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"K. R. Apt and E.-R. Olderog. Verification of Sequential and Concurrent Programs. Springer-Verlag, 1991.","DOI":"10.1007\/978-1-4757-4376-0"},{"key":"19_CR2","volume-title":"Parallel Program Design: A Foundation","author":"K. M. Chandy","year":"1988","unstructured":"K. M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison Wesley, Reading, Massachusetts, 1988."},{"key":"19_CR3","unstructured":"K.M. Chandy and J. Misra. Proof of Distributed Algorithms: An Exercise. In C.A.R. Hoare, editor, Development in Concurrency and Communication, pages 305\u2013332. Addison Wesley, 1990."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"N. Francez. Fairness. Springer-Verlag, 1986.","DOI":"10.1007\/978-1-4612-4886-6"},{"key":"19_CR5","unstructured":"N. Francez. Program Verification. Addison-Wesley, 1992."},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"L.A. Gal\u00e1n and R. Pe\u00f1a. Verification and Refinement of Distributed Programs in a Fair Framework. Technical Report DIA-UCM 97\/47, Universidad Complutense de Madrid, 1997.","DOI":"10.1007\/3-540-63010-4_19"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"C. A. R. Hoare","year":"1978","unstructured":"C. A. R. Hoare. Communicating Sequential Processes. Comm. ACM, 21:666\u2013677, 1978.","journal-title":"Comm. ACM"},{"issue":"2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/TSE.1977.229904","volume":"SE-3","author":"L. Lamport","year":"1977","unstructured":"L. Lamport. Proving the Correctness of Multiprocess Programs. IEEE Trans. on Software Engineering, SE-3(2): 125\u2013143, March 1977.","journal-title":"IEEE Trans. on Software Engineering"},{"issue":"3","key":"19_CR9","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1145\/44501.44504","volume":"10","author":"E.-R. Olderog","year":"1988","unstructured":"E.-R. Olderog and K. R. Apt. Fairness in Parallel Programs, the Transformational Approach. ACM Transactions on Programming Languages, 10(3):420\u2013455, July 1988.","journal-title":"ACM Transactions on Programming Languages"},{"issue":"3","key":"19_CR10","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1145\/357172.357178","volume":"4","author":"S. S. Owicki","year":"1982","unstructured":"S. S. Owicki and L. Lamport. Proving Liveness Properties of Concurrent Programs. ACM TOPLAS, 4(3):455\u2013495, July 1982.","journal-title":"ACM TOPLAS"},{"key":"19_CR11","volume-title":"Ph.D. thesis","author":"J. Parrow","year":"1986","unstructured":"J. Parrow. Fairness Properties in Process Algebra. Ph.D. thesis. Department of Computer Science, Uppsala University, Sweden, 1986."},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"A. Pnueli. The Temporal Logic of Programs. In 18th Symp. on the Foundations of Computer Science, pages 46\u201347, November 1977.","DOI":"10.1109\/SFCS.1977.32"}],"container-title":["Lecture Notes in Computer Science","Transformation-Based Reactive Systems Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63010-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T10:37:24Z","timestamp":1561372644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63010-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540630104","9783540690580"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-63010-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}