Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions-Reference-Cited by-同舟云学术

Disambiguation in Regular Expression Matching via Position Automata with Augmented Transitions

Published:2011 Issue: Volume: Page:231-240
ISSN:0302-9743
Container-title:Implementation and Application of Automata
language:
Short-container-title:

Author:

Okui Satoshi,Suzuki Taro

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-18098-9_25

Reference11 articles.

1. The Open Group Base Specification Issue 6 IEEE Std 1003.1 2004 Edition (2004), http://www.opengroup.org/onlinepubs/009695399/basedefs/xbd_chap09.html

2. Cox, R.: Regular Expression Matching Can Be Simple and Fast (2007), http://swtch.com/~rsc/regexp/regexp1.html

3. Cox, R.: Regular Expression Matching in the Wild (2010), http://swtch.com/~rsc/regexp/regexp3.html

4. Dubé, D., Feeley, M.: Efficiently Building a Parse Tree from a Regular Expression. Acta Infomatica 37(2), 121–144 (2000)

5. Fowler, G.: An Iterpretation of the POSIX Regex Standard (2003), http://www2.research.att.com/~gsf/testregex/re-interpretation.html

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

1. Static Analysis for Checking the Disambiguation Robustness of Regular Expressions;Proceedings of the ACM on Programming Languages;2024-06-20

2. Lean Formalization of Extended Regular Expression Matching with Lookarounds;Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs;2024-01-09

3. Deducing Matching Strings for Real-World Regular Expressions;Dependable Software Engineering. Theories, Tools, and Applications;2023-12-15

4. POSIX Lexing with Derivatives of Regular Expressions;Journal of Automated Reasoning;2023-07-08

5. Formalising and implementing Boost POSIX regular expression matching;Theoretical Computer Science;2021-02