Skip to main content

Improving the Floating Point Addition and Subtraction Constraints

  • Conference paper
Book cover Principles and Practice of Constraint Programming – CP 2010 (CP 2010)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 6308))

Abstract

Solving constraints over the floating point numbers is a key issue in the process of software validation and verification. Techniques to solve such constraints on the basis of projection functions have been successfully developed. However, though correct, this approach can lead to slow convergence phenomena for very common constraints like addition and subtraction constraints. In this paper, we introduce new addition and subtraction constraints which, thanks to a new floating point subtraction property, directly compute optimal bounds for the domain of the variables at a low cost. Preliminary experiments have shown that these constraints can drastically speed up the filtering process.

This work has been partially supported by the “CAVERN” ANR-07-SESUR-003 project.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Botella, B., Gotlieb, A., Michel, C.: Symbolic execution of floating-point computations. Softw. Test., Verif. Reliab. 16(2), 97–121 (2006)

    Article  Google Scholar 

  2. Collavizza, H., Rueher, M., Hentenryck, P.: CPBPV: a constraint-programming framework for bounded program verification. Constraints 15(2), 238–264 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  3. Marre, B., Blanc, B.: Test selection strategies for lustre descriptions in gatel. Electr. Notes Theor. Comput. Sci. 111, 93–111 (2005)

    Article  Google Scholar 

  4. Michel, C.: Exact projection functions for floating point number constraints. In: AMAI (2002)

    Google Scholar 

  5. Michel, C., Rueher, M., Lebbah, Y.: Solving constraints over floating-point numbers. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 524–538. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Sterbenz, P.: Floating point computations. Prentice-Hall, Englewood Cliffs (1974)

    Google Scholar 

  7. Williams, N., Marre, B., Mouy, P., Roger, M.: Pathcrawler: Automatic generation of path tests by combining static and dynamic analysis. In: Dal Cin, M., Kaâniche, M., Pataricza, A. (eds.) EDCC 2005. LNCS, vol. 3463, pp. 281–292. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Marre, B., Michel, C. (2010). Improving the Floating Point Addition and Subtraction Constraints. In: Cohen, D. (eds) Principles and Practice of Constraint Programming – CP 2010. CP 2010. Lecture Notes in Computer Science, vol 6308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15396-9_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15396-9_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15395-2

  • Online ISBN: 978-3-642-15396-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics