Instancewise Program Analysis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2004

Instancewise Program Analysis

Albert Cohen


We introduce a general static analysis framework to reason about program properties at an infinite number of runtime control points, called instances. Infinite sets of instances are represented by rational languages. Based on this instancewise framework, we extend the concept of induction variables to recursive programs. For a class of monoid-based data structures, including arrays and trees, induction variables capture the exact memory location accessed at every step of the execution. This compile-time characterization is computed in polynomial time as a rational function.
Fichier principal
Vignette du fichier
RR-5117.pdf (510.86 Ko) Télécharger le fichier

Dates and versions

inria-00071465 , version 1 (23-05-2006)


  • HAL Id : inria-00071465 , version 1


Pierre Amiranoff, Albert Cohen. Instancewise Program Analysis. RR-5117, INRIA. 2004. ⟨inria-00071465⟩
79 View
97 Download


Gmail Facebook X LinkedIn More