A Constructive Theory of Regular Languages in Coq-Reference-Cited by-同舟云学术

A Constructive Theory of Regular Languages in Coq

Published:2013 Issue: Volume: Page:82-97
ISSN:0302-9743
Container-title:Certified Programs and Proofs
language:
Short-container-title:

Author:

Doczkal Christian,Kaiser Jan-Oliver,Smolka Gert

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-03545-1_6

Reference21 articles.

1. Lecture Notes in Computer Science;A. Asperti,2012

2. Lecture Notes in Computer Science,2009

3. Berghofer, S., Reiter, M.: Formalizing the logic-automaton connection. In: Berghofer, et al. (eds.) [2], pp. 147–163

4. Braibant, T., Pous, D.: Deciding kleene algebras in coq. Logical Methods in Computer Science 8(1) (2012)

5. Constable, R.L., Jackson, P.B., Naumov, P., Uribe, J.C.: Constructively formalizing automata theory. In: Plotkin, G.D., Stirling, C., Tofte, M. (eds.) Proof, Language, and Interaction, pp. 213–238. The MIT Press (2000)

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

1. Efficient Matching of Regular Expressions with Lookaround Assertions;Proceedings of the ACM on Programming Languages;2024-01-05

2. A Verified Operational Semantics for Regular Expression Parsing;Proceedings of the XXVII Brazilian Symposium on Programming Languages;2023-09-25

3. Symbolic and automatic differentiation of languages;Proceedings of the ACM on Programming Languages;2021-08-22

4. Syntax vs Semantics;Proceedings of the 24th Brazilian Symposium on Context-Oriented Programming and Advanced Modularity;2020-10-19

5. Lean formalization of bounded grids and computable cellular automata defined thereover;Science of Computer Programming;2020-09