Skip to Main content Skip to Navigation
Other publications

Sub-domain Selection Strategies For Floating Point Constraint Systems

Abstract : Program verification is a key issue for critical applications such as aviation, aerospace, or embedded systems. Bounded model checking (BMC) and constraint programming (CBMC, CBPV, ...) approaches are based on counterexamples that violate a property of the program to verify. Searching for such counterexamples can be very long and costly when the programs to check contains floating point computations. This stems from the fact that existing search strategies have been designed for discrete domains and, to a lesser extent, continuous domains. In [12], we have introduced a set of variable choice strategies that take advantages of the specificities of the floats, e.g., domain density, cancellation and absorption phenomena. In this paper we introduce new sub-domain selection strategies targeting domains involved in absorption and using techniques derived from higher order consistencies. Preliminary experiments on a significant set of benchmarks are very promising.
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01956094
Contributor : Heytem Zitoun <>
Submitted on : Friday, December 14, 2018 - 7:47:14 PM
Last modification on : Tuesday, May 26, 2020 - 6:50:59 PM
Document(s) archivé(s) le : Friday, March 15, 2019 - 5:18:38 PM

File

DP-CP18_paper_25.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01956094, version 1

Collections

Citation

Heytem Zitoun, Claude Michel, Michel Rueher, Laurent Michel. Sub-domain Selection Strategies For Floating Point Constraint Systems. 2018. ⟨hal-01956094⟩

Share

Metrics

Record views

39

Files downloads

55