Proofs of numerical programs when the compiler optimizes
Résumé
On certain recently developed architectures, a numerical program may give different answers depending on the execution hardware and the compilation. Our goal is to formally prove properties about numerical programs that are true for multiple architectures and compilers.We propose an approach that states the rounding error of each floatingpoint computation whatever the environment and the compiler choices. This approach is implemented in the Frama-C platform for static analysis of C code. Small case studies using this approach are entirely and automatically proved.
Domaines
Logique en informatique [cs.LO]Origine | Fichiers éditeurs autorisés sur une archive ouverte |
---|
Loading...