HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Characterization of program dependecies by integer programming technique

Yvon Jégou 1
1 CALCPAR - Calculateurs Parallèles
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : Integer programming techniques can be used in the characterization of relations between the variables of programs. Such techniques are considered to be far too expensive to be used in an automatic optimizing tool. We show that the cost of such a technique can be balanced by the quality of the information that can be extracted. Our algorithm transforms sets of equations and constraints that are extracted, by the optimizing compiler from programs and produces a characterization of the solution domain of the system. The result is a restricted domain of possible values for each variable as well as a set of new pertinent constraints. The system is run incrementally from the compiler. Its application domain is not limited to the computation of dependencies. In fact, it can be useful everywhere the decision of the compiler depends on the characterization of relations between variables of the program.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 3:41:53 PM
Last modification on : Friday, February 4, 2022 - 3:24:39 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:42:17 PM


  • HAL Id : inria-00074534, version 1


Yvon Jégou. Characterization of program dependecies by integer programming technique. [Research Report] RR-2138, INRIA. 1993. ⟨inria-00074534⟩



Record views


Files downloads