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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Antimirov, V.M., Mosses, P.D.: Rewriting extended regular expressions. Theor. Comput. Sci. 143(1), 51–72 (1995)
Almeida, M., Moreira, N., Reis, R.: Antimirov and Mosses’s rewrite system revisited. International Journal Of Foundations Of Computer Science 20(04), 669–684 (2009)
Almeida, M., Moreira, N., Reis, R.: Testing equivalence of regular languages. In: DCFS 2009, Magdeburg, Germany (2009)
Antimirov, V.M.: Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci. 155(2), 291–319 (1996)
Bertot, Y., Castéran, P.: Interactive Theorem Proving and Program Development. Texts in Theoretical Computer Science. Springer, Heidelberg (2004)
Broda, S., Machiavelo, A., Moreira, N., Reis, R.: On the average number of states of partial derivative automata. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 112–123. Springer, Heidelberg (2010)
Braibant, T., Pous, D.: A tactic for deciding Kleene algebras. In: First Coq Workshop (Available as a HAL report) (August 2009)
Briais, S.: Finite automata theory in Coq (2008), http://www.prism.uvsq.fr/~bris/tools/Automata_080708.tar.gz
Brzozowski, J.A.: Derivatives of regular expressions. JACM 11(4), 481–494 (1964)
Champarnaud, J.M., Ziadi, D.: From Mirkin’s prebases to Antimirov’s word partial derivatives. Fundam. Inform. 45(3), 195–205 (2001)
Filliâtre, J.-C.: Finite automata theory in Coq - a constructive proof of Kleene’s theorem (1997)
Howard, W.A.: The formulae-as-types notion of construction, pp. 479–490. Academic Press, London (1980)
Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, pp. 3–41. Princeton University Press, Princeton (1956)
Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Infor. and Comput. 110(2), 366–390 (1994)
Kozen, D.: Kleene algebra with tests. Transactions on Programming Languages and Systems 19(3), 427–443 (1997)
Kozen, D., Tiuryn, J.: On the completeness of propositional Hoare logic. In: RelMiCS, pp. 195–202 (2000)
Mirkin, B.G.: An algorithm for constructing a base in a language of regular expressions. Engineering Cybernetics 5, 51–57 (1966)
Moreira, N., Pereira, D., de Sousa, S.M.: On the mechanization of Kleene algebra in Coq. Technical Report DCC-2009-03, DCC-FC&LIACC, Universidade do Porto (2009)
Necula, G.C.: Proof-carrying code. In: Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of Programming Languages POPL 1997, pp. 106–119. ACM, New York (1997)
Pereira, D., Moreira, N.: KAT and PHL in Coq. Computer Science and Information Systems 05(02) (December 2008) ISSN: 1820-0214
Razet, B.: Simulating Eilenberg Machines with a Reactive Engine: Formal Specification, Proof and Program Extraction. Research Report (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Almeida, J.B., Moreira, N., Pereira, D., de Sousa, S.M. (2011). Partial Derivative Automata Formalized in Coq . In: Domaratzki, M., Salomaa, K. (eds) Implementation and Application of Automata. CIAA 2010. Lecture Notes in Computer Science, vol 6482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18098-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-18098-9_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-18097-2
Online ISBN: 978-3-642-18098-9
eBook Packages: Computer ScienceComputer Science (R0)