%0 Conference Proceedings
%T Regular Expression Learning with Evolutionary Testing and Repair
%+ National Institute of Informatics (NII)
%+ University of Bergamo
%+ Università degli Studi di Milano = University of Milan (UNIMI)
%A Arcaini, Paolo
%A Gargantini, Angelo
%A Riccobene, Elvinia
%Z Part 1: Test and Artificial Intelligence
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 31th IFIP International Conference on Testing Software and Systems (ICTSS)
%C Paris, France
%Y Christophe Gaston
%Y Nikolai Kosmatov
%Y Pascale Le Gall
%I Springer International Publishing
%3 Testing Software and Systems
%V LNCS-11812
%P 22-40
%8 2019-10-15
%D 2019
%R 10.1007/978-3-030-31280-0_2
%K Regular expression
%K Mutation testing
%K Software repair
%K Evolutionary approach
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X 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.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-02526352/document
%2 https://inria.hal.science/hal-02526352/file/482770_1_En_2_Chapter.pdf
%L hal-02526352
%U https://inria.hal.science/hal-02526352
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-ICTSS
%~ IFIP-LNCS-11812