{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:36Z","timestamp":1760202516677,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":3,"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\/bfb0025770","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T05:23:41Z","timestamp":1132377821000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Proof rules dealing with fairness"],"prefix":"10.1007","author":[{"given":"Krzysztof R.","family":"Apt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ernst-R\u00fcdiger","family":"Olderog","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"APT, K.R. & G.D. PLOTKIN, A Cook's Tour of countable nondeterminism, Technical Report, Department of Computer Science, University of Edinburgh, 1980 (to appear in Proc. ICALP 81).","DOI":"10.7146\/dpb.v10i133.18448"},{"key":"1_CR2","unstructured":"COUSOT, P., Asynchronous iterative methods for solving a fixed point system of monotone equations in a complete lattice, Rapport de Recherche No 88, L.A.7, Universit\u00e9 Scientifique et Medicale de Grenoble, 1977."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"EMERSON, E.A. & E.M. CLARKE, Characterizing correctness properties of parallel programs using fixpoints, in: Proc. ICALP 80, Lecture Notes in Computer Science 85, Springer Verlag, pp. 169\u2013181, 1980.","DOI":"10.1007\/3-540-10003-2_69"}],"container-title":["Lecture Notes in Computer Science","Logics of Programs"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0025770","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:35:34Z","timestamp":1578526534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0025770"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1982]]},"ISBN":["9783540112129","9783540390473"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/bfb0025770","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"}}]}}