The verification of conversion algorithms between finite automata

Highlight
  • 15 Downloads

Notes

Acknowledgements

This work was supported by Beijing Natural Science Foundation (Grant No. 4164092) and Fundamental Research Funds for Central Universities (Grant No. BLX2015-17).

Supplementary material

11432_2017_9155_MOESM1_ESM.pdf (310 kb)
Supplementary material, approximately 309 KB.

References

  1. 1.
    Filliâtre J C. Finite Auotmata Theory in Coq: a Constructive Proof of Kleene’s Theorem. Research Report 97 C 04, LIP-ENS Lyon. 1997Google Scholar
  2. 2.
    Braibant T, Pous D. An efficient Coq tactic for deciding Kleene algebras. In: Proceedings of International Conference on Interactive Theorem Proving, Edinburgh, 2010. 163–178MATHGoogle Scholar
  3. 3.
    Lammich P, Tuerk T. Applying data refinement for monadic programs to Hopcroft’s algorithm. In: Proceedings of International Conference on Interactive Theorem Proving, New Jersey, 2012. 166–182MATHGoogle Scholar
  4. 4.
    Paulson L C. A Formalisation of finite automata using hereditarily finite sets. In: Proceedings of CADE-25-International Conference on Automated Deduction, Berlin, 2015. 231–245MATHGoogle Scholar
  5. 5.
    Lammich P, Lochbihler A. The isabelle collections framework. In: Proceedings of International Conference on Interactive Theorem Proving, New Jersey, 2010. 339–354MATHGoogle Scholar
  6. 6.
    Esparza J. Automata Theory: an Algorithmic Approach. 2016. https://www7.in.tum.de/~esparza/autoskript.pdfGoogle Scholar

Copyright information

© Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature 2017

Authors and Affiliations

  1. 1.School of Information Science & TechnologyBeijing Forestry UniversityBeijingChina
  2. 2.State Key Laboratory of Software Development EnvironmentBeihang UniversityBeijingChina

Personalised recommendations