Skip to main content
SpringerLink
Log in

A Compact Proof of Decidability for Regular Expression Equivalence

  • Conference paper
Interactive Theorem Proving (ITP 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7406))

Included in the following conference series:

Abstract

The article describes a compact formalization of the relation between regular expressions and deterministic finite automata, and a formally verified, efficient algorithm for testing regular expression equivalence, both based on the notion of pointed regular expression [8].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools. Pearson Education Inc. (2006)

    Google Scholar 

  2. Almeida, J.B., Moreira, N., Pereira, D., de Sousa, S.M.: Partial Derivative Automata Formalized in COQ. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol. 6482, pp. 59–68. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  3. Antimirov, V.: Partial derivatives of regular expressions and finite automaton constructions. Theoretical Computer Science 155, 291–319 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  4. Asperti, A., Armentano, C.: A page in number theory. Journal of Formalized Reasoning 1, 1–23 (2008)

    MathSciNet  MATH  Google Scholar 

  5. Asperti, A., Avigad, J.: Zen and the art of formalization. Mathematical Structures in Computer Science 21(4), 679–682 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  6. Asperti, A., Ricciotti, W., Sacerdoti Coen, C., Tassi, E.: The Matita Interactive Theorem Prover. In: Bjørner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS, vol. 6803, pp. 64–69. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. Asperti, A., Ricciotti, W., Sacerdoti Coen, C., Tassi, E.: Hints in Unification. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 84–98. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. Asperti, A., Tassi, E., Coen, C.S.: Regular expressions, au point. eprint arXiv:1010.2604 (2010)

    Google Scholar 

  9. Berry, G., Sethi, R.: From regular expressions to deterministic automata. Theor. Comput. Sci. 48(3), 117–126 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  10. Braibant, T., Pous, D.: An Efficient COQ Tactic for Deciding Kleene Algebras. In: Kaufmann, M., Paulson, L.C. (eds.) ITP 2010. LNCS, vol. 6172, pp. 163–178. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  11. Brüggemann-Klein, A.: Regular expressions into finite automata. Theor. Comput. Sci. 120(2), 197–213 (1993)

    Article  MATH  Google Scholar 

  12. Chang, C.-H., Paige, R.: From Regular Expressions to Dfa’s using Compressed Nfa’s. In: Apostolico, A., Galil, Z., Manber, U., Crochemore, M. (eds.) CPM 1992. LNCS, vol. 644, pp. 90–110. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  13. Coquand, T., Siles, V.: A Decision Procedure for Regular Expression Equivalence in Type Theory. In: Jouannaud, J.-P., Shao, Z. (eds.) CPP 2011. LNCS, vol. 7086, pp. 119–134. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  14. Fischer, S., Huch, F., Wilke, T.: A play on regular expressions: functional pearl. In: Proceeding of the 15th ACM SIGPLAN International Conference on Functional Programming, ICFP 2010, Baltimore, Maryland, pp. 357–368. ACM (2010)

    Google Scholar 

  15. Gonthier, G., Mahboubi, A.: An introduction to small scale reflection in COQ. Journal of Formalized Reasoning 3(2), 95–152 (2010)

    MathSciNet  MATH  Google Scholar 

  16. Huet, G.P.: Residual theory in lambda-calculus: A formal development. J. Funct. Program. 4(3), 371–394 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  17. Ilie, L., Yu, S.: Follow automata. Inf. Comput. 186(1), 140–162 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  18. Krauss, A., Nipkow, T.: Proof pearl: Regular expression equivalence and relation algebra. Journal of Automated Reasoning (2011) (published online)

    Google Scholar 

  19. McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers 9(1), 39–47 (1960)

    Article  Google Scholar 

  20. Owens, S., Reppy, J.H., Turon, A.: Regular-expression derivatives re-examined. J. Funct. Program. 19(2), 173–190 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  21. Thompson, K.: Regular expression search algorithm. Communications of ACM 11, 419–422 (1968)

    Article  MATH  Google Scholar 

  22. Wu, C., Zhang, X., Urban, C.: A Formalisation of the Myhill-Nerode Theorem Based on Regular Expressions (Proof Pearl). In: van Eekelen, M., Geuvers, H., Schmaltz, J., Wiedijk, F. (eds.) ITP 2011. LNCS, vol. 6898, pp. 341–356. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bologna, Italy

    Andrea Asperti

Authors
  1. Andrea Asperti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Princeton University, 35 Olden Street, 08540, Princeton, NJ, USA

    Lennart Beringer

  2. School of Electrical Engineering and Computer Science, University of Ottawa, 800 King Edward Ave., K1N 6N5, Ottawa, ON, Canada

    Amy Felty

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Asperti, A. (2012). A Compact Proof of Decidability for Regular Expression Equivalence. In: Beringer, L., Felty, A. (eds) Interactive Theorem Proving. ITP 2012. Lecture Notes in Computer Science, vol 7406. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32347-8_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32347-8_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32346-1

  • Online ISBN: 978-3-642-32347-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation