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
A theoretical basis for stepwise refinement and the programming calculus
Science of Computer Programming
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
Information Processing Letters - Special issue on the calculational method
Embedding a demonic semilattice in a relation algebra
Theoretical Computer Science
Theoretical Computer Science
A relational basis for program construction by parts
A relational basis for program construction by parts
Algebraic approaches to nondeterminism—an overview
ACM Computing Surveys (CSUR)
Algebra of programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Relational semantics for locally nondeterministic programs
New Generation Computing
Relational methods in computer science
Relational methods in computer science
Predicative programming Part I
Communications of the ACM
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 Calculus for Predicative Programming
Proceedings of the Second International Conference on Mathematics of Program Construction
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Least Reflexive Points of Relations
Higher-Order and Symbolic Computation
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
We deal with a relational model for the demonic semantics of programs. The demonic semantics of a while loop is given as a fixed point of a function involving the demonic operators. This motivates us to investigate the fixed points of these functions. We give the expression of the greatest fixed point with respect to the demonic ordering (demonic inclusion) of the semantic function. We prove that this greatest fixed coincides with the least fixed point with respect to the usual ordering (angelic inclusion) of the same function. This is followed by an example of application.