Skip to Main content Skip to Navigation
Conference papers

Regular Expression Learning with Evolutionary Testing and Repair

Abstract : Regular expressions are widely used to describe and document regular languages, and to identify a set of (valid) strings. Often they are not available or known, and they must be learned or inferred. Classical approaches like L* make strong assumptions that normally do not hold. More feasible are testing approaches in which it is possible only to generate strings and check them with the underlying system acting as oracle. In this paper, we devise a method that starting from an initial guess of the regular expression, it repeatedly generates and feeds strings to the system to check whether they are accepted or not, and it tries to repair consistently the alleged solution. Our approach is based on an evolutionary algorithm in which both the population of possible solutions and the set of strings co-evolve. Mutation is used for the population evolution in order to produce the offspring. We run a set of experiments showing that the string generation policy is effective and that the evolutionary approach outperforms existing techniques for regular expression repair.
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Tuesday, March 31, 2020 - 3:14:10 PM
Last modification on : Wednesday, December 8, 2021 - 9:22:07 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Paolo Arcaini, Angelo Gargantini, Elvinia Riccobene. Regular Expression Learning with Evolutionary Testing and Repair. 31th IFIP International Conference on Testing Software and Systems (ICTSS), Oct 2019, Paris, France. pp.22-40, ⟨10.1007/978-3-030-31280-0_2⟩. ⟨hal-02526352⟩



Record views


Files downloads