{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:34:35Z","timestamp":1725510875973},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"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":["Form. Asp. Comput."],"published-print":{"date-parts":[[1995,3]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>\n            In predicate transformer semantics, a program is represented as a mapping from predicates to predicates. In relational semantics, a program is represented as an (input-output) binary relation over some state space. We show how each of these approaches can be obtained from the other by using the\n            <jats:italic>power construction<\/jats:italic>\n            .\n          <\/jats:p>","DOI":"10.1007\/bf01211604","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T19:41:40Z","timestamp":1109360500000},"page":"169-182","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Predicate transformers as power operations"],"prefix":"10.1145","volume":"7","author":[{"given":"I.","family":"Rewitzky","sequence":"first","affiliation":[{"name":"Laboratory for Formal Aspects and Complexity in Computer Science, Department of Mathematics, University of Cape Town, 7700, Rondebosch, South Africa"}]},{"given":"C.","family":"Brink","sequence":"additional","affiliation":[{"name":"Laboratory for Formal Aspects and Complexity in Computer Science, Department of Mathematics, University of Cape Town, 7700, Rondebosch, South Africa"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_1_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90005-2"},{"key":"e_1_2_1_2_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00291051"},{"key":"e_1_2_1_2_3_2","volume-title":"Proceedings of the 1989 REX Workshop for Refinement of Distributed Systems","author":"Back R. J. R.","year":"1989"},{"key":"e_1_2_1_2_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90309-4"},{"key":"e_1_2_1_2_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(93)90015-H"},{"key":"e_1_2_1_2_6_2","first-page":"165","volume-title":"Formal Descriptions of Programming Concepts","author":"de Bakker J. W.","year":"1978"},{"key":"e_1_2_1_2_7_2","volume-title":"Models and Ultraproducts","author":"Bell J. L.","year":"1971","edition":"2"},{"key":"e_1_2_1_2_8_2","first-page":"17","volume-title":"Mathematical Foundations of Computer Science","author":"Blikle A.","year":"1977"},{"key":"e_1_2_1_2_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00261259"},{"key":"e_1_2_1_2_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01196091"},{"key":"e_1_2_1_2_11_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8130-3"},{"key":"e_1_2_1_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/360933.360975"},{"key":"e_1_2_1_2_13_2","volume-title":"A Discipline of Programming","author":"Dijkstra E. W.","year":"1976"},{"key":"e_1_2_1_2_14_2","doi-asserted-by":"publisher","DOI":"10.5555\/77545"},{"key":"e_1_2_1_2_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(89)90032-8"},{"key":"e_1_2_1_2_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5983-1"},{"key":"e_1_2_1_2_17_2","doi-asserted-by":"publisher","DOI":"10.5555\/161182"},{"key":"e_1_2_1_2_18_2","first-page":"136","volume-title":"Proceedings of the 4th International Colloquium on Automata, Languages and Programming, Paris","author":"Guerreiro P.","year":"1980"},{"key":"e_1_2_1_2_19_2","first-page":"164","volume-title":"Lecture Notes in Computer Science, 137","author":"Guerreiro P.","year":"1982"},{"key":"e_1_2_1_2_20_2","volume-title":"Lecture Notes in Computer Science, 68","author":"Harel D.","year":"1979"},{"key":"e_1_2_1_2_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/363235.363259"},{"key":"e_1_2_1_2_22_2","doi-asserted-by":"publisher","DOI":"10.1145\/322077.322088"},{"key":"e_1_2_1_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/27651.27653"},{"key":"e_1_2_1_2_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264034"},{"key":"e_1_2_1_2_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00290146"},{"key":"e_1_2_1_2_26_2","doi-asserted-by":"publisher","DOI":"10.2307\/2372123"},{"key":"e_1_2_1_2_27_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(80)90048-4"},{"key":"e_1_2_1_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/69558.69559"},{"key":"e_1_2_1_2_29_2","doi-asserted-by":"publisher","DOI":"10.1142\/S012905419100008X"},{"key":"e_1_2_1_2_30_2","doi-asserted-by":"publisher","DOI":"10.1137\/0205035"},{"key":"e_1_2_1_2_31_2","doi-asserted-by":"crossref","unstructured":"Plotkin G. D.: Dijkstra's predicate transformers and Smyth's powerdomain In: Proceedings of Abstract Software Specifications Copenhagen Winter School G. Goos and J. Hartmanis (eds) Lecture Notes in Computer Science 86 Springer-Verlag: Berlin-Heidelberg-New York pp. 527\u2013553.","DOI":"10.1007\/3-540-10007-5_48"},{"key":"e_1_2_1_2_32_2","first-page":"472","volume-title":"Mathematical Foundations of Computer Science","author":"de Roever W. P.","year":"1976"},{"key":"e_1_2_1_2_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(78)90048-X"},{"key":"e_1_2_1_2_34_2","first-page":"662","volume-title":"Proceedings of IC ALP 10","author":"Smyth M. B.","year":"1983"},{"key":"e_1_2_1_2_35_2","first-page":"37","article-title":"The theory of representations for Boolean Algebras","volume":"40","author":"Stone M. H.","year":"1936","journal-title":"Transactions of the American Mathematical Society"},{"key":"e_1_2_1_2_36_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-6259-0_4"},{"key":"e_1_2_1_2_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(77)80006-8"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01211604.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01211604\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/BF01211604","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:21:55Z","timestamp":1641482515000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/BF01211604"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["10.1007\/BF01211604"],"URL":"https:\/\/doi.org\/10.1007\/bf01211604","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}