Partial derivative automata formalized in Coq

Authors:
José Bacelar Almeida;Nelma Moreira;David Pereira;Simão Melo de Sousa
Affiliations:
CCTC & DI, University of Minho, Braga, Portugal;DCC-FC & LIACC, University of Porto, Porto, Portugal;DCC-FC & LIACC, University of Porto, Porto, Portugal;LIACC & DI, University of Beira Interior, Covilhã, Portugal
Venue:
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Year:
2010

Citing 9
Cited 6

A completeness theorem for Kleene algebras and the algebra of regular events

Papers presented at the IEEE symposium on Logic in computer science
Rewriting extended regular expressions

Theoretical Computer Science
Partial derivatives of regular expressions and finite automaton constructions

Theoretical Computer Science
Kleene algebra with tests

ACM Transactions on Programming Languages and Systems (TOPLAS)
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Derivatives of Regular Expressions

Journal of the ACM (JACM)
Interactive Theorem Proving and Program Development

Interactive Theorem Proving and Program Development
From Mirkin's Prebases to Antimirov's Word Partial Derivatives

Fundamenta Informaticae
On the average number of states of partial derivative automata

DLT'10 Proceedings of the 14th international conference on Developments in language theory

Reflexive toolbox for regular expression matching: verification of functional programs in Coq+Ssreflect

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
RockSalt: better, faster, stronger SFI for the x86

Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
Deciding regular expressions (in-)equivalence in coq

RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
Kleene algebra with tests and coq tools for while programs

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a computer assisted proof of the correctness of a partial derivative automata construction from a regular expression within the Coq proof assistant. This proof is part of a formalization of Kleene algebra and regular languages in Coq towards their usage in program certification.