eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2009-05-25
1
12
10.4230/DagSemProc.08351.7
article
SoftwareTesting with Active Learning in a Graph
Baskiotis, Nicolas
Sebag, Michèle
Gaudel, Marie-Claude
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.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol08351/DagSemProc.08351.7/DagSemProc.08351.7.pdf
Structural Statistical Software Testing
Active Learning
Control Flow Graph
Feaisble Paths
Parikh maps.