Checking Array Bounds by Abstract Interpretation and Symbolic ExpressionsÉtienne

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

http://hal.univ-reunion.fr/hal-01921666
Contributor : Réunion Univ <>
Submitted on : Wednesday, November 14, 2018 - 6:37:27 AM
Last modification on : Thursday, March 28, 2019 - 11:24:10 AM
Long-term archiving on : Friday, February 15, 2019 - 12:32:15 PM

File

ijcar18.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Fausto Spoto, Etienne Payet. Checking Array Bounds by Abstract Interpretation and Symbolic ExpressionsÉtienne. 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⟩

Share

Metrics

Record views

48

Files downloads

39