Automated engineering of relational and algebraic methods in isabelle/hol

Authors:
Simon Foster;Georg Struth;Tjark Weber
Affiliations:
Department of Computer Science, The University of Sheffield;Department of Computer Science, The University of Sheffield;Computer Laboratory, University of Cambridge
Venue:
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Year:
2011

Citing 23
Cited 6

Kleene algebra with tests

ACM Transactions on Programming Languages and Systems (TOPLAS)
Ordered chaining calculi for first-order theories of transitive relations

Journal of the ACM (JACM)
Calculational Reasoning Revisited (An Isabelle/Isar Experience)

TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics
Separation and Reduction

MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Isabelle: The Next Seven Hundred Theorem Provers

Proceedings of the 9th International Conference on Automated Deduction
RALL: Machine-Supported Proofs for Relation Algebra

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Interactive Theorem Proving and Program Development

Interactive Theorem Proving and Program Development
Towards a refinement algebra

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
Kleene algebra with domain

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
Domain and Antidomain Semigroups

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
seL4: formal verification of an operating-system kernel

Communications of the ACM
Isabelle/HOL: a proof assistant for higher-order logic

Isabelle/HOL: a proof assistant for higher-order logic
On automated program construction and verification

MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Internal axioms for domain semirings

Science of Computer Programming
Towards automated proof support for probabilistic distributed systems

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Sledgehammer: judgement day

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Nitpick: a counterexample generator for higher-order logic based on a relational model finder

ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Fast LCF-Style proof reconstruction for z3

ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Proof Pearl: Regular Expression Equivalence and Relation Algebra

Journal of Automated Reasoning

Building structured theories

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
A graph calculus for proving intuitionistic relation algebraic equations

Diagrams'12 Proceedings of the 7th international conference on Diagrammatic Representation and Inference
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new integration of relational and algebraic methods in the Isabelle/HOL theorem proving environment. It consists of a fine grained hierarchy of algebraic structures based on Isabelle's type classes and locales, and a repository of more than 800 facts obtained by automated theorem proving. We demonstrate further benefits of Isabelle for hypothesis learning, duality reasoning, theorem instantiation, and reasoning across models and theories. Our work forms the basis for a reference repository and a program development environment based on algebraic methods. It can also be used by mathematicians for exploring and integrating new variants.