{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:12:55Z","timestamp":1725577975892},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540356318"},{"type":"electronic","value":"9783540356325"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11783596_11","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T14:35:02Z","timestamp":1151505302000},"page":"140-161","source":"Crossref","is-referenced-by-count":8,"title":["Progress in Deriving Concurrent Programs: Emphasizing the Role of Stable Guards"],"prefix":"10.1007","author":[{"given":"Brijesh","family":"Dongol","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arjan J.","family":"Mooij","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3126-2","volume-title":"On a Method of Multiprogramming","author":"W. Feijen","year":"1999","unstructured":"Feijen, W., van Gasteren, A.: On a Method of Multiprogramming. Springer, Heidelberg (1999)"},{"key":"11_CR2","volume-title":"A Discipline of Programming","author":"E. Dijkstra","year":"1976","unstructured":"Dijkstra, E.: A Discipline of Programming. Prentice Hall, Englewood Cliffs (1976)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"S. Owicki","year":"1976","unstructured":"Owicki, S., Gries, D.: An axiomatic proof technique for parallel programs I. Acta Inform.\u00a06, 319\u2013340 (1976)","journal-title":"Acta Inform."},{"issue":"1","key":"11_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2168\/LMCS-2(1:6)2006","volume":"2","author":"B. Dongol","year":"2006","unstructured":"Dongol, B., Goldson, D.: Extending the theory of Owicki and Gries with a logic of progress. Logical Methods in Comput. Sci.\u00a02(1), 1\u201325 (2006)","journal-title":"Logical Methods in Comput. Sci."},{"key":"11_CR5","volume-title":"Parallel Program Design: A Foundation","author":"K. Chandy","year":"1988","unstructured":"Chandy, K., Misra, J.: Parallel Program Design: A Foundation. Addison-Wesley Longman Publ. Co., Amsterdam (1988)"},{"key":"11_CR6","unstructured":"Goldson, D., Dongol, B.: Concurrent program design in the extended theory of Owicki and Gries. In: Proc. of 11th Computing, Australasian Theory Symp., CATS 2005. Confs. in Research and Practice in Inform. Techn., vol. 41, pp. 41\u201350. Australian Comput. Soc. (2005)"},{"key":"11_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0931-7","volume-title":"Temporal Verification of Reactive and Concurrent Systems: Specification","author":"Z. Manna","year":"1992","unstructured":"Manna, Z., Pnueli, P.: Temporal Verification of Reactive and Concurrent Systems: Specification. Springer, Heidelberg (1992)"},{"key":"11_CR8","unstructured":"Feijen, W.: A method for avoiding total deadlock, courtesy Diethard Michaelis. Personal note WF284 (2005)"},{"key":"11_CR9","unstructured":"Mooij, A.: Formal derivations of non-blocking multiprograms. Computer Science Report 02-13, Techn. Univ. Eindhoven, Master\u2019s Thesis under supervision of W.H.J.\u00a0Feijen (2002)"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1145\/72981.72999","volume-title":"Proc. of 8th Ann. ACM Symp. on Principles of Distributed Computing, PODC 1989","author":"C. Jutla","year":"1989","unstructured":"Jutla, C., Knapp, E., Rao, J.: A predicate transformer approach to semantics of parallel programs. In: Proc. of 8th Ann. ACM Symp. on Principles of Distributed Computing, PODC 1989, pp. 249\u2013263. ACM Press, New York (1989)"},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0020-0190(91)90229-B","volume":"38","author":"J. Misra","year":"1991","unstructured":"Misra, J.: Phase synchronization. Inform. Process. Lett.\u00a038(2), 101\u2013105 (1991)","journal-title":"Inform. Process. Lett."},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0020-0190(81)90106-X","volume":"12","author":"G. Peterson","year":"1981","unstructured":"Peterson, G.: Myths about the mutual exclusion problem. Inform. Process. Lett.\u00a012, 115\u2013116 (1981)","journal-title":"Inform. Process. Lett."},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0167-6423(97)00003-8","volume":"29","author":"F. Sommen van der","year":"1997","unstructured":"van der Sommen, F., Feijen, W., van Gasteren, A.: Peterson\u2019s mutual exclusion algorithm revisited. Sci. of Comput. Program\u00a029(3), 327\u2013334 (1997)","journal-title":"Sci. of Comput. Program"},{"key":"11_CR14","unstructured":"van der Sommen, F.: When mutual exclusion rules out overtaking. Personal note FvdS39 (2003)"}],"container-title":["Lecture Notes in Computer Science","Mathematics of Program Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11783596_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:07:47Z","timestamp":1605643667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11783596_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540356318","9783540356325"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11783596_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}