The logic of programming
Countable nondeterminism and random assignment
Journal of the ACM (JACM)
A theoretical basis for stepwise refinement and the programming calculus
Science of Computer Programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
A calculus of refinements for program derivations
Acta Informatica
A generalization of Dijkstra's calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Data refinement by calculation
Acta Informatica
Data refinement of predicate transformers
Theoretical Computer Science
Semantics of programming languages: structures and techniques
Semantics of programming languages: structures and techniques
Programming from specifications (2nd ed.)
Programming from specifications (2nd ed.)
An algebraic construction of predicate transformers
Science of Computer Programming - Special issue on mathematics of program construction
The cuppest capjunctive capping, and Galois
A classical mind
Algebraic proofs of consistency and completeness
Theoretical Computer Science
Predicate transformer semantics of a higher-order imperative language with record subtyping
Science of Computer Programming
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
A Discipline of Programming
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
On the Refinement Calculus
Isomorphisms between Predicates and State Transformers
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
A Cook's Tour of Countable Nondeterminism
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Power Domains and Predicate Transformers: A Topological View
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Dijkstras Predicate Transformers & Smyth's Power Domaine
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
A categorical model for higher order imperative programming
Mathematical Structures in Computer Science
A Semantic Basis for Local Reasoning
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
Refinement calculi for imperative programs provide an integrated framework for programs and specifications and allow one to develop programs from specifications in a systematic fashion. The semantics of these calculi has traditionally been defined in terms of predicate transformers and poses several challenges in defining a state transformer semantics in the denotational style. We define a novel semantics in terms of sets of state transformers and prove it to be isomorphic to positively multiplicative predicate transformers. This semantics disagrees with the traditional semantics in some places and the consequences of the disagreement are analyzed.