Passer à la navigation principale Passer à la recherche Passer au contenu principal

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

  • Université Paris-Saclay

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

4 Citations (Scopus)

Résumé

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.

langue originaleAnglais
titreProceedings of the 38th ACM/SIGAPP Symposium on Applied Computing, SAC 2023
EditeurAssociation for Computing Machinery
Pages1673-1680
Nombre de pages8
ISBN (Electronique)9781450395175
Les DOIs
étatPublié - 27 mars 2023
Modification externeOui
Evénement38th Annual ACM Symposium on Applied Computing, SAC 2023 - Virtual, Online, Estonie
Durée: 27 mars 2023 → 31 mars 2023

Série de publications

NomProceedings of the ACM Symposium on Applied Computing

Une conférence

Une conférence38th Annual ACM Symposium on Applied Computing, SAC 2023
Pays/TerritoireEstonie
La villeVirtual, Online
période27/03/23 → 31/03/23

Empreinte digitale

Examiner les sujets de recherche de « Formalizing an Efficient Runtime Assertion Checker for an Arithmetic Language with Functions and Predicates ». Ensemble, ils forment une empreinte digitale unique.

Contient cette citation