Assertion-based debugging of imperative programs by abstract interpretation

Towards a Flow Analysis for Embedded System C Programs

“…One use has been to calculate possible values for variables at different program points. This information can for example be used in a "static debugger" [6] which identifies (the risk of) array indices lying outside array ranges, and other possible errors in the analysed program. This idea has been further developed and commercialised under the name PolySpace [29].…”

“…buf [5] buf [6] buf [3] buf [4] buf [2] buf[0] buf [1] arr [0] arr [2] arr [1] arr [ (e) Abstract memory and environment…”

Abstracting Call-Stacks for Interprocedural Verification of Imperative Programs

“…The applications we have in mind are automated debugging [4,14] or automatic test selection [25], which may require precise and complex analyses. These are flow-sensitive (the analysis needs to take conditionals into account accurately), attribute-dependent (attributes (or properties) of variables are inter-related), and may require the use of infinite or even infinite-height lattices, in particular for the analysis of the properties numerical variables.…”