Relational algebraic semantics of deterministic and nondeterministic programs
Theoretical Computer Science
Relational heuristics for the design of deterministic programs
Acta Informatica
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
ACM Transactions on Programming Languages and Systems (TOPLAS)
Predicative semantics of loops
Proceedings of the IFIP TC 2 WG 2.1 international workshop on Algorithmic languages and calculi
Relational methods in computer science
Relational methods in computer science
The new math of computer programming
Communications of the ACM
Princples of Computer Programming
Princples of Computer Programming
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
Dynamic Logic
A Calculus for Predicative Programming
Proceedings of the Second International Conference on Mathematics of Program Construction
Applying a Generalization of a Theorem of Mills to Generalized Looping Structures
SESD '99 Proceedings of the Science and Engineering for Software Development: A Recognition of Harlan D. Mills' Legacy
NN'10/EC'10/FS'10 Proceedings of the 11th WSEAS international conference on nural networks and 11th WSEAS international conference on evolutionary computing and 11th WSEAS international conference on Fuzzy systems
WSEAS Transactions on Mathematics
From operational to denotational demonic semantics of nondeterministic while loops
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
| Hi-index | 0.00 |
In relational semantics, the input-output semantics of a program is a relation on its set of states. We generalize this in considering elements of Kleene algebras as semantical values. In a nondeterministic context, the demonic semantics is calculated by considering the worst behavior of the program. In this paper, we concentrate on while loops. Calculating the semantics of a loop is diffcult, but showing the correctness of any candidate abstraction is much easier. For deterministic programs, Mills has described a checking method known as the while statement verification rule. A corresponding programming theorem for nondeterministic iterative constructs is proposed, proved and applied to an example. This theorem can be considered as a generalization of the while statement verification rule to nondeterministic loops.