Stratégies de recherches dédiées à la résolution de systèmes de contraintes sur les flottants pour la vérification de programmes

Abstract : Program verification is a major issue for critical applications such as aviation, aerospace or embedded systems. Bounded model checking (e.g., CBMC) and constraint programming (e.g., CPBPV,...) approaches are based on the search for counter-examples that violate a property of the program to verify. The search for such counter-examples can be very time-consuming and costly when the programs to be verified contain floating point calculations. This is largely due to the fact that existing research strategies have been designed for finite domains and, to a lesser extent, for continuous domains. In this thesis, we propose a set of search strategies dedicated to program verification with floating point computation. The proposed strategies for variable and value selection are based on specific floating properties. These properties use characteristics of the variable domains, or the constraint structure. Some properties that focus on the domains of the variables are classic such as size and cardinality and others much more specific like density. The notions of size and cardinality are equivalent on the integers, but not on the floats. Density captures a variability that is very specific to the floats, half of which are between[-1.1]. Similarly, the properties that concern the structure of constraints are, for some such as the degree or number of occurrences, derived from finite domains, and for others much more specific, such as absorption, and cancellation; these two properties capture phenomena that are generally the cause of strong deviations of the floating point program from its interpretation on the reals and hence the existence of many counterexamples. For each property, two variable selection strategies are proposed. The first one chooses the variable that minimizes the property, while the second one chooses the variable that maximizes it. Value choice strategies try to take advantage of the phenomena of absorption and cancellation.
Document type :
Theses
Complete list of metadatas

Cited literature [110 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-02011939
Contributor : Abes Star <>
Submitted on : Friday, February 8, 2019 - 12:04:08 PM
Last modification on : Saturday, February 9, 2019 - 1:20:14 AM
Long-term archiving on : Thursday, May 9, 2019 - 2:06:25 PM

File

2018AZUR4089.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-02011939, version 1

Collections

Citation

Heytem Zitoun. Stratégies de recherches dédiées à la résolution de systèmes de contraintes sur les flottants pour la vérification de programmes. Génie logiciel [cs.SE]. Université Côte d'Azur, 2018. Français. ⟨NNT : 2018AZUR4089⟩. ⟨tel-02011939⟩

Share

Metrics

Record views

155

Files downloads

120