Commutation, transformation, and termination
Proc. of the 8th international conference on Automated deduction
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
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)
Modal logic
Dynamic Logic
Journal of Automated Reasoning
Calculating Church-Rosser Proofs in Kleene Algebra
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
Encoding two-valued nonclassical logics in classical logic
Handbook of automated reasoning
Mathematical Structures in Computer Science
Algebras of modal operators and partial correctness
Theoretical Computer Science - Algebraic methodology and software technology
ACM Transactions on Computational Logic (TOCL)
Diagram Chase in Relational System Development
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Circulations, Fuzzy Relations and Semirings
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
MPC '08 Proceedings of the 9th international conference on Mathematics of Program Construction
Logic-Based Program Synthesis and Transformation
Towards Algebraic Separation Logic
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
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
Determination of α-resolution in lattice-valued first-order logic LF(X)
Information Sciences: an International Journal
An algebra of product families
Software and Systems Modeling (SoSyM)
Dynamic epistemic algebra with post-conditions to reason about robot navigation
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
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
Using bisimulations for optimality problems in model refinement
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Towards an algebra of routing tables
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
Deciding regular expressions (in-)equivalence in coq
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 |
It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. We demonstrate that off-the-shelf automated proof and counterexample search is an interesting alternative if combined with the right domain model. We implement variants of Kleene algebras axiomatically in Prover9/Mace4 and perform proof experiments about Hoare, dynamic, temporal logics, concurrency control and termination analysis. They confirm that a simple automated analysis of some important program properties is possible. Particular benefits of this approach include "soft" model checking in a first-order setting, cross-theory reasoning between standard formalisms and full automation of some (co)inductive arguments. Kleene algebras might therefore provide light-weight formal methods with heavy-weight automation.