Complete systems of B -rational identities
Theoretical Computer Science
Regular expressions into finite automata
Theoretical Computer Science
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in 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)
Programming Techniques: Regular expression search algorithm
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Introduction to Algorithms
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
Kleene Algebra with Tests: Completeness and Decidability
CSL '96 Selected Papers from the10th International Workshop on Computer Science Logic
RALL: Machine-Supported Proofs for Relation Algebra
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The Complexity of Kleene Algebra with Tests
The Complexity of Kleene Algebra with Tests
Information and Computation
A persistent union-find data structure
ML '07 Proceedings of the 2007 workshop on Workshop on ML
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
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Packaging Mathematical Structures
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Finite automata and their decision problems
IBM Journal of Research and Development
A Formally Verified Compiler Back-end
Journal of Automated Reasoning
A modular formalisation of finite group theory
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Proving equalities in a commutative ring done right in coq
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Untyping typed algebraic structures and colouring proof nets of cyclic linear logic
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
On probabilistic kleene algebras, automata and simulations
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
PLPV '12 Proceedings of the sixth workshop on Programming languages meets program verification
A decision procedure for regular expression equivalence in type theory
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Proof Pearl: Regular Expression Equivalence and Relation Algebra
Journal of Automated Reasoning
Automated analysis of regular algebra
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Automated reasoning in higher-order regular algebra
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
Deciding regular expressions (in-)equivalence in coq
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
Verified decision procedures for MSO on words based on derivatives of regular expressions
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
Coq: the world's best macro assembler?
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Kleene algebra with tests and coq tools for while programs
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
| Hi-index | 0.00 |
We present a reflexive tactic for deciding the equational theory of Kleene algebras in the Coq proof assistant. This tactic relies on a careful implementation of efficient finite automata algorithms, so that it solves casual equations almost instantaneously. The corresponding decision procedure was proved correct and complete; correctness is established w.r.t. any model (including binary relations), by formalising Kozen's initiality theorem.