{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:21:51Z","timestamp":1725456111577},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540112129"},{"type":"electronic","value":"9783540390473"}],"license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1982]]},"DOI":"10.1007\/bfb0025777","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T05:23:41Z","timestamp":1132377821000},"page":"113-121","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A formalism for reasoning about fair termination"],"prefix":"10.1007","author":[{"given":"Willem P.","family":"de Roever","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"unstructured":"[Apt & Plotkin]: A Cook's tour of countable nondeterminism, proc. ICALP VIII, LNCS 115, 1981.","key":"8_CR1"},{"unstructured":"[de Bakker]: Mathematical Foundations of Program Correctness, Prentice-Hall, 1980.","key":"8_CR2"},{"unstructured":"[de Bakker & de Roever]: A calculus for recursive program schemes, proc. ICALP I, North-Holland, 1973.","key":"8_CR3"},{"unstructured":"[Floyd]: Assigning meaning to programs, J.T. Schwartz (ed.), Math. Aspects of Computer Science, 1967.","key":"8_CR4"},{"doi-asserted-by":"crossref","unstructured":"[Francez & Pnueli]: A proof method for cyclic programs, Acta Informatica 9, 1978.","key":"8_CR5","DOI":"10.1007\/BF00289074"},{"unstructured":"[Gr\u00fcmberg, Francez, Makowski & de Roever]: A proof rule for fair termination of guarded commands, Proc. Symposium on Algorithmic Languages, Amsterdam, 1981, North-Holland.","key":"8_CR6"},{"unstructured":"[Hitchcock & Park]: Induction rules and termination, proc. ICALP I, North-Holland, 1973.","key":"8_CR7"},{"doi-asserted-by":"crossref","unstructured":"[Lamport]: Proving the correctness of multiprocess programs, IEEE-TSE 3, 2, 1977.","key":"8_CR8","DOI":"10.1109\/TSE.1977.229904"},{"unstructured":"[Lamport & Owicki]: Proving liveness properties of concurrent programs, SRI-TR, 1980.","key":"8_CR9"},{"unstructured":"[Park 80]: On the semantics of fair parallellism, LNCS 86, 1980.","key":"8_CR10"},{"unstructured":"[Park 81]: A predicate transformer for weak fair iteration, proc. 6th IBM Symposium on Math. Found. of Computer Science, Hakone, Japan, 1981.","key":"8_CR11"},{"doi-asserted-by":"crossref","unstructured":"[Pnueli]: The temporal semantics of concurrent programs, TCS, 13, 1, 1981.","key":"8_CR12","DOI":"10.1016\/0304-3975(81)90110-9"},{"unstructured":"[Pnueli, Stavi & Lehmann]: Impartiality, Justice and Fairness: The Ethics of Concurrent Termination, proc. ICALP VIII, LNCS 115, 1981.","key":"8_CR13"}],"container-title":["Lecture Notes in Computer Science","Logics of Programs"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0025777","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:50:25Z","timestamp":1578527425000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0025777"}},"subtitle":["extended abstract"],"short-title":[],"issued":{"date-parts":[[1982]]},"ISBN":["9783540112129","9783540390473"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0025777","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1982]]},"assertion":[{"value":"9 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}