FloPSy - Search-Based Floating Point Constraint Solving for Symbolic Execution

  • Kiran Lakhotia
  • Nikolai Tillmann
  • Mark Harman
  • Jonathan de Halleux
Conference paper

DOI: 10.1007/978-3-642-16573-3_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6435)
Cite this paper as:
Lakhotia K., Tillmann N., Harman M., de Halleux J. (2010) FloPSy - Search-Based Floating Point Constraint Solving for Symbolic Execution. In: Petrenko A., Simão A., Maldonado J.C. (eds) Testing Software and Systems. ICTSS 2010. Lecture Notes in Computer Science, vol 6435. Springer, Berlin, Heidelberg

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.

Copyright information

© IFIP International Federation for Information Processing 2010

Authors and Affiliations

  • Kiran Lakhotia
    • 1
  • Nikolai Tillmann
    • 2
  • Mark Harman
    • 1
  • Jonathan de Halleux
    • 2
  1. 1.CREST Centre, Department of Computer ScienceUniversity College LondonLondonUK
  2. 2.Microsoft ResearchOne Microsoft WayRedmondUSA

Personalised recommendations