Relational algebraic semantics of deterministic and nondeterministic programs
Theoretical Computer Science
Relations and graphs: discrete mathematics for computer scientists
Relations and graphs: discrete mathematics for computer scientists
Theoretical Computer Science
Algebra of programming
Ordered chaining calculi for first-order theories of transitive relations
Journal of the ACM (JACM)
Modal logic
Evaluating general purpose automated theorem proving systems
Artificial Intelligence
Journal of Automated Reasoning
Solution of the Robbins Problem
Journal of Automated Reasoning
RALL: Machine-Supported Proofs for Relation Algebra
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
System Description: ARA - An Automatic Theorem Prover for Relation Algebras
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Software Abstractions: Logic, Language, and Analysis
Software Abstractions: Logic, Language, and Analysis
System Description: Spass Version 3.0
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Data Refinement: Model-Oriented Proof Methods and their Comparison
Data Refinement: Model-Oriented Proof Methods and their Comparison
RelView: an OBDD-based computer algebra system for relations
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
On automated program construction and verification
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
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
Automating algebraic methods in isabelle
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
An efficient coq tactic for deciding kleene algebras
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
| Hi-index | 0.00 |
Relation algebras provide abstract equational axioms for the calculus of binary relations. They name an established area of mathematics and have found numerous applications in computing. We prove more than hundred theorems of relation algebras with off-the-shelf automated theorem provers. They form a basic calculus from which more advanced applications can be explored. We also present two automation experiments from the formal methods literature. Our results further demonstrate the feasibility of automated deduction with complex algebraic structures. They also open a new perspective for automated deduction in relational formal methods.