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.
Type de document :
Autre publication
24th International Conference on Principles and Practice of Constraint Programming Doctoral Progr.. 2018
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01956094
Contributeur : Heytem Zitoun <>
Soumis le : vendredi 14 décembre 2018 - 19:47:14
Dernière modification le : vendredi 4 janvier 2019 - 01:19:42
Document(s) archivé(s) le : vendredi 15 mars 2019 - 17:18:38

Fichier

DP-CP18_paper_25.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • 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. 24th International Conference on Principles and Practice of Constraint Programming Doctoral Progr.. 2018. 〈hal-01956094〉

Partager

Métriques

Consultations de la notice

13

Téléchargements de fichiers

6