A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
Lisp and Symbolic Computation - Special issue on state in programming languages (part I)
A relation algebraic model of robust correctness
Theoretical Computer Science
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theories of Programming: Top-Down and Bottom-Up and Meeting in the Middle
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
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)
Science of Computer Programming
Partial, total and general correctness
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Unifying theories of programming that distinguish nontermination and abort
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Internal axioms for domain semirings
Science of Computer Programming
Unifying recursion in partial, total and general correctness
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
Algebras for iteration and infinite computations
Acta Informatica
Unifying correctness statements
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
| Hi-index | 0.00 |
Non-strict sequential computations describe imperative programs that can be executed lazily and support infinite data structures. Based on a relational model of such computations we investigate their algebraic properties. We show that they share many laws with conventional, strict computations. We develop a common theory generalising previous algebraic descriptions of strict computation models including partial, total and general correctness and extensions thereof. Due to non-strictness, the iteration underlying loops cannot be described by a unary operation. We propose axioms that generalise the binary operation known from omega algebra, and derive properties of this new operation which hold for both strict and non-strict computations. All algebraic results are verified in Isabelle using its integrated automated theorem provers.