General correctness: a unification of partial and total correctness
Acta Informatica
Relational algebraic semantics of deterministic and nondeterministic programs
Theoretical Computer Science
Communications of the ACM
Varieties of weakest liberal preconditions
Information Processing Letters
A theoretical basis for stepwise refinement and the programming calculus
Science of Computer Programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
A generalization of Dijkstra's calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
On Hoare logic and Kleene algebra with tests
ACM Transactions on Computational Logic (TOCL)
An axiomatic basis for computer programming
Communications of the ACM
First-Order Dynamic Logic
A Discipline of Programming
Semantics of Nondeterministic and Noncontinuous Constructs
Program Construction, International Summer Schoo
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Abstracto 84: The next generation
ACM '79 Proceedings of the 1979 annual conference
Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
Algebras of modal operators and partial correctness
Theoretical Computer Science - Algebraic methodology and software technology
ACM Transactions on Computational Logic (TOCL)
Science of Computer Programming
Verification of Sequential and Concurrent Programs
Verification of Sequential and Concurrent Programs
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
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
Reasoning about loops in total and general correctness
UTP'08 Proceedings of the 2nd international conference on Unifying theories of programming
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
Automating algebraic methods in isabelle
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
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
Recasting hoare and he's unifying theory of programs in the context of general correctness
IW-FM'01 Proceedings of the 5th Irish conference on Formal Methods
Unifying lazy and strict computations
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
| Hi-index | 0.00 |
Partial, total and general correctness and further models of sequential computations differ in their treatment of finite, infinite and aborting executions. Algebras structure this diversity of models to avoid the repeated development of similar theories and to clarify their range of application. We introduce algebras that uniformly describe correctness statements, correctness calculi, pre-post specifications and loop refinement rules in five kinds of computation models. This extends previous work that unifies iteration, recursion and program transformations for some of these models. Our new description includes a relativised domain operation, which ignores parts of a computation, and represents bound functions for claims of termination by sequences of tests. We verify all results in Isabelle heavily using its automated theorem provers.