Predicate transformers as power operations-Reference-Cited by-同舟云学术

Predicate transformers as power operations

Published:1995-03 Issue:2 Volume:7 Page:169-182
ISSN:0934-5043
Container-title:Formal Aspects of Computing
language:en
Short-container-title:Form. Asp. Comput.

Author:

Rewitzky I.¹,Brink C.¹

Affiliation:

1. Laboratory for Formal Aspects and Complexity in Computer Science, Department of Mathematics, University of Cape Town, 7700, Rondebosch, South Africa

Abstract

Abstract 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 power construction .

Publisher

Association for Computing Machinery (ACM)

Subject

Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF01211604.pdf

Reference37 articles.

1. On correct refinement of programs

2. A calculus of refinements for program derivations

3. Combining angels, demons and miracles in program specifications

4. Statement inversion and strongest postcondition

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Tour Through the Programming Choices: Semantics and Applications;Lecture Notes in Computer Science;2024

2. Monotone Predicate Transformers as Up-Closed Multirelations;Relations and Kleene Algebra in Computer Science;2006

3. Binary Multirelations;Lecture Notes in Computer Science;2003

4. A Single Complete Refinement Rule for Demonic Specifications;Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics;2000

5. Unification of Four Versions of Program Semantics;Formal Aspects of Computing;1998-09