2026-07-19T20:52:17Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2014 2024-03-06T11:08:15Z ddc:004 open_access

SoftwareTesting with Active Learning in a Graph Baskiotis, Nicolas Sebag, Michèle Gaudel, Marie-Claude Structural Statistical Software Testing Active Learning Control Flow Graph Feaisble Paths Parikh maps. Motivated by Structural Statistical Software Testing (SSST), this paper is interested in sampling the feasible execution paths in the control flow graph of the program being tested. For some complex programs, the fraction of feasible paths becomes tiny, ranging in $[10^{-10}, 10^{-5}]$. When relying on the uniform sampling of the program paths, SSST is thus hindered by the non-Markovian nature of the ``feasible path'' concept, due to the long-range dependencies between the program nodes. A divide and generate approach relying on an extended Parikh Map representation is proposed to address this limitation; experimental validation on real-world and artificial problems demonstrates gains of orders of magnitude compared to the state of the art. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Nicolas Baskiotis and Michèle Sebag and Marie-Claude Gaudel 2009 Is Part Of Dagstuhl Seminar Proceedings, Volume 8351, Evolutionary Test Generation (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.08351.7 urn:nbn:de:0030-drops-20149 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08351.7 eng https://creativecommons.org/licenses/by/4.0/legalcode