A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Journal of Automated Reasoning
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)
Automated theorem proving by resolution in non-classical logics
Annals of Mathematics and Artificial Intelligence
Modal Tools for Separation and Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Automated Reasoning in Kleene Algebra
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Domain Axioms for a Family of Near-Semirings
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Automated verification of refinement laws
Annals of Mathematics and Artificial Intelligence
The structure of the one-generated free domain semiring
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
Automated engineering of relational and algebraic methods in isabelle/hol
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Omega algebras and regular equations
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Automating algebraic methods in isabelle
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
Unifying correctness statements
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Unifying lazy and strict computations
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
Automated reasoning in higher-order regular algebra
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
Extended designs algebraically
Science of Computer Programming
Hi-index | 0.00 |
New axioms for domain operations on semirings and Kleene algebras are proposed. They generalise the relational notion of domain-the set of all states that are related to some other state-to a wide range of models. They are internal since the algebras of state spaces are induced by the domain axioms. They are simpler and conceptually more appealing than previous two-sorted external approaches in which the domain algebra is determined through typing. They lead to a simple and natural algebraic approach to modal logics based on equational reasoning. The axiomatisations have been developed in a new style of computer-enhanced mathematics by automated theorem proving, and the approach itself is suitable for automated systems analysis and verification. This is demonstrated by a fully automated proof of a modal correspondence result for Lob's formula that has applications in termination analysis.