{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:16:00Z","timestamp":1761610560261,"version":"build-2065373602"},"reference-count":19,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2009,8,1]],"date-time":"2009-08-01T00:00:00Z","timestamp":1249084800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2009,8,1]],"date-time":"2009-08-01T00:00:00Z","timestamp":1249084800000},"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":1458,"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":[[2009,8]]},"DOI":"10.1016\/j.entcs.2009.07.072","type":"journal-article","created":{"date-parts":[[2009,8,11]],"date-time":"2009-08-11T03:24:53Z","timestamp":1249961093000},"page":"27-47","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Relational Semantics Revisited"],"prefix":"10.1016","volume":"229","author":[{"given":"Eike","family":"Best","sequence":"first","affiliation":[]},{"given":"Kerstin","family":"Strecker","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.entcs.2009.07.072_bib001","series-title":"Proc. Working Conference on Formal Description of Programming Concepts","article-title":"Recursive Programs as Predicate Transformers","author":"de Bakker","year":"1977"},{"year":"1980","series-title":"Mathematical Theory of Program Correctness","author":"de Bakker","key":"10.1016\/j.entcs.2009.07.072_bib002"},{"article-title":"Semantik von Programmiersprachen","year":"1996","author":"Berghammer","key":"10.1016\/j.entcs.2009.07.072_bib003"},{"key":"10.1016\/j.entcs.2009.07.072_bib004","doi-asserted-by":"crossref","unstructured":"R. Berghammer, B. v. Karger: Relational Semantics of Functional Programs. Chapter 8, pages 115\u2013130, of [7]","DOI":"10.1007\/978-3-7091-6510-2_8"},{"key":"10.1016\/j.entcs.2009.07.072_bib005","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0304-3975(86)90172-6","article-title":"Relational Algebraic Semantics of Deterministic and Nondeterministic Programs","volume":"43","author":"Berghammer","year":"1986","journal-title":"Theoretical Computer Science"},{"year":"1996","series-title":"Semantics of Sequential and Parallel Programs","author":"Best","key":"10.1016\/j.entcs.2009.07.072_bib006"},{"year":"1996","series-title":"Relational Methods in Computer Science","key":"10.1016\/j.entcs.2009.07.072_bib007"},{"key":"10.1016\/j.entcs.2009.07.072_bib008","doi-asserted-by":"crossref","unstructured":"J. Desharnais, A. Mili, T.T. Nguyen: Refinement and Demonic Semantics. Chapter 11, pages 166\u2013183, of [7]","DOI":"10.1007\/978-3-7091-6510-2_11"},{"year":"1976","series-title":"A Discipline of Programming","author":"Dijkstra","key":"10.1016\/j.entcs.2009.07.072_bib009"},{"key":"10.1016\/j.entcs.2009.07.072_bib010","series-title":"Proc. ProCoMet'94","first-page":"363","article-title":"A Relational Model of Programs Without the Restriction to Egli-Milner Monotone Constructs","volume":"A-56","author":"Doornbos","year":"1994"},{"key":"10.1016\/j.entcs.2009.07.072_bib011","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0304-3975(96)88664-6","article-title":"A Relation Algebraic Model of Robust Correctness","volume":"159","author":"Gritzner","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2009.07.072_bib012","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0304-3975(88)90142-9","article-title":"Interpretations of Recursion under Unbounded Nondeterminacy","volume":"59","author":"Hesselink","year":"1988","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2009.07.072_bib013","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An Axiomatic Basis for Computer Programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Communications of the ACM"},{"key":"10.1016\/j.entcs.2009.07.072_bib014","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(95)00082-8","article-title":"Relation-algebraic Semantics","volume":"160","author":"Maddux","year":"1996","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/j.entcs.2009.07.072_bib015","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1142\/S012905419100008X","article-title":"A Relational Model of Demonic Nondeterministic Programs","volume":"2","author":"Nguyen","year":"1991","journal-title":"Intern. J. Found. of Comp. Sci."},{"key":"10.1016\/j.entcs.2009.07.072_bib016","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0205035","article-title":"A Powerdomain Construction","volume":"5","author":"Plotkin","year":"1967","journal-title":"SIAM J. Comp."},{"key":"10.1016\/j.entcs.2009.07.072_bib017","unstructured":"K.M. Richter: Denotationale Formulierungen f\u00fcr relationale Semantiken. Diplomarbeit, Universit\u00e4t Hildesheim (1998)"},{"key":"10.1016\/j.entcs.2009.07.072_bib018","unstructured":"D. Schmidt: Denotational Semantics: a Methodology for Language Development. Allyn and Bacon (1986)"},{"key":"10.1016\/j.entcs.2009.07.072_bib019","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3054.001.0001","article-title":"The Formal Semantics of Programming Languages","author":"Winskel","year":"1993"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066109002941?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066109002941?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:11:04Z","timestamp":1761610264000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066109002941"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,8]]}},"alternative-id":["S1571066109002941"],"URL":"https:\/\/doi.org\/10.1016\/j.entcs.2009.07.072","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2009,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Relational Semantics Revisited","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.entcs.2009.07.072","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2009 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}