The verification of conversion algorithms between finite automata-Reference-Cited by-同舟云学术

The verification of conversion algorithms between finite automata

Published:2017-11-17 Issue:2 Volume:61 Page:
ISSN:1674-733X
Container-title:Science China Information Sciences
language:en
Short-container-title:Sci. China Inf. Sci.

Author:

Jiang Dongchen,Li Wei

Publisher

Springer Science and Business Media LLC

Subject

General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s11432-017-9155-x.pdf

Reference6 articles.

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. 1997

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–178

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–182

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–245

5. Lammich P, Lochbihler A. The isabelle collections framework. In: Proceedings of International Conference on Interactive Theorem Proving, New Jersey, 2010. 339–354

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Machine Proof System of Point Geometry Based on Coq;Mathematics;2023-06-18

2. Differential Testing of Pushdown Reachability with a Formally Verified Oracle;Form Comp Aid Design;2022

3. Equivalent State of Finite Automata and Its Judgment Theorem;Proceedings of the 2018 2nd International Conference on Algorithms, Computing and Systems - ICACS '18;2018