{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:12:48Z","timestamp":1761610368877,"version":"build-2065373602"},"reference-count":12,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":6053,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1997]]},"DOI":"10.1016\/s1571-0661(05)80464-5","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"20-33","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Contracts, Games and Refinement"],"prefix":"10.1016","volume":"7","author":[{"given":"R.J.R.","family":"Back","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"J.","family":"von Wright","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80464-5_BIB1","doi-asserted-by":"crossref","unstructured":"M. Abadi, L. Lamport, and P. Wolper. Realizable and unrealizable specifications of reactive systems. In G. A. et al., editor, Proc. 16th ICALP, pages 1-17, Stresa, Italy, LNCS vol. 372, 1989, Springer-Verlag.","DOI":"10.1007\/BFb0035748"},{"key":"10.1016\/S1571-0661(05)80464-5_BIB2","series-title":"volume 131 of Mathematical Center Tracts.","article-title":"Correctness Preserving Program Refinements: Proof Theory and Applications","author":"Back","year":"1980"},{"key":"10.1016\/S1571-0661(05)80464-5_BIB3","unstructured":"R. J. R. Back. Changing data representation in the refinement calculus. In 21st Hawaii International Conference on System Sciences, January 1989."},{"key":"10.1016\/S1571-0661(05)80464-5_BIB4","series-title":"Springer-Verlag. to appear in","article-title":"Refinement Calculus: A Systematic Introduction","author":"Back","year":"1998"},{"key":"10.1016\/S1571-0661(05)80464-5_BIB5","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/BF00259469","article-title":"Duality in specification languages: a lattice-theoretical approach","volume":"27","author":"Back","year":"1990","journal-title":"Acta Informatica"},{"year":"1976","series-title":"A Discipline of Programming","author":"Dijkstra","key":"10.1016\/S1571-0661(05)80464-5_BIB6"},{"year":"1985","series-title":"Communicating Sequential Processes","author":"Hoare","key":"10.1016\/S1571-0661(05)80464-5_BIB7"},{"year":"1989","series-title":"Communication and Concurrency","author":"Milner","key":"10.1016\/S1571-0661(05)80464-5_BIB8"},{"key":"10.1016\/S1571-0661(05)80464-5_BIB9","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0020-0190(88)90147-0","article-title":"Data refinement by miracles","volume":"26","author":"Morgan","year":"1988","journal-title":"Information Processing Letters"},{"year":"1990","series-title":"Programming from Specifications","author":"Morgan","key":"10.1016\/S1571-0661(05)80464-5_BIB10"},{"key":"10.1016\/S1571-0661(05)80464-5_BIB11","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0167-6423(87)90011-6","article-title":"A theoretical basis for stepwise refinement and the programming calculus","volume":"9","author":"Morris","year":"1987","journal-title":"Science of Computer Programming"},{"key":"10.1016\/S1571-0661(05)80464-5_BIB12","series-title":"DAIMI FN 19, Computer Science Dept","article-title":"A structural approach to operational semantics","author":"Plotkin","year":"1981"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804645?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804645?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:06:54Z","timestamp":1761610014000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105804645"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":12,"alternative-id":["S1571066105804645"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80464-5","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Contracts, Games and Refinement","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80464-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}