Runtime Abstract Interpretation for Numerical Accuracy and Robustness

Védrine, Franck; Jacquemin, Maxime; Kosmatov, Nikolaï; Signoles, Julien

doi:10.1007/978-3-030-67067-2_12

Cited by 3 publications

(1 citation statement)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper claims several times that the generated code is efficient. It is supported by several previous experiments, including examples specifically written for evaluating the E-ACSL type system [6,16], and evaluations on existing benchmarks [29], or concrete use cases [8,22,24,28]. Beyond demonstrating scalability, all these experiments increase our confidence in the implementation.…”

Section: Methodsmentioning

confidence: 99%

Formalizing an Efficient Runtime Assertion Checker for an Arithmetic Language with Functions and Predicates

Benjamin

Signoles

2023

Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing

View full text Add to dashboard Cite

Runtime Assertion Checking (RAC) is a lightweight formal method that verifies formal code annotations, typically assertions, at runtime. The main RAC challenge consists in generating code that is both sound and efficient for checking expressive properties. In particular, checking formal arithmetic properties usually requires to use machine integer arithmetic to be efficient, but needs to rely on an exact yet slower arithmetic library to be sound.This paper formalizes an efficient RAC tool for arithmetic properties, which may include user-defined functions and predicates. Efficient code generation for these routines is based on specialization, allowing to generate efficient functions using machine arithmetic when possible, or slower functions relying on exact arithmetic, according to the calling context. This formalization is implemented in E-ACSL, a runtime assertion checker for C programs.

show abstract

Section: Methodsmentioning

confidence: 99%

Formalizing an Efficient Runtime Assertion Checker for an Arithmetic Language with Functions and Predicates

Benjamin

Signoles

2023

Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing

View full text Add to dashboard Cite

show abstract

Runtime Annotation Checking with Frama-C: The E-ACSL Plug-in

Benjamin,

Signoles

2024

Guide to Software Verification With Frama-C

View full text Add to dashboard Cite

A Case Study on Numerical Analysis of a Path Computation Algorithm

Boussu,

Kosmatov,

Védrine

2024

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

Lack of numerical precision in control software -in particular, related to trajectory computationcan lead to incorrect results with costly or even catastrophic consequences. Various tools have been proposed to analyze the precision of program computations. This paper presents a case study on numerical analysis of an industrial implementation of the fast marching algorithm, a popular path computation algorithm frequently used for trajectory computation. We briefly describe the selected tools, present the applied methodology, highlight some attention points, summarize the results and outline future work directions.

show abstract

Runtime Abstract Interpretation for Numerical Accuracy and Robustness

Cited by 3 publications

References 37 publications

Formalizing an Efficient Runtime Assertion Checker for an Arithmetic Language with Functions and Predicates

Formalizing an Efficient Runtime Assertion Checker for an Arithmetic Language with Functions and Predicates

Runtime Annotation Checking with Frama-C: The E-ACSL Plug-in

A Case Study on Numerical Analysis of a Path Computation Algorithm

Contact Info

Product

Resources

About