C. Alias and D. Barthou, On the Recognition of Algorithm Templates, International Workshop on Compilers Optimization Meets Compiler Verification, 2003.
DOI : 10.1016/S1571-0661(05)82599-X

J. Autebert, J. Berstel, and L. Boasson, Context-free languages and push-down automata, Handbook of Formal Languages, 1997.

D. Barthou, P. Feautrier, and X. Redon, On the Equivalence of Two Systems of Affine Recurrence Equations, 2001.
DOI : 10.1007/3-540-45706-2_40

URL : https://hal.archives-ouvertes.fr/inria-00072302

D. Barthou, P. Feautrier, and X. Redon, On the Equivalence of Two Systems of Affine Recurrence Equations, 8th International Euro-Par Conference, p.309, 2002.
DOI : 10.1007/3-540-45706-2_40

URL : https://hal.archives-ouvertes.fr/inria-00072302

T. J. Biggerstaff, B. Mitbander, and D. Webster, The concept assignment problem in program understanding, 15th International Conference on Software Engineering, 1993.

R. Cytron, J. Ferrante, B. K. Rosen, M. N. Wegman, and F. K. Zadeck, Efficiently computing static single assignment form and the control dependence graph, ACM Transactions on Programming Languages and Systems, vol.13, issue.4, pp.451-490, 1991.
DOI : 10.1145/115372.115320

A. Darte, Y. Robert, and F. Vivien, Scheduling and automatic Parallelization, 2000.
DOI : 10.1007/978-1-4612-1362-8

URL : https://hal.archives-ouvertes.fr/hal-00856645

P. Feautrier, Dataflow analysis of array and scalar references, International Journal of Parallel Programming, vol.24, issue.4, pp.23-53, 1991.
DOI : 10.1145/360827.360844

URL : http://www.prism.uvsq.fr/public/paf/dataflow.ps

P. Feautrier, Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time, International Journal of Parallel Programming, vol.2, issue.4, pp.389-420, 1992.
DOI : 10.1007/BF01379404

G. Huet, A unification algorithm for typed ??-calculus, Theoretical Computer Science, vol.1, issue.1, pp.27-57, 1975.
DOI : 10.1016/0304-3975(75)90011-0

URL : https://doi.org/10.1016/0304-3975(75)90011-0

W. Kelly, W. Pugh, E. Rosser, and T. Shpeisman, Transitive Closure of Infinite Graphs and Its Applications, International Journal of Parallel Programming, vol.36, issue.12, pp.579-598, 1996.
DOI : 10.1145/209936.209952

L. Lee, J. G. Siek, and A. Lumsdaine, The generic graph component library, Proceedings of the Conference on Object-Oriented Programming, Systems, Languages, and Applications, pp.399-414, 1999.
DOI : 10.1145/320385.320428

B. D. Martino and G. Iannello, PAP Recognizer: a tool for automatic recognition of parallelizable patterns, WPC '96. 4th Workshop on Program Comprehension, pp.164-174, 1996.
DOI : 10.1109/WPC.1996.501131

D. Maydan, S. Amarasinghe, and M. Lam, Array dataflow analysis and its use in array privatization, In ACM Symp. on Principles of Programming Languages, pp.2-15, 1993.
DOI : 10.1145/158511.158515

R. Metzger and Z. Wen, Automatic Algorithm Recognition: A New Approach to Program Optimization, 2000.

M. Pinzger, M. Fischer, H. Gall, and M. Jazayeri, Revealer: a lexical pattern matcher for architecture recovery, Ninth Working Conference on Reverse Engineering, 2002. Proceedings., 2002.
DOI : 10.1109/WCRE.2002.1173075

W. Pugh, The Omega test: a fast and practical integer programming algorithm for dependence analysis, Proceedings of the 1991 ACM/IEEE conference on Supercomputing , Supercomputing '91, pp.4-13, 1991.
DOI : 10.1145/125826.125848

A. J. Quigley, Experience with FADE for the visualization and abstraction of software views, Proceedings 10th International Workshop on Program Comprehension, 2002.
DOI : 10.1109/WPC.2002.1021304

X. Redon and P. Feautrier, Detection of scans in the polytope model. Parallel Algorithms and Applications, pp.229-263, 2000.

Y. Saouter and P. Quinton, Computability of recurrence equations, Theoretical Computer Science, vol.116, issue.2, pp.317-337, 1993.
DOI : 10.1016/0304-3975(93)90326-O

URL : https://hal.archives-ouvertes.fr/inria-00075355

K. C. Shashidhar, M. Bruynooghe, F. Catthoor, and G. Janssens, Geometric Model Checking, International Workshop on Compilers Optimization Meets Compiler Verification, 2002.
DOI : 10.1016/S1571-0661(04)80397-9

URL : https://doi.org/10.1016/s1571-0661(04)80397-9

J. G. Siek and A. Lumsdaine, The Matrix Template Library: A Generic Programming Approach to High Performance Numerical Linear Algebra, ISCOPE, pp.59-70, 1998.
DOI : 10.1145/42288.42292

C. Tayoudjameni, P. Quinton, S. Rajopadhye, and T. Risset, Derivation of systolic algorithm path problem by recurrence transformations, Parallel Computing, 2000.

A. Telea, A. Maccari, and C. Riva, An open visualization toolkit for reverse architecting, Proceedings 10th International Workshop on Program Comprehension, 2002.
DOI : 10.1109/WPC.2002.1021303

URL : http://iwi.eldoc.ub.rug.nl/FILES/root/2002/ProcIWPCTelea/2002ProcIWPCTelea.pdf

L. M. Wills, Automated Program Recognition by Graph Parsing, 1992.
DOI : 10.21236/ADA259609