Relational algebraic semantics of deterministic and nondeterministic programs
Theoretical Computer Science
A generalization of Dijkstra's calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Science of Computer Programming
Embedding a demonic semilattice in a relation algebra
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Verification of sequential and concurrent programs (2nd ed.)
Verification of sequential and concurrent programs (2nd ed.)
Refinement and demonic semantics
Relational methods in computer science
A generalized control structure and its formal definition
Communications of the ACM
Dynamic Logic
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
Semantics of Nondeterministic and Noncontinuous Constructs
Program Construction, International Summer Schoo
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
ACM Transactions on Computational Logic (TOCL)
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
Science of Computer Programming
Algebraic Structure of Web Services
Electronic Notes in Theoretical Computer Science (ENTCS)
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
On the structure of demonic refinement algebras with enabledness and termination
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Partial, total and general correctness
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Unifying recursion in partial, total and general correctness
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Towards an algebra of routing tables
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
UTP'06 Proceedings of the First international conference on Unifying Theories of Programming
Omega algebra, demonic refinement algebra and commands
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
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Unifying correctness statements
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Extended designs algebraically
Science of Computer Programming
Hi-index | 0.00 |
Using only a simple transition relation one cannot model commands that may or may not terminate in a given state. In a more general approach commands are relations enriched with termination vectors. We reconstruct this model in modal Kleene algebra. This links the recursive definition of the do od loop with a combination of the Kleene star and a convergence operator. Moreover, the standard wp operator coincides with the wlp operator in the modal Kleene algebra of commands. Therefore our earlier general soundness and relative completeness proof for Hoare logic in modal Kleene algebra can be re-used for wp. Although the definition of the loop semantics is motivated via the standard Egli-Milner ordering, the actual construction does not depend on Egli-Milner-isotony of the constructs involved.