Checking Array Bounds by Abstract Interpretation and Symbolic Expressions - Université de La Réunion Access content directly
Conference Papers Year : 2018

Checking Array Bounds by Abstract Interpretation and Symbolic Expressions


Array access out of bounds is a typical programming error. From the '70s, static analysis has been used to identify where such errors actually occur at runtime, through abstract interpretation into linear constraints. However, feasibility and scalability to modern object-oriented code has not been established yet. This article builds on previous work on linear constraints and shows that the result does not scale, when polyhedra implement the linear constraints, while the more abstract zones scale to the analysis of medium-size applications. Moreover, this article formalises the inclusion of symbolic expressions in the constraints and shows that this improves its precision. Expressions are automatically selected on-demand. The resulting analysis applies to code with dynamic memory allocation and arrays held in expressions. It is sound, also in the presence of arbitrary side-effects. It is fully defined in the abstract interpretation framework and does not use any code instrumen-tation. Its proof of correctness, its implementation inside the commercial Julia analyzer and experiments on third-party code complete the work.
Fichier principal
Vignette du fichier
ijcar18.pdf (371.04 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01921666 , version 1 (14-11-2018)



Fausto Spoto, Etienne Payet. Checking Array Bounds by Abstract Interpretation and Symbolic Expressions. 9th International Joint Conference on Automated Reasoning (IJCAR'18), Jul 2018, Oxford, United Kingdom. pp.706-722, ⟨10.1007/978-3-319-94205-6_46⟩. ⟨hal-01921666⟩
89 View
465 Download



Gmail Mastodon Facebook X LinkedIn More