2021
DOI: 10.1007/s11633-021-1301-4
|View full text |Cite
|
Sign up to set email alerts
|

Ensuring the Correctness of Regular Expressions: A Review

Abstract: Regular expressions are widely used within and even outside of computer science due to their expressiveness and flexibility. However, regular expressions have a quite compact and rather tolerant syntax that makes them hard to understand, hard to compose, and error-prone. Faulty regular expressions may cause failures of the applications that use them. Therefore, ensuring the correctness of regular expressions is a vital prerequisite for their use in practical applications. The importance and necessity of ensuri… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 71 publications
0
3
0
Order By: Relevance
“…Nonetheless, regular expressions have certain drawbacks. As a result, strategies for validating regular expressions [30] or testing their use in applications [31] are being sought to expose potential flaws in regular expressions.…”
Section: Resultsmentioning
confidence: 99%
“…Nonetheless, regular expressions have certain drawbacks. As a result, strategies for validating regular expressions [30] or testing their use in applications [31] are being sought to expose potential flaws in regular expressions.…”
Section: Resultsmentioning
confidence: 99%
“…In this work, we are mostly concerned with generating correct RegExs that represent valid solutions to a given task because writing complex RegExs that accept different answers is tedious and error-prone. Existing work on ensuring the correctness of RegExs has recently been reviewed by Zheng et al [31]. While there are numerous approaches to testing or even verifying existing RegExs, methods for creating RegExs are mostly concerned with learning them either from examples or from a natural language description.…”
Section: Related Workmentioning
confidence: 99%
“…In bioinformatics, regular expressions have been used in a myriad of diverse applications like establishing databases(Bairoch, Bucher and Hofmann 1997), determination of motifs from aligned protein sequences(Huang 2001), and in performing multiple sequence alignments(Arslan 2005). The language of regular expressions is known to have several dialects (i.e., syntax)(Zheng et al 2021), and DORM supports the UNIX POSIX style regular expressions (IEEE and The Open Group 2018). A brief description and examples are presented here:…”
mentioning
confidence: 99%