Commutation, transformation, and termination
Proc. of the 8th international conference on Automated deduction
Communications of the ACM
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
Theoretical Computer Science
A calculational approach to mathematical induction
Theoretical Computer Science
On Hoare logic and Kleene algebra with tests
ACM Transactions on Computational Logic (TOCL)
A Discipline of Programming
Dynamic Logic
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Algebras of modal operators and partial correctness
Theoretical Computer Science - Algebraic methodology and software technology
ACM Transactions on Computational Logic (TOCL)
Automated Reasoning in Kleene Algebra
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
On Automating the Calculus of Relations
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Local Theory Specifications in Isabelle/Isar
Types for Proofs and Programs
Verification of Sequential and Concurrent Programs
Verification of Sequential and Concurrent Programs
Automated verification of refinement laws
Annals of Mathematics and Artificial Intelligence
Internal axioms for domain semirings
Science of Computer Programming
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
Extending Sledgehammer with SMT solvers
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Fast LCF-Style proof reconstruction for z3
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Automated analysis of regular algebra
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Unifying correctness statements
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Towards an algebra for real-time programs
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
On completeness of omega-regular algebras
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
Program analysis and verification based on kleene algebra in Isabelle/HOL
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
| Hi-index | 0.00 |
We implement a large Isabelle/HOL repository of algebras for application in modelling computing systems. They subsume computational logics such as dynamic and Hoare logics and form a basis for various software development methods. Isabelle has recently been extended by automated theorem provers and SMT solvers. We use these integrated tools for automatically proving several rather intricate refinement and termination theorems. We also automate a modal correspondence result and soundness and relative completeness proofs of propositional Hoare logic. These results show, for the first time, that Isabelle's tool integration makes automated algebraic reasoning particularly simple. This is a step towards increasing the automation of formal methods.