Relational algebraic semantics of deterministic and nondeterministic programs
Theoretical Computer Science
Relational heuristics for the design of deterministic programs
Acta Informatica
Communications of the ACM
Program derivation by fixed point computation
Science of Computer Programming
Combining angels, demons and miracles in program specifications
Theoretical Computer Science
Relations and graphs: discrete mathematics for computer scientists
Relations and graphs: discrete mathematics for computer scientists
A relational division operator: the conjugate kernel
Theoretical Computer Science
Information Processing Letters - Special issue on the calculational method
Embedding a demonic semilattice in a relation algebra
Theoretical Computer Science
Theoretical Computer Science
Algebraic approaches to nondeterminism—an overview
ACM Computing Surveys (CSUR)
Relational semantics for locally nondeterministic programs
New Generation Computing
A generalized control structure and its formal definition
Communications of the ACM
The new math of computer programming
Communications of the ACM
Princples of Computer Programming
Princples of Computer Programming
A Discipline of Programming
A Relational Model of Programs Without the Restriction to Egli-Milner-Monotone Constructs
PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
A Calculus for Predicative Programming
Proceedings of the Second International Conference on Mathematics of Program Construction
AMAST '00 Proceedings of the 8th International Conference on Algebraic Methodology and Software Technology
| Hi-index | 0.00 |
In this paper, we show that the operational semantics of a nondeterministic while loop give in previous paper is equal to the denotational one, which is given as the greatest fixed point of the semantic function Q ∨ P □ X in the demonic semilattices. As an intermediate result we give a generalization of the while statement verification rule of Mills.