Skip to Main content Skip to Navigation

Instancewise Program Analysis

Pierre Amiranoff 1 Albert Cohen
1 A3 - Advanced analysis to code optimization
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France
Abstract : 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.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 5:38:02 PM
Last modification on : Wednesday, September 16, 2020 - 4:57:21 PM
Long-term archiving on: : Sunday, April 4, 2010 - 10:16:46 PM


  • HAL Id : inria-00071465, version 1



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



Record views


Files downloads