%0 Conference Proceedings
%T FloPSy - Search-Based Floating Point Constraint Solving for Symbolic Execution
%+ CREST Centre, Department of Computer Science
%+ Microsoft Research [Redmond]
%A Lakhotia, Kiran
%A Tillmann, Nikolai
%A Harman, Mark
%A Halleux, Jonathan
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 22nd IFIP WG 6.1 International Conference on Testing Software and Systems (ICTSS)
%C Natal, Brazil
%Y Alexandre Petrenko; Adenilso Simão; José Carlos Maldonado
%I Springer
%3 Testing Software and Systems
%V LNCS-6435
%P 142-157
%8 2010-11-08
%D 2010
%R 10.1007/978-3-642-16573-3_11
%Z Computer Science [cs]/Digital Libraries [cs.DL]Conference papers
%X 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.
%G English
%2 https://inria.hal.science/hal-01055253/document
%2 https://inria.hal.science/hal-01055253/file/it.pdf
%L hal-01055253
%U https://inria.hal.science/hal-01055253
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-LNCS-6435
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-ICTSS
%~ IFIP-2010