Abstract : Recently there has been an upsurge of interest in
both, Search-Based Software Testing (SBST), and Dynamic Symbolic
Execution (DSE). Each of these two approaches has complementary
strengths and weaknesses, making it a natural choice to explore the
degree to which the strengths of one can be exploited to offset the
weakness of the other. This paper introduces an augmented version of DSE
that uses a SBST-based approach to handling floating point computations,
which are known to be problematic for vanilla DSE. The approach has been
implemented as a plug in for the Microsoft Pex DSE testing tool. The
paper presents results from both, standard evaluation benchmarks, and
two open source programs.
Type de document :
Communication dans un congrès
Alexandre Petrenko; Adenilso Simão; José Carlos Maldonado. 22nd IFIP WG 6.1 International Conference on Testing Software and Systems (ICTSS), Nov 2010, Natal, Brazil. Springer, Lecture Notes in Computer Science, LNCS-6435, pp.142-157, 2010, Testing Software and Systems. 〈10.1007/978-3-642-16573-3_11〉
https://hal.inria.fr/hal-01055253
Contributeur : Hal Ifip
<>
Soumis le : mardi 12 août 2014 - 09:10:40
Dernière modification le : mercredi 16 août 2017 - 15:22:47
Document(s) archivé(s) le : mercredi 26 novembre 2014 - 22:42:17
Kiran Lakhotia, Nikolai Tillmann, Mark Harman, Jonathan Halleux. FloPSy - Search-Based Floating Point Constraint
Solving for Symbolic Execution. Alexandre Petrenko; Adenilso Simão; José Carlos Maldonado. 22nd IFIP WG 6.1 International Conference on Testing Software and Systems (ICTSS), Nov 2010, Natal, Brazil. Springer, Lecture Notes in Computer Science, LNCS-6435, pp.142-157, 2010, Testing Software and Systems. 〈10.1007/978-3-642-16573-3_11〉. 〈hal-01055253〉
