On the Equivalence of Two Systems of Affine Recurrence Equations - Archive ouverte HAL Accéder directement au contenu
Rapport Année : 2001

On the Equivalence of Two Systems of Affine Recurrence Equations

Paul Feautrier
Xavier Redon
  • Fonction : Auteur

Résumé

This paper deals with the problem of deciding whether two Systems of Affine Recurrence Equations are equivalent or not. A solution to this problem would be a first step toward algorithm recognition, an important tool in program analysis, optimization and parallelization. We first prove that in the general case, the problem is undecidable. The proof is by reducing any instance of Hilbert's tenth problem (the solution of Diophantine equations) to the equivalence of two SAREs. We then show that there neverthele- ss exists a semi-algorithm, in which the key ingredient is the computation of transitive closures of affine relations. This is again an undecidable problem which has been extensively studied. Many partial solutions are known. We then report on a pilot implementation of the algorithm, describe its limitations, and point to unsolved problems.
Fichier principal
Vignette du fichier
RR-4285.pdf (377.68 Ko) Télécharger le fichier

Dates et versions

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

Identifiants

  • HAL Id : inria-00072302 , version 1

Citer

Denis Barthou, Paul Feautrier, Xavier Redon. On the Equivalence of Two Systems of Affine Recurrence Equations. RR-4285, INRIA. 2001. ⟨inria-00072302⟩
124 Consultations
497 Téléchargements

Partager

Gmail Facebook X LinkedIn More