% {\'E}DITEURS
%
@STRING( AW = "Addison-Wesley Publishing Company" )
@STRING( BC = "The Benjamin/Cummings Publishing Company, Inc" )
@STRING( ACM = "Association for Computing Machinery" )
@STRING( ACMPRESS = "ACM Press" )
@STRING( ACMPFS = {ACM Press Frontier Series})
@STRING( CAMBPRESS = "Cambridge University Press" )
@STRING( MKPINC = "Morgan Kaufmann Publishers, Inc." )
@STRING( PHI = "Prentice-Hall, Inc." )
@STRING( UNKNOWN = "Unknown" )
@STRING( WILEY = "John Wiley \& Sons")
@STRING( MCGH = {McGraw-Hill})
@STRING( AMS = {American Mathematical Society} )
@STRING( ESP = {Elsevier Science Publisher} )
		  
%
% INSTITUTIONS
%

% FRANCE

@STRING( ESE = {{\'E}cole Sup{\'e}rieure d'{\'E}lectricit{\'e}})
@STRING( POLY = "{\'E}cole Polytechnique " )
@STRING( LIX = {{\'E}cole Polytechnique, Laboratoire d'Informatique} )  
@STRING( MINES = "{\'E}cole des Mines de Paris" )
@STRING( ENSMP = "{\'E}cole des Mines de Paris" )
@STRING( CRI-ENSMP = "CRI, {\'E}cole des Mines de Paris" )
@STRING( ULM = {{\'E}cole Normale Sup{\'e}rieure, Paris})
@STRING( ENS-LYON = "ENS-Lyon" )
@STRING( LIP = {LIP, ENS-Lyon} )
@STRING( ARTS = {Conservatoire National des Arts et M{\'e}tiers})
@STRING( PARIS-6 = "Universit{\'e} Paris VI " )
@STRING( INPG = "Institut National Polytechnique de Grenoble " )
@STRING( IMAG = {Informatique et Math{\'e}matiques Appliqu{\'e}es Grenoble })
@STRING( INRIA = "INRIA " )
@STRING( IRISA = "IRISA " )
@STRING( CEA = "Commissariat \`{a} l'{\'E}nergie Atomique " )


% ETRANGER


@STRING( BELLCORE = "Bellcore " )
@STRING( SEI-CMU = "Software Engineering Institute, Carnegie Mellon University{}" )
@STRING( SCS-CMU = "School of Computer Science, Carnegie Mellon University{}" )
@STRING( HPCC-GNRISC = {High Performance Computing Center, German National
        	Research Institute for Computer Science} )
@STRING( NAS-NASA = "Numerical Aerodynamique Simulation Systems Division, NASA ")
@STRING( OGIST = "Oregon Graduate Institute of Science and Technology" )
@STRING( ORNL = "Oak Ridge National Laboratory, Oak Ridge, Tennessee " )
@STRING( PURDUE = "Purdue University " )
@STRING( RICE = "Rice University, Houston, Texas" )
@STRING( SOUTHAMPTON = "University of Southampton" )
@STRING( STANFORD = "Stanford University" )
@STRING( SYRACUSE = "Syracuse University, Syracuse, New-york" )
@STRING( VIENNA = "University of Vienna " )
@STRING( YALE = "Yale University" )
% @STRING( CSRD = {Center for Supercomputing Research and Development,}) 
@STRING( CSRD = {CSRD, University of Illinois} )
@STRING( ILLINOIS = "University of Illinois at Urbana-Champaign" )
@STRING( CWI = {Centrum voor Wiskunde en Informatica, Amsterdam} )
@STRING( MARYLAND = {University of Maryland, College Park} )
@STRING( PASSAU = {Fakult{\"a}t f{\"u}r Mathematik und Informatik, Universit{\"a}t Passau})

%
% PUBLIS DE L'ACM:
%

@STRING(ACMCS = { ACM Computing Surveys})
@STRING(JACM = { Journal of the ACM})
@STRING(TOCS = { ACM Transactions on Computer Systems})
@STRING(TODS = { ACM Transactions on Database Systems})
@STRING(TOG = { ACM Transactions on Graphics})
@STRING(TOMS = { ACM Transactions on Mathematical Software})
@STRING(TOOIS = { ACM Transactions on Office Information Systems})
@STRING(TOPLAS = { ACM Transactions on Programming Languages and Systems})
@STRING(LOPLAS = { ACM Letters on Programming Languages and Systems})
@STRING(SIGARCHN = { ACM SIGARCH Computer Architecture Newsletter})
@STRING(SIGMICRON = { ACM SIG Micro Newsletter})
@STRING(SIGPLAN = { ACM SIGPLAN Notices})
@STRING(CACM = {Communications of the ACM})
@STRING(ACMCS = { ACM Computing Surveys})
@STRING(ACMOSR = { ACM Operating System Review})

%
% PUBLIS D'IEEE:
%

@STRING(COMP = {Computer})
@STRING(PIEEE = { Proceedings of the IEEE})
@STRING(IEEECOM = { IEEE Transactions on Communications})
@STRING(IEEECGA = { IEEE Computer Graphics and Applications})
@STRING(IEEEDT = { IEEE Design \& Test})
@STRING(IEEETOSE = { IEEE Transactions on Software Engineering})
@STRING(IEEES = { IEEE Software})
@STRING(IEEETOC = { IEEE Transactions on Computers})
@STRING(IEEEMICRO = { IEEE Micro})
@STRING(IEEESPECTRUM = { IEEE Spectrum})
@STRING(IEEETPDS = { IEEE Transactions on Parallel and Distributed Systems})
@STRING(CSPIEEE = { Computer Society Press of the IEEE})
@STRING(IEEECSP = { IEEE Computer Society Press})
@STRING(IEEEPDTSA = { IEEE Parallel and Distributed Technology Systems
			and Applications})

%
% AUTRES PUBLICATIONS
%

@STRING(JCSS = {J. Comput. Syst. Sci.})
@STRING(ACTINF = {Acta Informatica})
@STRING(PARCOMP = {Parallel Computing})
@STRING(SCPROG = {Scientific Programming})
@STRING(COMPJ = {The Computer Journal})
@STRING(JPDC = {Journal of Parallel and Distributed Computing})
@STRING(JSUPCOMP = {The Journal of Supercomputing})
@STRING(CPE = {Concurrency : Practice and Experience})
@STRING(SPE = {Software : Practice and Experience})
@STRING(IJPP = {International Journal of Parallel Programming})
@STRING(TSI = {Techniques et Sciences Informatiques})
@STRING(SCP = {Science of Computer Programming})
@STRING(PCR = {Parallel Computing Research})
@STRING(PPL = {Parallel Processing Letters})

%
% WORKSHOPS ET CONFERENCES ET SYMPOSIUMS
%

@STRING(PLDI = {International Conference on Programming 
		Language Design and Implementation})
@STRING(ACM-SCC ={ACM SIGPLAN Symposium on Compiler Construction})
@STRING(ICPP = {International Conference on Parallel Processing})
@STRING(ICS = {International Conference on Supercomputing})
@STRING(JSPP = {Joint Symposium on Parallel Processing})
@STRING(LCPC = {Languages and Compilers for Parallel Computing})
@STRING(POPL = {Symposium on Principles of Programming Languages} )
@STRING(PPOPP = {Symposium on Principles and Practice of Parallel Programming})
@STRING(SHPCC = {Scalable High Performance Computing Conference})
@STRING(SOUTH93 = {Workshop on Portability and Performance for Parallel
		Computers, Southampton})
@STRING(ICSE = {International Conference on Software Engineering})
@STRING(WCACTFMGP = { Working Conference on Architectures and 
	Compilation Techniques for Fine and Medium Grain Parallelism})
@STRING(MPCOMP90 = {Third Symposium on the Frontiers of Massively
	Parallel Computation})
@STRING(WETPSC = {Workshop on Environments and Tools for Parallel Scientific
	Computing})
@STRING(CC = {International Conference on Compiler Construction})
@STRING(ICCI = {International Conference on Computing and Information})
@STRING(WLCDMM = {Workshop on Languages and Compilers for Distributed Memory Machines})
@STRING(ICDCS = {International Conference on Distributed Computing Systems})
@STRING(ICSS = {International Conference on System Sciences})
@STRING(CSC = {ACM Computer Science Conference})
@STRING(VIENNA92 = {Third Workshop on Compilers for Parallel Computers})
@STRING(PORTLAND93 = {Sixth International Workshop on Languages and Compilers for Parallel Computing})
@STRING(DELFT93 = {Fourth International Workshop on Compilers for Parallel Computers})
@STRING(MALAGA95 = {Fifth International Workshop on Compilers for Parallel Computers})
@STRING(ICCL = {IEEE International Conference on Computer Language})
@STRING(HPCN = {High Performance Computing and Networking Conference})
@STRING(RENPAR = {Rencontres Francophones du Parall{\'e}lisme})
@STRING(JSEH = {Journ{\'e}es du Site Exp{\'e}rimental en Hyperparall{\'e}lisme})
@STRING(SAS = {Static Analysis Symposium})
@STRING(PPSC = {Siam Conference on Parallel Processing for Scientific Computing})
@STRING(IPPS = {International Parallel Processing Symposium})
@STRING(ASPLOS = {International Conference on Architectural Support for
		  Programming  Languages and Operating Systems})
@STRING(HPCS = {High Performance Computing Symposium})
@STRING(LCTRTS = {Workshop on Languages, Compilers and Tools for Real-Time
		  Systems})	
@STRING(SC = {Supercomputing})
	  	  
		  
%----------------------------------------------------------------------------------------

%
% -A-
%


@INPROCEEDINGS{Adl:95a,
	AUTHOR = {Adl-Tabatabai, Ali-Reza and Gross, Thomas},
	TITLE ={Engineering a Global optimizer and Code Generator for Reuse},
	INDEX ={\indexbib{}},
	BOOKTITLE = malaga95,
	YEAR = 1995,
	MONTH = jun,
	PAGES = {395--407},
	SUMMARY = {\references{16}}
}



@INPROCEEDINGS{Agra:94,
	AUTHOR = {Agrawal, Gagan and Saltz, Joel},
	TITLE ={Interprocedural Communication Optimizations for Distributed
		  Memory Compilation},
	INDEX ={\indexbib{optimisation/transformation!communications}
		  \indexbib{analyse interproc{\'e}durale}},
	BOOKTITLE = lcpc,
	YEAR =1994 ,
	MONTH = aug,
	PAGES = {19.1--19.16},
	SUMMARY = {\references{35}}
}

@INPROCEEDINGS{Agra:95a,
	AUTHOR = {Agrawal, Gagan and Saltz, Joel},
	TITLE ={Interprocedural Partial Redundancy Elimination and Its
		  Application to Distributed Memory Compilation},
	INDEX ={\indexbib{analyse interproc{\'e}durale}},
	BOOKTITLE = pldi,
	YEAR =1995,
	MONTH = jun,
	PAGES = {258--269},
        NOTE = {In} # sigplan,
	SUMMARY = {\references{25}}
}


@BOOK{Aho:86,
	AUTHOR = "  Aho, Alfred V. 
		and Sethi, Ravi 
		and Ullman, Jeffrey D.",
	TITLE ={Compilers Principles, Techniques, and Tools},
	INDEX ={\indexbib{compilation}
		\indexbib{analyse syntaxique}},
	PUBLISHER = aw,
	YEAR = 1986,
	SUMMARY = {{\em The {D}ragon {B}ook}. 
                   Tout ce qu'il faut savoir sur la compilation}
}

@ARTICLE{Alle:70,
	AUTHOR = {Allen, F. E.},
	TITLE = {Control Flow Analysis},
	INDEX ={\indexbib{analyse flot de donn{\'e}es!scalaires}},
	YEAR = 1970,
	JOURNAL = sigplan,
	VOLUME = 5,
	NUMBER = 7,
	PAGES = {1--19},
}


@INPROCEEDINGS{Alle:74,
	AUTHOR = {Allen, F. E.},
	TITLE ={Interprocedural Data Flow Analysis},
	INDEX ={\indexbib{analyse flot de donn{\'e}es!scalaires}
                \indexbib{analyse interproc{\'e}durale!scalaires}},
	BOOKTITLE = {Proceedings of the IFIP Congress},
	YEAR = 1974,
	PAGES = {398--402},
	SUMMARY = {je ne l'ai pas. cf~\cite{Ryde:86}.}
}



@ARTICLE{Alle:77,
	AUTHOR = {Allen, F. E. and Cocke, J},
	TITLE = {A Program Data Flow Analysis Procedure},
	INDEX ={\indexbib{analyse flot de donn{\'e}es!scalaires}},
	YEAR = 1977,
	MONTH = mar,
	JOURNAL = cacm,
	VOLUME = 19,
	NUMBER = 3,
	PAGES = {137--147},
	SUMMARY = {je ne l'ai pas. cf~\cite{Ryde:86}.}
}

@ARTICLE{Alle:88,
	AUTHOR = {Allen, Frances and Burke, Michael and Charles, Philippe and
		  Cytron, Ron and Ferrante, Jeanne},
	TITLE = {An Overview of the {PTRAN} Analysis System for Multiprocessing},
	INDEX ={\indexbib{parall{\'e}lisation!automatique}
		  \indexbib{parall{\'e}liseur!PTRAN}},
	YEAR = 1988,
	JOURNAL = jpdc,
	VOLUME = 5,
	PAGES = {617--640},
	SUMMARY = {Description rapide de PTRAN. Pas grand chose sur les
		  tableaux. Il est juste dit que les r{\'e}f{\'e}rences sont
		  lin{\'e}aris{\'e}s pour l'analyse des d{\'e}pendances. \references{41}}
}



@BOOK{Alma:89,
	AUTHOR = "Almasi, G.
		and Gottlieb, A.  ",
	TITLE ={Highly Parallel Computing},
	INDEX ={\indexbib{parall{\'e}lisme}
		\indexbib{parall{\'e}lisation automatique}},
	PUBLISHER = "{The Benjamin/Cummings Publishing Company, Inc}",
	YEAR = 1989,
	SUMMARY = {Traite du parall{\'e}lisme aussi bien du point de vue 
		  architecture que du point de vue logiciel. Des
		  g{\'e}n{\'e}ralit{\'e}s int{\'e}ressantes sur les 
		  compilateurs et la parall{\'e}lisation automatique}
}



@INPROCEEDINGS{Alpe:88,
	AUTHOR = {Alpern, B. and Wegman, M.N. and Zadeck, F.K.},
	TITLE ={Detecting Equality of Variables in Programs},
	INDEX ={\indexbib{analyse s{\'e}mantique}},
	BOOKTITLE = popl,
	YEAR = 1988,
	MONTH = jan,
	PAGES = {1--11},
	SUMMARY = {This paper presents an algorithm for detexting when two
		  computations produce equivalent values. This is different
		  from {\em value numbering} which is essentially symbolic
		  execution. For that purpose, it annotates the SSA form of
		  the program with the nodes of a {\em value graph}
		  representing the symbolic execution of the
		  program. It describes clearly how the SSA form is
		  computed, using $\Phi$-functions. L'approche est dite
		  optimiste, dans le sens o\`{u} toutes les variables sont
		  consid{\'e}r{\'e}es {\'e}quivalentes au d{\'e}part. Un algorithme de
		  partitionnement se charge ensuite de r{\'e}partir les
		  variables dans des classes de congruence. \references{17}}
		  
}


@INPROCEEDINGS{Alt:95a},
	AUTHOR = {Alt, Martin and Martin, Florian},
	TITLE ={Generation of Efficient Interprocedural Analyzers with {PAG}},
	INDEX ={\indexbib{}},
	BOOKTITLE = sas,
	YEAR = 1995,
	NOTE = {LNCS, p.33--50},
	SUMMARY = {\references{25}}
}
		  
		  
@TECHREPORT{Amag:95a,
	AUTHOR = {Amagbegnon, Toch{\'e}ou Pascalin and Le Guernic, Paul and
		  Marchand, Herv{\'e} and Rutten, {\'E}ric},
	TITLE ={The Signal Data Flow Methodology Applied to a Production Cell},
	INDEX ={\indexbib{}},
	YEAR = 1995,
	MONTH = mar,
	INSTITUTION = inria,
	TYPE = {Rapport de Recherche},
	NUMBER = 2522,
	SUMMARY = {Entre autres, encodage des propri{\'e}t{\'e}s d'un programme en
		  utillisant les polyn{\^o}mes sur $Z/3Z$. \references{18}}
}

@ARTICLE{Amar:92a,
	AUTHOR = {Amarguellat, Zahira},
	TITLE = {A Control-Flow Normalization Algorithm and Its Complexity},
	INDEX ={\indexbib{compilation} \indexbib{analyse flot de contr{\^o}le}},
	YEAR = 1992,
	MONTH = mar,
	JOURNAL = ieeetose,
	VOLUME = 18,
	NUMBER = 3,
	PAGES = {237--251},
	SUMMARY = {\references{48}}
}
		  

@INPROCEEDINGS{Amar:93a,
	AUTHOR = {Amarasinghe, Saman and Lam, Monica},
	TITLE ={Communication Optimization and Code Generation for
		  Distributed Memory Machines},
	INDEX ={\indexbib{optimisation/transformations!communications}
		  \indexbib{g{\'e}n{\'e}ration de code}},
	BOOKTITLE = pldi,
	YEAR = 1993,
	MONTH = jun,
	PAGES = {126--138},
	NOTE = {In } # sigplan,
	SUMMARY = {\references{28}}
}




@INPROCEEDINGS{Anco:91a,
	AUTHOR = "  Ancourt, Corinne
		and Irigoin, Fran\c{c}ois",
	TITLE ={Scanning Polyhedra with {DO} Loops},
	INDEX ={\indexbib{math{\'e}matiques!poly\`{e}dres}
		  \indexbib{g{\'e}n{\'e}ration de code}},
	BOOKTITLE = ppopp,
	YEAR = 1991,
	MONTH = apr,
	PAGES = {39--50},	  
	NOTE = {},
	SUMMARY = {Montre que la plupart des transformations de boucles
		peuvent s'exprimer \`{a} l'aide de transformations affines sur
		des poly\`{e}dres en nombres entiers.  La section 5 comporte
		les conditions n{\'e}cessaires de projection exacte.
		\references{33}} }

@PHDTHESIS{Anco:91b,
	AUTHOR = {Ancourt, Corinne},
	TITLE ={G{\'e}n{\'e}ration de code pour multiprocesseurs \`{a} m{\'e}moires locales},
	INDEX ={\indexbib{math{\'e}matiques!poly\`{e}dres}
		  \indexbib{g{\'e}n{\'e}ration de code}},
	SCHOOL = paris-6,
	YEAR = 1991,
	MONTH = {mars},
	SUMMARY = {\references{98}}
}



@TECHREPORT{Anco:91c,
	AUTHOR = {Ancourt, Corinne},
	TITLE ={G{\'e}n{\'e}ration de Code pour Multiprocesseurs \`{a} M{\'e}moires Locales},
	INDEX ={\indexbib{math{\'e}matiques!poly\`{e}dres}
		  \indexbib{g{\'e}n{\'e}ration de code}},
	YEAR = 1991,
	MONTH = {Mars},
	INSTITUTION = paris-6,
	TYPE = {Th\`{e}se de doctorat},
	SUMMARY = {\references{98}}
}



@INPROCEEDINGS{Anco:93,
	AUTHOR = {C. Ancourt and F. Irigoin and F. Coelho and R. Keryell},
	TITLE ={A Linear Algebra Framework for Static {HPF} Code Distribution},
	INDEX ={\indexbib{langage!HPF}
		  \indexbib{distribution!calcul}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "117--132",
	SUMMARY = {\references{39}}
}


@INPROCEEDINGS{Ande:95a,
	AUTHOR = {Anderson, Jennifer and Amarasinghe, Saman and Lam, Monica},
	TITLE ={Data and Computation Transformations for Multiprocessors},
	INDEX ={\indexbib{}},
	BOOKTITLE = ppopp,
	YEAR = 1995,
	MONTH = july,
	SUMMARY = {\references{35}}
}
		  
		  
@ARTICLE{Andr:88,
	AUTHOR = {Andr{\'e}, Fran\c{c}oise and Pazat, Jean-Louis},
	TITLE = {Le placement de T{\^a}ches sur des Architectures Parall\`{e}les},
	INDEX ={\indexbib{placement de processus}},
	YEAR = 1988,
	JOURNAL = tsi,
	VOLUME = 7,
	NUMBER = 4,
	PAGES = {385--401},
}


@INPROCEEDINGS{Andr:93,
	AUTHOR = {F. Andr{\'e}},
	TITLE ={Commutative Loop Nests Distribution},
	INDEX ={\indexbib{distribution!calculs}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "345--350",
	SUMMARY = {\references{11}}
}



@TECHREPORT{Andr:94,
	AUTHOR = {Andr{\'e}, Fran\c{c}oise and Le Fur, Marc and Mah{\'e}o, Yves and
		  Pazat, Jean-Louis},
	TITLE ={The {P}andore Compiler: Overview and Experimental Results},
	INDEX ={\indexbib{parall{\'e}liseur!Pandore}},
	YEAR = 1994,
	MONTH = oct,
	INSTITUTION = irisa,
	TYPE = {Publication Interne},
	NUMBER = 869,
	SUMMARY = {Run-time resolution, sauf boucle gentilles. \references{22}}
}


@UNPUBLISHED{Apvr:93a,
	AUTHOR = "Apvrille, B{\'e}atrice{} ",
	TITLE = "Parall{\'e}lisation automatique de langages \`{a} objets \`{a}
		  partir d'un m{\'e}canisme de temps virtuel",
	INDEX ={\indexbib{langage!\`{a} objets}
		\indexbib{parall{\'e}lisation!dynamique}
		\indexbib{temps virtuel!time warp}},
	YEAR = 1993,
	MONTH = "mars",
	NOTE = "rapport interne ESE{} ",
	SUMMARY = {Utilisation d'un m{\'e}canisme de temps virtuel optimiste,
		 le Time Warp, pour parall{\'e}liser dynamiquement du code
		 Smalltalk : probl\`{e}mes et solutions} }


@UNPUBLISHED{Apvr:93b,
	AUTHOR = "Apvrille, B{\'e}atrice{} ",
	TITLE = {AURA, {{\'E}}diteur de {S}c{\'e}narios},
	INDEX = {\indexbib{langage!\`{a} objets}},
	YEAR = 1993,
	MONTH = "juin",
	NOTE = "Rapport de stage ESE 3\eme ann{\'e}e{} "
}

@TECHREPORT{Apvr:94a,
	AUTHOR = {Apvrille, B{\'e}atrice},
	TITLE ={{PIPS} : am{\'e}lioration du calcul des r{\'e}gions --
		rapport d'avancement },
	INDEX ={\indexbib{r{\'e}gions!poly\`{e}dres}},
	YEAR = 1994,
	MONTH = "janvier",
	INSTITUTION = cri-ensmp,
	TYPE = {Rapport Interne},
	NUMBER = {E/181/CRI},
	SUMMARY = { Ce rapport pr{\'e}sente l'avancement de mes travaux au 3
		janvier 1994 sur l'am{\'e}lioration du calcul des r{\'e}gions de
		tableaux dans PIPS. L'enjeu est d'obtenir des r{\'e}gions
		suffisamment pr{\'e}cises, au niveau des pr{\'e}dicats comme des
		approximations, pour envisager de les utiliser pour la
		privatisation de tableaux.

		La premi\`{e}re section rappelle l'algorithme de calcul des
		r{\'e}gions tel qu'il a {\'e}t{\'e} implant{\'e} par Alexis Platonoff
		en 1990, et expose les probl\`{e}mes qui se posent. La
		deuxi\`{e}me section d{\'e}crit quelques modifications apport{\'e}es
		\`{a} l'algorithme pr{\'e}c{\'e}dent, qui permettent de pr{\'e}server
		les approximations MUST dans un plus grand nombre de cas;
		elle donne {\'e}galement les limites de ces
		am{\'e}liorations. Enfin, un nouvel algorithme de calcul des
		r{\'e}gions d'un bloc lin{\'e}aire d'instructions complexes est
		pr{\'e}sent{\'e} dans la troisi\`{e}me partie, ainsi que la preuve de
		sa correction (conservation des r{\'e}gions MAY) et de son
		int{\'e}r{\^e}t (r{\'e}gions plus pr{\'e}cises). \references{8}} }


@INPROCEEDINGS{Apvr:94b,
	AUTHOR = {Apvrille, B{\'e}atrice},
	TITLE ={Calcul de r{\'e}gions de tableaux exactes},
	INDEX ={\indexbib{r{\'e}gions!poly\`{e}dres}},
	BOOKTITLE = renpar,
	YEAR = 1994,
	MONTH = jun,
	PAGES = {65--68},
	SUMMARY = {\references{14}}
}





@ARTICLE{Apvr:94bb,
	AUTHOR = {Apvrille-Creusillet, B{\'e}atrice},
	TITLE = {Calcul de r{\'e}gions de tableaux exactes},
	INDEX ={\indexbib{r{\'e}gions!poly\`{e}dres}},
	YEAR = 1995,
	MONTH = {mai},
	JOURNAL = {TSI, Num{\'e}ro sp{\'e}cial RenPar'6},
	VOLUME = 14,
	NUMBER = 5,
	PAGES = {585--600},
	SUMMARY = {\references{21}}
}



@MASTERSTHESIS{Apvr:94c,
	AUTHOR = {Apvrille-Creusillet, B{\'e}atrice},
	TITLE ={R{\'e}gions Exactes et Privatisation de Tableaux ({E}xact array
		  region analyses and array privatization)},
	INDEX ={\indexbib{optimisation/transformations!privatisation de tableaux}
                \indexbib{analyse flot de donn{\'e}es!tableaux}
		  \indexbib{r{\'e}gions!poly\`{e}dres}},
	SCHOOL = {Universit{\'e} Paris~VI, France},
	YEAR = 1994,
	MONTH = sep,
        NOTE = {Available via {\footnotesize \tt
		  http://www.cri.ensmp.fr/\verb+~+creusil}}, 
	SUMMARY = {\references{61}}
}



@TECHREPORT{Apvr:94cc,
	AUTHOR = {Apvrille-Creusillet, B{\'e}atrice},
	TITLE ={R{\'e}gions exactes et privatisation de tableaux},
	INDEX ={\indexbib{optimisation/transformations!privatisation de tableaux}
                \indexbib{analyse flot de donn{\'e}es!tableaux}
		  \indexbib{r{\'e}gions!poly\`{e}dres}},
	YEAR = 1994,
	MONTH = {septembre},
	INSTITUTION = paris-6,
	TYPE = {Rapport de {DEA} {S}yst\`{e}mes {I}nformatiques},
        NOTE = {Disponible sous {\footnotesize \tt
		  http://www.cri.ensmp.fr/\verb+~+creusil}},
	SUMMARY = {\references{61}}
}


@INPROCEEDINGS{Apvr:94d,
	AUTHOR = {Apvrille, B{\'e}atrice and Irigoin, Fran\c{c}ois},
	TITLE ={Analyses Interproc{\'e}durales},
	INDEX ={\indexbib{analyse interproc{\'e}durale}},
	BOOKTITLE = jseh,
	YEAR = 1994,
	MONTH = jan,
	PAGES = {372--399},
	NOTE = {Copies de transparents},
}


@INPROCEEDINGS{Assm:93,
	AUTHOR = {U. Assmann and H. van Someren and M. Alt},
	TITLE ={Compilers for Parallel Architectures : The {COMPARE} Project},
	INDEX ={\indexbib{parall{\'e}liseur!Compare}
		\indexbib{ma th\`{e}se}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "451--454",
	
}



@UNPUBLISHED{Aust:94,
	AUTHOR = {Austin, Todd M. and Breach, Scott E. and Sohi, Gurindar, S.},
	TITLE ={Efficient Detection of All Pointer and Array Access Errors},
	INDEX ={\indexbib{compilation!d{\'e}tection erreurs}},
	YEAR = 1994,
	NOTE = {submitted to PLDI'94, do not cite},
	SUMMARY = {Ils remplacent les pointeurs C traditionnels par des
		  pointeurs am{\'e}lior{\'e}s (gr{\^a}ce \`{a} la surcharge
		  d'op{\'e}rateurs permise par C++). Cela permet de v{\'e}rifier
		  les acc\`{e}s au moment de l'ex{\'e}cution en rajoutant des
		  tests \`{a} chaque d{\'e}r{\'e}f{\'e}rencement. Co{\^u}teux. Analyse
		  statique envisag{\'e}e pour r{\'e}duire le nombre de tests
		  (comme dans \cite{Gupt:93}, mais la conclusion n'est pas
		  tr\`{e}s optimiste). \references{15}}
}



@INPROCEEDINGS{Aygu:93,
	AUTHOR = {E. Ayguad{\'e} and J. Labarta and J. Garcia and M. Girones
		and M. Valero},
	TITLE ={A Study of Data Sets and Affinity in the {P}erfect {C}lub},
	INDEX ={\indexbib{}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "5--16",
	SUMMARY = {\references{6}}
}

%
% -B-
%

@UNPUBLISHED{Bacq:93,
	AUTHOR = {Bacquet, Fr{\'e}d{\'e}ric},
	TITLE ={Parall{\'e}lisation d'un code de calcul d'ondes sismiques 3{D}},
	INDEX ={\indexbib{parall{\'e}liseur!Forge90}},
	YEAR = 1993,
	INSTITUTION = ensmp,
	MONTH = {septembre},
	NOTE = {rapport de stage IBM SEMEA S.p.A},
	SUMMARY = {Utilisation de Forge~90 et xHPF pour parall{\'e}liser un
                   programme de l'IFP} }

@INPROCEEDINGS{Bal:93,
	AUTHOR = {H.E. Bal and M.F. Kaashoek},
	TITLE ={Object Distribution in {O}rca using Compile-time and
		  Run-time Techniques},
	INDEX ={\indexbib{langage!\`{a} objets}
		\indexbib{distribution!donn{\'e}es}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "246--261",
	SUMMARY = {\references{37}}
}


@ARTICLE{Bala:94,
	AUTHOR = {Balasa, Florin and Franssen, Frank and Catthoor, Francky
		  and De Man, Hugo},
	TITLE = {Transformation of Nested Loops with Modulo Indexing to
		  Affine Recurrences},
	INDEX ={\indexbib{optimisation/transformations}},
	YEAR = 1994,
	JOURNAL = ppl,
	VOLUME = 4,
	NUMBER = 3,
	PAGES = {272--280},
	SUMMARY = {\references{18}}
}



@INPROCEEDINGS{Bala:89,
	AUTHOR = "  Balasundaram, V.
		and Kennedy, K.",
	TITLE ={A technique for summarizing data access and its use in parallelism 
		enhancing transformations},
	INDEX = {\indexbib{parall{\'e}lisation!automatique}
		\indexbib{regions!RSD/DAD}},
	BOOKTITLE = pldi,
	YEAR = 1989,
	MONTH = jun,
	PAGES = "41--53",
	NOTE = {},
	SUMMARY = {Pr{\'e}sentation des {\em Data Access Descriptors} ou {\em
		DAD}, bas{\'e}s sur les sections simples qui sont des syst\`{e}me
		de poly\`{e}dres convexes dont les bords sont parall\`{e}les aux
		axes ou bien aux diagonales. Les algorithmes d'union et
		d'intersection ont une meilleure complexit{\'e} que ceux
		utilis{\'e}s pour les r{\'e}gions dans PIPS. Mais ils ne disent
		pas ce qu'ils font quand les variables scalaires varient \`{a}
		l'int{\'e}rieur du corps de la proc{\'e}dure consid{\'e}r{\'e}e.
		\references{11}} }


@BOOK{Balf:79,
	AUTHOR = "Balfour, A.
		and Marwick, D. ",
	TITLE ={Programming in Standard Fortran 77},
	INDEX ={\indexbib{langage!Fortran}},
	PUBLISHER = "{Heinemann Educationnal Books}",
	YEAR = 1979,
	SUMMARY = {L'accent est mis sur le standard de programmation en Fortran. Un
			bon livre, avec de nombreux exercices.}
}


@TECHREPORT{Bana:87,
	AUTHOR = {Banawan, S.A.},
	TITLE ={A Distributed Load Balancing Policy for a Multicomputer},
	INDEX ={\indexbib{placement de processus!dynamique}},
	YEAR = 1987,
	MONTH = aug,
	INSTITUTION = {Berkeley},
	TYPE = {Technical Report},
	NUMBER = {87--08--02},
}



@ARTICLE{Bane:93,
	AUTHOR = "Banerjee, Uptal 
		and Eigenmann, Rudolf
		and Nicolau, Alexandru
		and Padua, David A.",
	TITLE = {Automatic Program Parallelisation},
	INDEX = {\indexbib{parall{\'e}lisation!automatique}
		 \indexbib{optimisation/transformations}
		 \indexbib{performances}},
	JOURNAL = pieee,
	YEAR = 1993,
	MONTH = feb,
	VOLUME = 81,
	NUMBER = 2,
	SUMMARY = {Pr{\'e}sente les techniques de parall{\'e}lisation
		automatiques. La premi\`{e}re partie, tr\`{e}s claire, traite de
		l'analyse des d{\'e}pendances. La deuxi\`{e}me pr{\'e}sente les
		diff{\'e}rentes transformations de programmes. Et la troisi\`{e}me
		partie s'int{\'e}resse aux {\'e}tudes exp{\'e}rimentales sur les
		performances des parall{\'e}liseurs. Cet article indique que
		les meilleures performances obtenues l'ont {\'e}t{\'e} en
		utilisant les techniques de privatisation de tableaux, de
		reconnaissance des r{\'e}ductions, et de reconnaisance des
		formes complexes de variables d'induction. Le besoin
		d'analyse interproc{\'e}durale est {\'e}galement
		soulign{\'e}. \references{148}} }
	

@INPROCEEDINGS{Bann:79,
	AUTHOR = {Banning, J.},
	TITLE ={An Efficient Way to Find the Side Effects of Procedure Calls
		  and the Aliases of Variables},
	INDEX ={\indexbib{analyse interproc{\'e}durale!scalaires}},
	BOOKTITLE = popl,
	YEAR = 1979,
	MONTH = jan,
}


@TECHREPORT{Baro:91,
	AUTHOR = {Baron, Bruno},
	TITLE ={Construction Flexible et Coh{\'e}rente pour la Compilation
		  Interproc{\'e}durale},
	INDEX ={\indexbib{compilation}},
	YEAR = 1991,
	MONTH = {juillet},
	INSTITUTION = cri-ensmp,
	TYPE = {Rapport de DEA (Universit{\'e} Paris VI)},
	NUMBER = {E/157/CRI},
	NOTE = {},
	SUMMARY = {\references{8}}
}


@MANUAL{Baro:92,
	AUTHOR = " Baron, Bruno 
		and Irigoin, Fran\c{c}ois 
		and Jouvelot, Pierre ", 
	TITLE ={Projet PIPS, Manuel utilisateur du parall{\'e}liseur batch},
	INDEX ={\indexbib{parall{\'e}lisation!automatique}
		\indexbib{parall{\'e}liseur!PIPS}},
	NOTE = {rapport interne EMP-CRI E144},
}


@ARTICLE{Bart:78,
	AUTHOR = {Barth, J.M.},
	TITLE = {A Practical Interprocedural Data Flow Analysis Algorithm},
	INDEX ={\indexbib{analyse flot de donn{\'e}es!scalaires}
                \indexbib{analyse interproc{\'e}durale!scalaires}},
	YEAR = 1978,
	MONTH = sep,
	JOURNAL = cacm,
	VOLUME = 21,
	NUMBER = 9,
	PAGES = {724--736},
}


@INPROCEEDINGS{Benk:93,
	AUTHOR = {S. Benknner, P. Brezani, H.P. Zima},
	TITLE ={Compiling {High Performance Fortran} in the {Prepare} environment},
	INDEX ={\indexbib{langage!HPF}
		  \indexbib{parall{\'e}liseur!Prepare}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "105--116",
	SUMMARY = {\references{10}}
}


@BOOK{Berg:89,
	AUTHOR = {Bergstra, J.A. and Heering, J. and Klint, P.},
	TITLE = {Algebraic Specifications},
	INDEX ={\indexbib{types abstraits}},
	YEAR = 1989,
	PUBLISHER = acmpress,
	SUMMARY = {}
}


@ARTICLE{Bica:95,
	AUTHOR = {Bicarregui, Juan and Ritchie, Brian},
	TITLE = {Invariants, Frames and Postconditions: A Comparison of the
		  {VDM} and {B} notations},
	INDEX ={\indexbib{}},
	YEAR = 1995,
	MONTH = feb,
	JOURNAL = ieeetose,
	VOLUME = 21,
	NUMBER = 2,
	SUMMARY = {\references{9}}
}


@INPROCEEDINGS{Bik:95a,
	AUTHOR = {Bik, Aart and Wijshoff, Harry},
	TITLE ={Construction of Representative Simple Sections},
	INDEX ={\indexbib{r{\'e}gions!utilisations}},
	BOOKTITLE = icpp,
	YEAR = 1995,
	MONTH = aug,
	SUMMARY = {\`{A} partir d'une liste de {\em simple sections ou SS}
		  (i.e. DADs), construction d'une liste de SS disjointes
		  telle que toute SS de la premi\`{e}re liste est incluse dans
		  une SS de la deuxi\`{e}me. Sert pour la restructuration de
		  donn{\'e}es. \references{19}}
}


@INPROCEEDINGS{Bink:94,
	AUTHOR = "Binkley, David",
        TITLE = {Interprocedural Constant Propagation using Dependence 
		Graphs and a Data-Flow Model}, 
	INDEX ={\indexbib{analyse interproc{\'e}durale!scalaires}
		\indexbib{analyse d{\'e}pendances!scalaires}
		\indexbib{optimisation/transformations!propagation de constantes}},
	BOOKTITLE = cc,
        YEAR = 1994,
	MONTH = apr,
	SUMMARY = { Describes the first step in an attempt to have program
		optimizations 
		use a common intermediate representation of the program, the SDG,
		or system dependance graph. The optimization later studied is 
		intra- and inter-procedural constant propagation using the
		SDG, with 
		the ideas of data-flow computing and graph rewriting. reviewed}
}

@BOOK{Birk:67a,
	AUTHOR = {Birkhoff, Garrett},
	TITLE = {Lattice Theory},
	INDEX ={\indexbib{math{\'e}matiques!treillis}},
	YEAR = 1967,
	PUBLISHER = AMS,
	VOLUME = {XXV},
	SERIES =  {AMS Colloqium Publications},
	ADDRESS = {Providence, Rhode Island},
	EDITION = {Third},
	SUMMARY = {} 
}


@PHDTHESIS{Blaz:93,
	AUTHOR = {Blazy, Sandrine},
	TITLE ={Sp{\'e}cialisation de programme pour l'aide \`{a} la maintenance
		de logiciel},
	INDEX ={\indexbib{optimisation/transformations!{\'e}valuation partielle}},
	SCHOOL = arts,
	YEAR = 1993,
	MONTH = {d{\'e}cembre},
	SUMMARY = {\references{114}}
}


@ARTICLE{Blum:92,
	AUTHOR = {Blume, W. and Eigenmann, R.},
	TITLE = {Performance Analysis of Parallelizing Compilers on the
		{P}erfect {B}enchmarks Programs},
	INDEX ={\indexbib{performances}
		\indexbib{parall{\'e}lisation!automatique}},
	YEAR = 1992,
	MONTH = nov,
	JOURNAL = ieeetpds,
	VOLUME = 3,
	NUMBER = 6,
	PAGES = {643--656},
	SUMMARY = {Analyse des performances de deux parall{\'e}liseurs {\em
		Vast} et {\em Kap} sur la parall{\'e}lisation des programmes du
		Perfect Club. Les diverses transformations et analyses des
		compilateurs ont {\'e}t{\'e} analys{\'e}es une par une et
		globalement. Les r{\'e}sultats montrent que ces parall{\'e}liseurs
		ne sont pas tr\`{e}s performants dans la plupart des cas : ils
		ne parall{\'e}lisent pas les bonnes boucles, c'est-\`{a}-dire
		celles dans lesquelles on passe le plus de temps.  Les
		auteurs concluent \`{a} la n{\'e}cessit{\'e}s des analyses
		interproc{\'e}durales, de la privatisation de tableaux, de la
		reconnaissance des r{\'e}ductions \dots.  \references{33}} }


@TECHREPORT{Blum:94,
	AUTHOR = {Blume, W. and Eigenmann, R.},
	TITLE ={Symbolic Analysis Techniques Needed for the Effective
		  Parallelization of the {P}erfect {B}enchmarks},
	INDEX ={\indexbib{parall{\'e}lisation!besoins}},
	YEAR = 1994,
	INSTITUTION = CSRD,
	TYPE = {Report},
	NUMBER = 1332,
	SUMMARY = {\references{23}}
}

@INPROCEEDINGS{Blum:94b,
	AUTHOR = {Blume, W. and Eigenmann, R.},
	TITLE ={Symbolic Analysis Techniques Needed for the Effective
		  Parallelization of the {P}erfect {B}enchmarks},
	INDEX ={\indexbib{parall{\'e}lisation!besoins}},
        BOOKTITLE = icpp,
	YEAR = 1994,
	SUMMARY = { Conclusion = non linear symbolic analysis, constraint
		    propagation, array subcript analysis, run time tests. 
                    \references{23}}
}


@TECHREPORT{Blum:94c,
	AUTHOR = {Blume, Bill and Eigenmann, Rudolf and Faigin, Keith and
		  Grout, John and Hoeflinger, Jay and Padua, David and
		  Petersen, Paul and Pottenger, Bill and Rauchwerger,
		  Lawrence and Tu, Peng and Weatherford, Stephen},
	TITLE ={{P}olaris : The Next Generation in Parallelizing Compilers},
	INDEX ={\indexbib{parall{\'e}liseur!Polaris}},
	YEAR = 1994,
	INSTITUTION = csrd,
	TYPE = {CSRD report},
	NUMBER = 1375,
	SUMMARY = {Un concentr{\'e} des papiers publi{\'e}s sur Polaris jusqu'\`{a}
		  pr{\'e}sent : rien de bien
		  neuf. Voir~\cite{Blum:92,Rauc:94,Padu:93,Tu:93} \references{18}}
}



@TECHREPORT{Blum:94d,
	AUTHOR = {Blume, William and Eigenmann, Rudolf},
	TITLE ={The Range Test: A Dependence Test for Symbolic, Non-linear
		  Expressions  },
	INDEX ={\indexbib{analyse des d{\'e}pendances}},
	YEAR = 1994,
	MONTH = apr,
	INSTITUTION = csrd,
	TYPE = {Report},
	NUMBER = 1345,
	SUMMARY = {Description de ce nouveau test de d{\'e}pendances. Un point
		  important pour moi, la propagation des {\em range}, {\em
		  \`{a} la\/} Cousot. \references{24}}
}

@INPROCEEDINGS{Blum:94e,
	AUTHOR = {Blume, William and Eigenmann, Rudolf},
	TITLE ={The Range Test: A Dependence Test for Symbolic, Non-linear
		  Expressions  },
	INDEX ={\indexbib{analyse des d{\'e}pendances}},
        BOOKTITLE = ics, 
	YEAR = 1994,
	MONTH = nov,
        PAGES = {528--537},
	SUMMARY = {Description de ce nouveau test de d{\'e}pendances. Un point
		  important pour moi, la propagation des {\em range}, {\em
		  \`{a} la\/} Cousot. 
		  
		  La m{\'e}thode repose sur des tests de monotonie des
		  fonctions d'acc\`{e}s par rapport \`{a} un indice de boucle
		  donn{\'e}. Cela permet d'en d{\'e}duire la direction de la
		  d{\'e}pendance. Pour cela, il faut {\'e}tudier le signe d'une
		  diff{\'e}rence, dont l'expression  peut-{\^e}tre
		  non-lin{\'e}aire. Une solution partielle consiste \`{a} propager
		  des {\em range\/} pour les variables du progamme, qui sont
		  leurs bornes inf et sup. Ceci est fait par interpr{\'e}tation
		  abstraite {\em \`{a} la} Cousot-Halbwachs. Des op{\'e}rateurs
		  sur les ranges ont donc {\'e}t{\'e} d{\'e}finis. 
		  
		  Le tout permet de traiter des expressions symboliques du
		  style $x \times y$ mais aussi ${\^\i}x$.
		  
		  \references{24}
		  }
}


@TECHREPORT{Blum:94f,
	AUTHOR = {Blume, William and Eigenmann, Rudolf},
	TITLE ={Symbolic Range Propagation},
	INDEX ={\indexbib{analyse flot de donn{\'e}es!scalaires}},
	YEAR = 1994,
	MONTH = sep,
	INSTITUTION = csrd,
	TYPE = {Report},
	NUMBER = 1381,
	SUMMARY = {\references{24}}
}


@TECHREPORT{Boca:92,
	AUTHOR = {Bocage, Claude},
	TITLE ={Structures de Donn{\'e}es et Algorithmes},
	INDEX ={\indexbib{types de donn{\'e}es}},
	YEAR = 1992,
	MONTH = {avril},
	INSTITUTION = ese,
	TYPE = {Polycopi{\'e}},
	NUMBER = 3373,
	
}


@INPROCEEDINGS{Bodi:93,
	AUTHOR = {F. Bodin and L. Kervella and T. Priol},
	TITLE ={{FORTRAN-S} : A {F}ortran Interface for Parallel Programming},
	INDEX ={\indexbib{}},
        BOOKTITLE = delft93,	
	YEAR = 1993,
	MONTH = dec,
	PAGES = "81--91",
	SUMMARY = {\references{24}}
}


@TECHREPORT{Bodi:94,
	AUTHOR = {Bodin, F. and Eisenbeis, C. and Jalby, W. and Montaut,
		  T. and Rabain, P. and Windheiser, D.},
	TITLE ={Algorithms for Data Locality Optimization},
	INDEX ={\indexbib{analyse des d{\'e}pendances}
		  \indexbib{optimisation/transformations!localit{\'e}}
                \indexbib{architecture!cache}},
	YEAR = 1994,
	INSTITUTION = {APPARC},
	TYPE = {Deliverable},
	NUMBER = {CoD3},
	SUMMARY = {Utilisation de la technique des fen{\^e}tres pour d{\'e}tecter
		  la localit{\'e} temporelle. Transformations de programme pour
		  am{\'e}liorer la localit{\'e}.  \references{34}}
}


@INPROCEEDINGS{Bodi:95a,
	AUTHOR = {Bodi'k, Ratislav and Gupta, Rajiv},
	TITLE ={Array Data Flow Analysis for Load-Store Optimizations in
		  Superscalar Architectures},
	INDEX ={\indexbib{analyse flot de donn{\'e}es!tableaux}},
	BOOKTITLE = lcpc,
	YEAR = 1995,
	MONTH = aug,
	PAGES = {1.1--1.15},
	SUMMARY = {\references{18}}
}
		  

@TECHREPORT{Bohm:91,
	AUTHOR = {B\"{o}hm, A.P.W and Cann, D.C. and Feo, J.T. and Oldehoeft, R.R.},
	TITLE ={Sisal Reference Manual, Language Version 2.0},
	INDEX ={\indexbib{langage!dataflow}},
	YEAR = 1991,
	INSTITUTION = {Colorado State University},
	TYPE = {Technical Report},
	NUMBER = {CS-91-118},
	
}


@ARTICLE{Bokh:81,
	AUTHOR = {Bokhari, Shahid H.},
	TITLE = {On the Mapping Problem},
	INDEX ={\indexbib{placement de processus!statique}},
	YEAR = 1981,
	JOURNAL = ieeetoc,
	VOLUME = {C--30},
	NUMBER = 3,
	PAGES = {207--214},
	SUMMARY = {\references{12}}
}


@INPROCEEDINGS{Boll:88,
	AUTHOR = {Bollinger, S.W. and Midkiff, S.F.},
	TITLE ={Processor and Link Assignement in Multicomputers Using
		  Simulated Annealing},
	INDEX ={\indexbib{placement de processus!statique}},
	BOOKTITLE = icpp,
	YEAR = 1988,
	MONTH = aug,
	PAGES = {1--7},
}


@TECHREPORT{Bons:93,
	AUTHOR = {Bonsangue, Marcello and Kok, Joost N.},
	TITLE ={Isomorphisms Between Predicate and State Transformers},
	INDEX ={\indexbib{}},
	YEAR = 1993,
	INSTITUTION = cwi,
	TYPE = {Technical report},
	NUMBER = {CS-R9338},
	NOTE = {Available by anonymous ftp at {\tt \small ftp.cwi.nl} in {\tt
		  \small pub/CWIreports/AP/CS-R9338.ps.Z}.},
}



@INPROCEEDINGS{Bord:95a,
	AUTHOR = {Bordawekar, Rajesh and Choudhary, Alok},
	TITLE ={A Framework for representing Data Parallel Programs and Its
		  Application in Program Reordering},
	INDEX ={\indexbib{}},
	BOOKTITLE = malaga95,
	YEAR = 1995,
	MONTH = jun,
	PAGES = {370--394},
}


@TECHREPORT{Boul:94a,
	AUTHOR = {Boulet, Pierre and Dion, Mich\`{e}le and Lequiniou, {\'E}ric and
		  Risset, Tanguy},
	TITLE ={Reference Manual of the {B}ouclettes Parallelizer },
	INDEX ={\indexbib{parall{\'e}liseur!Bouclettes}},
	YEAR = 1994,
	MONTH = oct,
	INSTITUTION = lip,
	TYPE = {Research Report},
	NUMBER = {94-04},
	SUMMARY = {Description interne du parall{\'e}liseur {\em Bouclettes}
		  d{\'e}velopp{\'e} au LIP. En entr{\'e}e, il prend un nid de boucle
		  parfait uniforme. Il l'analyse, puis le r{\'e}{\'e}crit en un
		  nid de boucles parall\`{e}les dans lequel la boucle la plus
		  externe est s{\'e}quentielle et les boucles internes sont
		  parall\`{e}les. Implantation en Caml, interfac{\'e} avec PIP.
		  \references{6}}
}


@BOOK{Bour:67a,
	AUTHOR = {Bourbaki, Nicolas},
	TITLE = {Th{\'e}orie des Ensembles, Chapitre 3},
	INDEX ={\indexbib{math{\'e}matiques!treillis}},
	YEAR = 1967,
	PUBLISHER = {Hermann},
	SERIES = {{\'E}l{\'e}ments de math{\'e}matiques, Fascicule XX, Livre I},
	ADDRESS = {Paris, France},
	EDITION = {Second},
	SUMMARY = {}
}
		  
		  
@TECHREPORT{Bour:91,
	AUTHOR = {Bourda, Yolaine and Graner, Nicolas and Rousset,
		  Marie-Christine and Vidal-Naquet, Guy and Volle, Philippe},
	TITLE ={Informatique Th{\'e}orique},
	INDEX ={\indexbib{type de donn{\'e}es}},
	YEAR = 1991,
	MONTH = {janvier},
	INSTITUTION = ese,
	TYPE = {Polycopi{\'e}},
	NUMBER = 3315,
}


@PHDTHESIS{Bour:92a,
	AUTHOR = {Bourdoncle, Fran\c{c}ois},
	TITLE ={S{\'e}mantique des Langages imp{\'e}ratifs d'ordre sup{\'e}rieur et
		  interpr{\'e}tation abstraite},
	INDEX ={\indexbib{}},
	SCHOOL = poly,
	YEAR = 1992,
	MONTH = nov,
	SUMMARY = {\references{73}}
}

@ARTICLE{Boyl:96a,
	AUTHOR = {O'Boyle, M. and Bull, J.},
	TITLE = {Expert Programmer versus Parallelizing Compiler: A
		  Comparative Study of Two Approaches for Distributed Shared
		  Memory},
	INDEX ={\indexbib{}},
	YEAR = 1996,
	JOURNAL = {Scientific Programming},
	VOLUME = 5,
	NUMBER = 1,
	PAGES = {63--68},
	SUMMARY = {Conclusion: Le programmeur fait mieux que le compilateur
		  avanc{\'e} pour g{\'e}n{\'e}rer un programme pour la KSR-1 \`{a}
		  partir d'un programme s{\'e}quentiel. La diff{\'e}rence
		  essaentielle vient du fait que le programmeur fait tourner
		  le programme \`{a} chaque {\'e}tape de son processus de
		  parall{\'e}lisation pour obetnir un profiling, et ainsi
		  d{\'e}tecter les parties co{\^u}teuses \`{a} optimiser. Tr\`{e}s
		  honn{\^e}tement, je trouve que le compilateur fait pas mal
		  son travail. \references{19}}
}
		  
		  
@INPROCEEDINGS{Bran:88a,
	AUTHOR = {Brandes, Thomas},
	TITLE ={The Importance of Direct Dependences for Automatic Parallelization},
	INDEX ={\indexbib{}},
	BOOKTITLE = ics,
	YEAR = 1988,
	MONTH = jul,
	PAGES = {407--417},
	SUMMARY = {\references{13}}
}

		  
@INPROCEEDINGS{Bran:93,
	AUTHOR = {T. Brandes},
	TITLE ={Automatic Partitionning : A Case Study on the {ECMWF}'s 
		Weather Forecast Program ({2D} Case) },
	INDEX ={\indexbib{}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "17--32",
	SUMMARY = {\references{8}}
}


@INPROCEEDINGS{Bree:93,
	AUTHOR = {L.C. Breebaart},
	TITLE ={Experiences with Rule-based Compilation},
	INDEX ={\indexbib{}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "468--475",
	SUMMARY = {Compilation du langage Booster par {\'e}criture de r\`{e}gles.
		  \references{12}}
}



@TECHREPORT{Breu:93,
	AUTHOR = {van Breugel, Franck},
	TITLE ={Relating State Transformation Semantics and Predicate
		  Transformer Semantics for Parallel Programs},
	INDEX ={\indexbib{}},
	YEAR = 1993,
	INSTITUTION = cwi,
	TYPE = {Technical report},
	NUMBER = {CS-R9339},
	NOTE = {Available by anonymous ftp at {\tt \small ftp.cwi.nl} in {\tt
		  \small pub/CWIreports/AP/CS-R9339.ps.Z}.},
	SUMMARY = {\references{30}}
}


@ARTICLE{Burk:86,
	AUTHOR = {Burke, Michael and Cytron, Ron},
	TITLE = {Interprocedural Dependence Analysis and Parallelization},
	INDEX ={\indexbib{analyse interprocedurale!tableaux}
		  \indexbib{analyse des d{\'e}pendances!tableaux}},
	YEAR = 1986,
	MONTH = jul,
	JOURNAL = sigplan,
	VOLUME = 21,
	NUMBER = 7,
	PAGES = {162--175},
	SUMMARY = {
		  
		  Lin{\'e}arisation des acc\`{e}s aux {\'e}l{\'e}ments de tableaux. Pour
 		  analyse des d{\'e}pendences intra et
 		  interproc{\'e}durales. Avantages : permet de consid{\'e}rer
 		  toutes les dimensions \`{a} la fois, et enl\`{e}ve le pb de
 		  l'array reshape. Inconv{\'e}nient : conduit \`{a} des
 		  expressions d'indice non lin{\'e}aires, ne permet pas de
 		  raisonner dimension par dimension. Pas d'essai de
		  simplification comme dans ma m{\'e}thode.
		  
		  \references{19}} 
}

@ARTICLE{Burk:90,
	AUTHOR = {Burke, Michael},
	TITLE = {An Interval-Based Approach to Exhaustive and Incremental
		  Interprocedural Data-Flow Analysis},
	INDEX ={\indexbib{analyse flot de donn{\'e}es}
                \indexbib{analyse interproc{\'e}durale}
		  \indexbib{compilation!incr{\'e}mentale}},
	YEAR = 1990,
	MONTH = jul,
	JOURNAL = toplas,
	VOLUME = 12,
	NUMBER = 3,
	PAGES = {341--395},
	SUMMARY = {Tout le bazar avec treillis, calcul et parcours des
		  intervalles. \references{67}}
}


@ARTICLE{Burk:93,
	AUTHOR = {Burke, Michael and Torczon, Linda},
	TITLE ={Interprocedural Optimization: Eliminating Unnecessary
		  Recompilation},
	INDEX ={\indexbib{compilation!incr{\'e}mentale}
		\indexbib{analyse interproc{\'e}durale}},
	JOURNAL = toplas,
	YEAR = 1993,
	MONTH = jul,
	VOLUME = 15,
	NUMBER = 3,
	PAGES = "367--399",
	SUMMARY = {Ce papier pr{\'e}sente des algorithme de recompilation dans 
		un environnement interproc{\'e}dural. Le plan est le suivant : 
	\begin{itemize}
	\item Introduction : probleme, plan, {\'e}tat de l'art;
	\item Architecture logicielle du compilateur;
	\item Informations interproc{\'e}durales et leur repr{\'e}sentations 
	      (annotation sets);
	\item Cadre g{\'e}n{\'e}ral : pr{\'e}sentation du test de recompilation qui consiste 
	      en la comparaison des {\em annotation sets} sauvegard{\'e}s avec les 
	      nouvelles informations interproc{\'e}durales. Deux algorithmes
	      approximatifs sont pr{\'e}sent{\'e}s.
	\item Coop{\'e}ration du compilateur : m{\'e}thodologie permettant de
	      calculer des annotation sets plus pr{\'e}cis en laissant au
	      compilateur le soin de retenir les informations
	      interproc{\'e}durales qu'il utilise r{\'e}ellement;
	\item Utilisation par les phases d'optimisation intraproc{\'e}durales;
	\item Optimisation interproc{\'e}durale (changements dans le call graph);
	\item Am{\'e}lioration des optimisations apr\`{e}s recompilation;
 	\item resum{\'e} et conclusion.
	\end{itemize}

        \references{34}}
}



@INPROCEEDINGS{Burk:94,
	AUTHOR = {Burke, Michael and Carini, Paul and Choi, Jong-Deok and
		  Hind, Michael},
	TITLE ={Flow-insensitive Interprocedural Alias Analysis in the
		  Presence of Pointers},
	INDEX ={\indexbib{analyse interprocedurale!pointeurs}},
	BOOKTITLE = lcpc,
	YEAR = 1994,
	MONTH = aug,
	PAGES = {16.1--16.13},
}


%
% -C-
%

@ARTICLE{Cali:94,
	AUTHOR = {Calinescu, R. and Evans, D.J.},
	TITLE = {A parallel Simulation Model for Load Balancing in Clustered
		  Distributed Systems},
	INDEX ={\indexbib{{\'e}quilibrage de charge}},
	YEAR = 1994,
	MONTH = jan,
	JOURNAL = parcomp,
	VOLUME = 20,
	NUMBER = 1,
	PAGES = {77--91},
	SUMMARY = {\references{7}}
}




@ARTICLE{Call:88,
	AUTHOR = {Callahan, D.},
	TITLE = {The Program Summary Graph and Flow-Sensitive
		  Interprocedural Data-Flow Analysis},
	INDEX ={\indexbib{analyse interproc{\'e}durale!scalaires}},
	YEAR = 1988,
	MONTH = jul,
	JOURNAL = sigplan,
	VOLUME = 23,
	NUMBER = 7,
	PAGES = {47--56},
        NOTE = {Also published in the proceedings of the International
		  Conference on Programming Language Design and Implementation},
	SUMMARY = {Analyse interproc{\'e}durale sensible au flot de contr{\^o}le,
		  pour les variables scalaires. Pour cela, il utilise le
		  {\em program summary graph}, qui lui sert \`{a} propager les
		  informations. Cette propagation est effectu{\'e}e par point
		  fixe. Le treillis est particuli\`{e}rement simple : $\top$ et
		  $bottom$. Les flot de contr{\^o}le local est r{\'e}sum{\'e}e par
		  les {\em reaching information}, pour {\^e}tre ensuite
		  utilis{\'e} au niveau interproc{\'e}dural. \references{27}}
}


@ARTICLE{Call:88a,
	AUTHOR = "  Callahan, D.
		and Kennedy, K.",
	TITLE = {Analysis of Interprocedural Side Effects in a Parallel 
		Programming Environment},
	INDEX ={\indexbib{r{\'e}gions!SDD/DAD}
		\indexbib{analyse interpoc{\'e}durale!tableaux}},
	YEAR = 1988,
	JOURNAL = jpdc,
	VOLUME = 5,
	PAGES = "517--550",
	NOTE = {},
	SUMMARY = {D{\'e}finition des {\em Regular Section Descriptors} qui servent \`{a} 
		repr{\'e}senter des sections de tableaux de forme particuli\`{e}re :
		{\'e}l{\'e}ment, ligne, colonne, diagonale et leurs {\'e}quivalents dans
		les dimensions sup{\'e}rieures. Des modifications sont apport{\'e}es
		pour  permettre les analyses interproc{\'e}durales en cas d'array 
		reshaping. Calcul des array kill sets. Rq :  un RSD est de la
		forme $<A;theta>$ o\`{u} $\theta$ est un vecteur d'indices, et
		  $\theta_j$ 
		est soit une constante, soit de la forme $I_j+\alpha$ ou
		$-I_j+\alpha$, o\`{u} $\alpha$ est un invariant local au module. 

                De l'aveu m{\^e}me des auteurs, les {\em RSD} ainsi d{\'e}finis ne
		permettent pas de repr{\'e}senter les r{\'e}gions triangulaires et
		les lignes non contigues. \references{28}} 
}

@UNPUBLISHED{Camp:73,
	AUTHOR = {Campbell, R.H.
		and Habermann, A.N.},
	TITLE ={The Specification of Process Synchronization by Path Expression},
	INDEX ={\indexbib{synchronisation}},
	YEAR = 1973,
	MONTH = dec,
}


@TECHREPORT{Carl:89,
	AUTHOR = {Carlier, Thierry and Szafran, Nicolas},
	TITLE ={Structures de Donn{\'e}es pour la Repr{\'e}sentation et la
		  Manipulation des Poly\`{e}dres},
	INDEX ={\indexbib{math{\'e}matiques!poly\`{e}dres}},
	YEAR = 1989,
	MONTH = {mars},
	INSTITUTION = imag,
	TYPE = {Rapport de Recherche},
	NUMBER = {RR 772-M},
	SUMMARY = {Implantation logicielle. Plusieurs repr{\'e}sentations des
		  poly\`{e}dres 3-D sont propos{\'e}es. \references{8}}
}


@ARTICLE{Carr:94,
	AUTHOR = {Carr, Steve and Kennedy, Ken},
	TITLE = {Scalar Replacement in the Presence of Conditional Control Flow},
	INDEX ={\indexbib{analyse flot de donn{\'e}es!tableaux}},
	YEAR = 1994,
	MONTH = jan,
	JOURNAL = spe,
	VOLUME = 24,
	NUMBER = 1,
	PAGES = {51--77},
	SUMMARY = {But : utiliser les registres pour y stocker des
		  {\'e}l{\'e}ments de tableaux au lieu de ne stocker que des
		  scalaires. Ils faut donc d{\'e}tecter la r{\'e}utilisabilit{\'e}
		  de ces {\'e}l{\'e}ments. Se fait ici par une extension des
		  analyses data-flow classiques (ensembles USE et GEN) qui
		  s'occupent des statements et non des ensembles d'{\'e}l{\'e}ments
		  comme les r{\'e}gions. \references{11}}
}


@TECHREPORT{Cham:94a,
	AUTHOR = {Chamski, Zbigniew},
	TITLE ={Fast and Efficient Generation of Loops Bounds},
	INDEX ={\indexbib{g{\'e}n{\'e}ration de code}},
	YEAR = 1993,
	MONTH = {octobre},
	INSTITUTION = inria,
	TYPE = {Rapport de Recherche},
	NUMBER = 2095,
	SUMMARY = {G{\'e}n{\'e}ration d'un nid de boucles \`{a} partir d'un
		  poly\`{e}dre. Au lieu d'utiliser Fourier-Motzkin, il utilise PIP. En
		  fait, pour aller plus vite, il utilise un PIP parall\`{e}le. 
                  \references{8}}
}

@TECHREPORT{Cham:94b,
	AUTHOR = {Chamski, Zbigniew},
	TITLE ={Nested Loop Sequences : Towards Efficient Loop Structures in
		  Automatic Parallelization},
	INDEX ={\indexbib{g{\'e}n{\'e}ration de code}},
	YEAR = 1993,
	MONTH = {octobre},
	INSTITUTION = inria,
	TYPE = {Rapport de Recherche},
	NUMBER = 2094,
	SUMMARY = {Comment g{\'e}n{\'e}rer un nid de boucle \`{a} partir d'un
		  poly\`{e}dre. Ce nid de boucle n'est pas parfait. Chaque
		  corps de boucle est en r{\'e}alit{\'e} une s{\'e}quence de boucles.
		  Pour cela, il scinde les boucles qui devraient {\^e}tre
		  g{\'e}n{\'e}r{\'e}es en plusieurs morceaux, selon les n{\oe}uds du
		  graphe g{\'e}n{\'e}r{\'e} par PIP. \references{14}}
}

@UNPUBLISHED{Chap:94,
	AUTHOR = {Chapman, Barbara and Mehrotra, Piyush and Van Rosendale, John
		  and Zima, Hans},
	TITLE ={A Software Architecture for Multidisciplinary Applications :
		  Integrating Task and Data Parallelism},
	INDEX ={\indexbib{langage!Fortran 90}},
	YEAR = 1994,
	NOTE = {Given to fi by Peter Brezany. Fast version, to be improved},
	SUMMARY = {New Fortran 90 extensions to suppport task and data
		  parallelism. \references{17}}
}



@INPROCEEDINGS{Chap:95a,
	AUTHOR = {Chpaman, Barbara and Mehrotra, Piyush and Zima, Hans},
	TITLE ={Extending {HPF} for Advanced Data Parallel Apllications},
	INDEX ={\indexbib{langage!HPF}},
	BOOKTITLE = malaga95,
	YEAR = 1995,
	MONTH = jun,
	PAGES = {1--21},
	SUMMARY = {\references{18}}
}


@MASTERSTHESIS{Chass:90,
	AUTHOR = {Chassany, Philippe},
	TITLE ={Les M{\'e}thodes de Parall{\'e}lisation Interproc{\'e}durales},
	INDEX ={\indexbib{analyse interproc{\'e}durale!tableaux}
		\indexbib{r{\'e}gions}},
	SCHOOL = paris-6,
	YEAR = 1990,
	MONTH = {Septembre},
	NOTE = {DEA Syst\`{e}mes Informatiques. Rapport interne CRI-ENSMP
		  EMP-CAI-I E/129},
	SUMMARY = {Plan :

	\begin{enumerate}

	\item Besoins et probl\`{e}mes de la parall{\'e}lisation (effets
		interproc{\'e}duraux, test de d{\'e}pendance de donn{\'e}es,
		traduction des param\`{e}tres d'une proc{\'e}dure) ;

	\item Les diff{\'e}rentes approches de l'analyse interproc{\'e}durale :
		expansion de proc{\'e}dure, calcul des effets
		interproc{\'e}duraux~(SDFIs), r{\'e}gions (i.e. nos r{\'e}gions + les
		sections r{\'e}guli\`{e}res et les sections simples),
		lin{\'e}arisation, expansion virtuelle (ne fait pas l'union
		pour les informations r{\'e}sum{\'e}es) ; (rq : aujourd'hui on
		rajouterait le cl{\^o}nage) ;

	\item Probl\`{e}mes li{\'e}s au langage de programmation : l'aliasing ;

	\item Comparaison des m{\'e}thodes : pas de conclusion satisfaisante.

	\end{enumerate}
	\references{46}}
}


@INPROCEEDINGS{Chat:89,
	AUTHOR = {Chatterjee, Arunodaya},
	TITLE ={Futures : a Mechanism for Concurrency among Objects},
	INDEX ={\indexbib{langage!langages \`{a} objets}
		\indexbib{parall{\'e}lisme}},
	BOOKTITLE = acm,
	YEAR = 1989,
	PAGES = "562--567",
}


@UNPUBLISHED{Chat:94,
	AUTHOR = {Chatterjee, Siddhartha and Gilbert, John R. and Schreiber,
		  Robert and Sheffler, Thomas J.},
	TITLE ={Array Distribution in Data-Parallel Programs},
	INDEX ={\indexbib{distribution!donn{\'e}es}},
	YEAR = 1994,
	SUMMARY = {S'appuie sur une repr{\'e}sentation du programme sous forme
		  de graphe pour effectuer la distribution. \references{16}}
}


@INPROCEEDINGS{Chen:90,
	AUTHOR = {Chen, G.H. and Yur, J.-S.},
	TITLE ={A Branch and Bound with Underestimates Algorithm for the Task
		  Assignement Problem with Precedence Constraint},
	INDEX ={\indexbib{placement de processus!statique}},
	BOOKTITLE = icdcs,
	YEAR = 1990,
	MONTH = may,
	PAGES = {494--501},
}



@INPROCEEDINGS{Chen:91,
	AUTHOR = "Cheng, Doreen
		and Pase, Douglas",
	TITLE = {An Evaluation of Automatic and Interactive Parallel
		  Programming Tools},
	INDEX = {\indexbib{performances}
		 \indexbib{parall{\'e}lisation!interactive}
		 \indexbib{parall{\'e}lisation!automatique}
		 \indexbib{parall{\'e}liseur!Forge90}
		  \indexbib{parall{\'e}liseur!comparaison}},
	BOOKTITLE = ics,
	YEAR = 1991,
	MONTH = nov,
	SUMMARY = {
                   Evaluation of two automatic and one interactive (Forge90)
		   tools using 26 NAS applications on a CRAY Y-MP.
		   Automatic tools produce insufficient performance
		   improvement. Interactive tools are better, but tools
		   should generate code according to the target machine,
		   they should evaluate the tradeoffs between granularity of
		   a section of code and the overhead introduced by
		   vectorization or parallelization. Interesting
		   conclusions, but the article is redondant, and could give
		   the same amount of information with less words!
		   \references{7}} 
}



@INPROCEEDINGS{Chen:94,
	AUTHOR = {Chen, Ding-Kai and Torrellas, Josep and Yew, Pen-Chung},
	TITLE ={An Efficient Algorithm for the Run-time Parallelization of
		  {DOACROSS} Loops},
	INDEX ={\indexbib{}},
	BOOKTITLE = ics,
	YEAR = 1994,
	MONTH = nov,
	PAGES = {518--527},
	SUMMARY = {\references{14}}
}



@INPROCEEDINGS{Chen:95a,
	AUTHOR = {Dhen, Marina and Cowie, James and Wu, Janet},
	TITLE ={{CRAFT}: A Framework for {F90} Compiler Optimizations},
	INDEX ={\indexbib{langage!Fortran 90}},
	BOOKTITLE = malaga95,
	YEAR = 1995,
	MONTH = jun,
	PAGES = {40--48},
	SUMMARY = {pattern based program transformations. \references{0}}
}

@ARTICLE{Chin:95a,
	AUTHOR = {Chin, Wei-Ngan and Goh, Eak-Koon},
	TITLE = {A Reexamination of "Optimization of Array Subscript Range Checks"},
	INDEX ={\indexbib{compilation!d{\'e}tection erreurs}},
	YEAR = 1995,
	MONTH = mar,
	JOURNAL = toplas,
	VOLUME = 17,
	NUMBER = 2,
	PAGES = {217--227},
	SUMMARY = {Dis que l'article cit{\'e} n'est pas correct, et donne des
		  solutions. Pas tr\`{e}s int{\'e}ressant pour moi. \references{4}}
}


@INPROCEEDINGS{Chiu:95a,
	AUTHOR = {Chiueh, Tzi-cker and Verma, Manish},
	TITLE ={A compiler Directed Shared Memory System},
	INDEX ={\indexbib{}},
	BOOKTITLE = ics,
	YEAR = 1995,
	MONTH = jul,
	PAGES = {77--86},
	SUMMARY = {Utilisation des r{\'e}sultats de l'analyse des d{\'e}pendances
		  entre t{\^a}ches pour ex{\'e}cuter un code parall{\'e}le sur
		  syst\`{e}me \`{a} m{\'e}moire virtuelle partag{\'e}e. \references{25}}
}
		  
		  
@INPROCEEDINGS{Choi:91,
	AUTHOR = {Choi, J and Cytron, R. and Ferrante, J},
	TITLE ={Automatic Construction of Sparse Data Flow Evaluation Graphs},
	INDEX ={\indexbib{analyse flot de donn{\'e}es!framework}},
	BOOKTITLE = popl,
	YEAR = 1991,
	MONTH = jan,
	PAGES = {55--66},
	SUMMARY = {Construction d'un graphe permettant l'analyse de flot de
		  donn{\'e}es avec un temps d'ex{\'e}cution {\em
		  raisonnable}. Pour cela, certains n{\oe}uds sont
		  {\'e}limin{\'e}s par rapport au CFG : ceux dont les fonctions de
		  transfert sont {\'e}gales \`{a} l'identit{\'e} puisqu'ils
		  n'affectent pas la solution recherch{\'e}e, et certains des
		  n{\oe}uds dont la fonction de transfert est constante,
		  c'est-\`{a}-dire que la solution en sortie du n{\oe}ud ne
		  d{\'e}pend pas de la valeur de la solution en entr{\'e}e ; ces
		  derniers n{\oe}uds ne sont pas {\'e}limin{\'e}es si ce sont des
		  n{\oe}uds o\`{u} doivent s'effectuer les op{\'e}rations {\em
		  meet} lors de la r{\'e}solution. 

                  Avantage : c'est effectivement plus rapide puisque le
		  graphe comporte moins de n{\oe}uds. 
            
                  Inconv{\'e}nient : il faut reconstruire un nouveau graphe
		  pour chaque probl\`{e}me de flot de donn{\'e}es que l'on veut
		  r{\'e}soudre. Ce qui risque de devenir prohibitif.

                  \references{21}}
}


@INPROCEEDINGS{Chou:93,
	AUTHOR = {A. Choudhary and R. Bordawekar},
	TITLE ={Compiler and Run-Time support for parallel {I/O}},
	INDEX ={\indexbib{compilation!entr{\'e}es/sorties}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "171--189",
	SUMMARY = {\references{18}}
}

@ARTICLE{Chow:90,
	AUTHOR = {Chowdhuri, S.},
	TITLE = {The Greedy Load Sharing Algorithm},
	INDEX ={\indexbib{placement de processus!dynamique}},
	YEAR = 1990,
	MONTH = jun,
	JOURNAL = jpdc,
	VOLUME = 9,
	NUMBER = 1,
	PAGES = {93--99},
}

@ARTICLE{Chu:94,
	AUTHOR = {Chu, Chih-Ping and Carver, Doris L.},
	TITLE = {Parallelizing Subroutines in Sequential Programs},
	INDEX ={\indexbib{parall{\'e}lisation!automatique}},
	YEAR = 1994,
	MONTH = jan,
	JOURNAL = ieees,
	VOLUME = 11,
	NUMBER = 1,
	PAGES = {77--85},
	SUMMARY = {D{\'e}crit toutes les {\'e}tapes utilis{\'e}es pour d{\'e}tecter les
		  appels de sous-programmes qui peuvent {\^e}tre ex{\'e}cut{\'e}s en
		  mode parall\`{e}le synchrone ou asynchrone, l'accent {\'e}tant plus
		  particuli\`{e}rement mis sur le mode synchrone. Seules les
		  proc{\'e}dures appel{\'e}es dans le m{\^e}me contexte de contr{\^o}le
		  (sites d'appel appartenant au m{\^e}me n{\oe}ud du graphe de
		  contr{\^o}le) pourront {\^e}tre {\'e}ventuellement ex{\'e}cut{\'e}es en
		  parall\`{e}le.  

                  La proc{\'e}dure de parall{\'e}lisation commence par g{\'e}n{\'e}rer une
		  copie de chaque proc{\'e}dure par site d'appel correspondant.
		  Puis les param\`{e}tres formels sont remplac{\'e}s dans le corps des
		  proc{\'e}dures par les param\`{e}tres r{\'e}els. Les effets de chaque
		  instruction sont calcul{\'e}s \`{a} l'aide des r{\'e}gions. Puis
		  l'algorithme effectue ce que les auteurs appellent {\em
		  partial inline expansion}. L'appel \`{a} la proc{\'e}dure est
		  remplac{\'e} par une version simplifi{\'e}e de celle-ci. Dans cette
		  version, chaque instruction qui acc\`{e}de \`{a} un param\`{e}tre r{\'e}el
		  est remplac{\'e}e par les effets sur celui-ci. Les autres
		  instructions sont {\'e}limin{\'e}es. On a ainsi une version sous
		  forme d'effets du programme. Les d{\'e}pendances sont ensuite
		  analys{\'e}es dans chaque proc{\'e}dure \`{a} l'aide de la m{\'e}thode de
		  Kennedy et Allen. Ces d{\'e}pendances servent \`{a} d{\'e}terminer le
		  mode d'ex{\'e}cution, synchrone, asynchrone ou s{\'e}quentiel, de
		  l'appel \`{a} la proc{\'e}dure. 
                  
                  Le langage source est du Fortran structur{\'e}, et le langage
		  cible du Fortran + parallel-call. 

                  Avantages de leur approche : ex{\'e}cution parall\`{e}le synchrone
		  des calls.

                  Inconv{\'e}nients : leur analyse est {\'e}quivalente \`{a} une analyse
		  de tous les modules enti\`{e}rement in-lin{\'e}s. Il y a donc un
		  gros surco{\^u}t en m{\'e}moire, et un gros surco{\^u}t pour l'analyse
		  des d{\'e}pendances. Ils ne disent pas quelle taille de programme
		  on peut raisonnablement analyser avec leur
		  m{\'e}thode. 

                  \references{10}} }


@TECHREPORT{Cier:94,
	AUTHOR = {Cierniak, Micha{\l} and Li, Wei},
	TITLE ={Unifying Data and Control Transformations for Distributed
		  Shared Memory Machines},
	INDEX ={\indexbib{architecture!cache}
		  \indexbib{distribution!donn{\'e}es}},
	YEAR = 1994,
	MONTH = nov,
	INSTITUTION = {Department of Computer Science, University of Rochester},
	TYPE = {Technical report},
	NUMBER = 542,
	SUMMARY = {Habituellement, on ne propose que des transformations de
		  programme pour r{\'e}soudre les pbs de cache Ici, on propose
		  aussi de placer diff{\'e}remmment les donn{\'e}es. \references{32}}
}


@INPROCEEDINGS{Cier:95a,
	AUTHOR = {Cierniak, Micha{\l} and Li, Wei},
	TITLE ={Recovering Logical Structures of Data},
	INDEX ={\indexbib{}},
	BOOKTITLE = lcpc,
	YEAR = 1995,
	MONTH = aug,
	PAGES = {24.1--24.15},
	SUMMARY = {Recovery of data strutures form flat one-dimensional
		  arrays. \references{14}}
}


@MISC{Clau:95a,
	AUTHOR = {Clauss, Philippe},
	TITLE ={Couting Solutions to Linear and Nonlinear Constraints
		  through {E}hrhart Polynomials: Applications to analyse and
		  Transform Scientific Programs},
	INDEX ={\indexbib{}},
	HOWPUBLISHED = {{\tt http://icps.u-strasbg.fr/people/philippe.html}},
	YEAR = 1995,
	MONTH = nov,
	SUMMARY = {\references{27}}
}
		  
@ARTICLE{Clem:95a,
	AUTHOR = {Clematis, Andrea and Coda, Andrea and Grosso, Eugenio and
		  Panizza, Sara},
	TITLE = {An Analysis of Programming Environments for Distributed
		  Memory Parallel Computing},
	INDEX ={\indexbib{}},
	YEAR = 1995,
	JOURNAL = {Calculateurs Parall\`{e}les},
	VOLUME = 7,
	NUMBER = 4,
	PAGES = {387--414},
	SUMMARY = {\references{46}}
}

		  
@ARTICLE{Clic:95a,
	AUTHOR = {Click, Cliff and Cooper, Keith},
	TITLE = {Combining Analyses, Combining optimizations},
	INDEX ={\indexbib{compilation}},
	YEAR = 1995,
	MONTH = mar,
	JOURNAL = toplas,
	VOLUME = 17,
	NUMBER = 2,
	PAGES = {181--196},
	SUMMARY = {\references{10}}
}
		  

@ARTICLE{Cody:94,
	AUTHOR = {Cody, Mac A.},
	TITLE = {The Wavelet Packet Transform},
	INDEX ={\indexbib{ondelettes}},
	YEAR = 1994,
	MONTH = apr,
	JOURNAL = {Dr. Dobb's Journal},
	PAGES = {44--54},
	SUMMARY = {\references{2}}
}


@INPROCEEDINGS{Coel:95,
	AUTHOR = {Coelho, Fabien},
	TITLE ={Compilation of {I/O} Communications for {HPF}},
	INDEX ={\indexbib{r{\'e}gions!utilisation}
		  \indexbib{compilation!entr{\'e}es/sorties}},
	BOOKTITLE = {Frontiers'95},
        PAGES = {102--109},
	YEAR = 1995,
	MONTH = feb,
	NOTE = {Available via {\footnotesize \tt http://www.cri.ensmp.fr/\verb+~+coelho}},
}


@TECHREPORT{Coel:95b,
	AUTHOR = {Coelho, Fabien and Ancourt, Corinne},
	TITLE ={Optimal Compilation of {HPF} remappings},
	INDEX ={\indexbib{optimisation/transformations}},
	YEAR = 1995,
	MONTH = oct,
	INSTITUTION = cri-ensmp,
	TYPE = {Technical Report},
	NUMBER = {A-277-CRI},
        NOTE = {To appear in JPDC in 1996},
	SUMMARY = {\references{35}}
}

		  
		  
@INPROCEEDINGS{Coll:93,
	AUTHOR = {J.F. Collard and P. Feautrier},
	TITLE ={Automatic Generation of Data Parallel Code},
	INDEX ={\indexbib{parall{\'e}lisation!automatique}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "321--332",
	SUMMARY = {\references{19}}
}

@INPROCEEDINGS{Coll:94,
	AUTHOR = {Collard, Jean-Fran\c{c}ois},
	TITLE ={Parall{\'e}lisation automatique des boucles while par
		  ex{\'e}cution sp{\'e}culative},
	INDEX ={\indexbib{parall{\'e}lisation!automatique}},
	BOOKTITLE = renpar,
	YEAR = 1994,
	MONTH = jun,
	PAGES = {77--80},
	SUMMARY = {\references{4}}
}


@INPROCEEDINGS{Coll:94a,
	AUTHOR = {Collard, Jean-Fran\c{c}ois},
	TITLE ={Space-Time Transformation of While-Loops using Speculative
		  Execution}, 
	INDEX ={\indexbib{}},
	BOOKTITLE = shpcc,
	YEAR = 1994,
	MONTH = may,
	PAGES = {429--436},
	SUMMARY = {Boucle while ext{\'e}rieure. \references{}}
}

@TECHREPORT{Coll:94b,
	AUTHOR = {Collard, Jean-Fran\c{c}ois},
	TITLE ={{A method for static scheduling of dynamic control programs}},
	INDEX ={\indexbib{}},
	YEAR = 1994,
	MONTH = dec,
	INSTITUTION = ens-lyon,
	TYPE = {Technical report},
	NUMBER = {94-34},
	
}


@ARTICLE{Coll:95a,
	AUTHOR = {Collard, Jean-Fran\c{c}ois},
	TITLE = {Automatic parallelization of While-Loops using speculative
		  execution}, 
	INDEX ={\indexbib{}},
	YEAR = 1995,
	JOURNAL = ijpp,
	VOLUME = 23,
	NUMBER = 2,
	PAGES = {191--219},
	SUMMARY = {Boucle while ext{\'e}rieure. \references{}}
}

@INPROCEEDINGS{Coll:95b,
        AUTHOR = {Collard, Jean-Fran\c{c}ois and Barthou, Denis and Feautrier, Paul},
        TITLE  = {Fuzzy Array Dataflow Analysis},
        BOOKTITLE = PPoPP,
        MONTH  = jul,
        YEAR   = {1995}
}



@INPROCEEDINGS{Coop:92,
	AUTHOR = {Cooper, K. and Hall, M. W. and Kennedy, K.},
	TITLE ={Procedure Cloning},
	INDEX ={\indexbib{}},
	BOOKTITLE = iccl,
	YEAR = 1992,
	MONTH = apr,
	
}


@ARTICLE{Coop:93,
	AUTHOR = "Cooper, Keith
		and Hall, Mary
		and Hood, Robert
		and Kennedy, Ken
		and McKinley, Kathrin
		and Mellor-Crummey, John
		and Torczon, Linda
		and Waren, Scott",
	TITLE = {The {P}arascope Parallel Programming Environment},
	INDEX = {\indexbib{parall{\'e}lisation!interactive}
		 \indexbib{analyse!interproc{\'e}durale}
		 \indexbib{environnement de programmation}
		 \indexbib{compilation}},
	JOURNAL = pieee,
	YEAR = 1993,
	MONTH = feb,
	VOLUME = 81,
	NUMBER = 2,
	SUMMARY = {                
                Pr{\'e}sentation de l'outil de parall{\'e}lisation d{\'e}velopp{\'e} \`{a}
		Rice: analyse des d{\'e}pendances, compilateur,
		transformations interproc{\'e}durales, {\'e}diteur, debugger} 
}
	


@TECHREPORT{Coop:95,
	AUTHOR = {Cooper, Keith and Kennedy, Ken and McIntosh, Nathaniel},
	TITLE ={An Empirical Study of Inter-loop Reuse in the {NAS} benchmarks},
	INDEX ={\indexbib{}},
	YEAR = 1995,
	MONTH = mar,
	INSTITUTION = {CRPC},
	TYPE = {Technical Report},
	NUMBER = {CRPC-TR95519-S},
	SUMMARY = {Inter-loop reuse = references in a loop that have been
		  already referenced in the same loop and in a previous
		  loop. In fact the detection of Inter-loop initial hit is
		  more important. Not really interesting. \references{7}}
}



@INPROCEEDINGS{Cous:77,
	AUTHOR = {Cousot, P. and Cousot, R.},
	TITLE ={Abstract Interpretation : a Unified Lattice Model for Static
		  Analysis of Programs by Construction or Approximation of
		  Fixpoints}, 
	INDEX ={\indexbib{interpr{\'e}tation abstraite}},
	BOOKTITLE = POPL,
	YEAR = 1977,
	PAGES = {238--252},
	
}

	

@INPROCEEDINGS{Cous:78,
	AUTHOR = {Cousot, Patrick and Halbwachs, Nicholas},
	TITLE ={Automatic Discovery of Linear Restraints Among Variables of
		  a Program}, 
	INDEX ={\indexbib{interpr{\'e}tation abstraite}},
	BOOKTITLE = popl,
	YEAR = 1978,
	PAGES = {84--97},
	SUMMARY = {Poly\`{e}dres convexes. Utilisation pour repr{\'e}senter et
		  propager les informations sur les variables scalaires
		  enti\`{e}res d'un programme. \references{18}}
}
		

@PHDTHESIS{Cous:78a,
	AUTHOR = {Cousot, Patrick},
	TITLE ={M{\'e}thodes It{\'e}ratives de Construction et d'Approximation de
		  Points Fixes d'Op{\'e}rateurs Monotones sur un Treillis,
		  Analyse S{\'e}mantique des Programmes},
	INDEX ={\indexbib{}},
	SCHOOL = inpg,
	YEAR = 1978,
	MONTH = mar,
}

		  
@TECHREPORT{Cous:92,
	AUTHOR = {Cousot, Patrick and Cousot, Radhia},
	TITLE ={Abstract Interpretation and Application to Logic Programs},
	INDEX ={\indexbib{interpr{\'e}tation abstraite}},
	YEAR = 1992,
	MONTH = jun,
	INSTITUTION = ulm,
	TYPE = {Rapport de Recherche},
	SUMMARY = {\references{161}}
}



@INPROCEEDINGS{Cous:94a,
	AUTHOR = {Cousot, Patrick and Cousot, Radhia},
	TITLE ={Higher-Order Abstract Interpretation (and Application to
		  Comportment Analysis Generalizing Strictness, Termination,
		  Projection and {PER} Analysis of Functional Languages)},
	INDEX ={\indexbib{Interpr{\'e}tation abstraite}},
	BOOKTITLE = {International Conference on Computer Languages, IEEE
		  Computer Socitey Press},
	YEAR = 1994,
	MONTH = may,
	PAGES = {95--112},
	NOTE = {},
	SUMMARY = {Collecting semantics of function types (approximated by
		  relations). \references{65}}
}


@INPROCEEDINGS{Creu:95a,
	AUTHOR = {Creusillet, B{\'e}atrice and Irigoin, Fran\c{c}ois},
	TITLE ={Interprocedural Array Regions Analyses},
	INDEX ={\indexbib{}},
	BOOKTITLE = lcpc,
	YEAR = 1995,
	PAGES= {4.1--4.15},
	MONTH = aug,
	SUMMARY = {\references{17}}
}


@INPROCEEDINGS{Creu:95b,
	AUTHOR = {Creusillet, B{\'e}atrice},
	TITLE ={{IN} and {OUT} Array Region Analyses},
	INDEX ={\indexbib{}},
	BOOKTITLE = malaga95,
	YEAR = 1995,
	PAGES= {233--246},
	MONTH = jun,
	SUMMARY = {\references{16}}
}



@INPROCEEDINGS{Creu:95c,
	AUTHOR = {Creusillet, B{\'e}atrice},
	TITLE ={Analyse de Flot de Donn{\'e}es : R{\'e}gions de Tableaux {IN} et {OUT}},
	INDEX ={\indexbib{}},
	BOOKTITLE = renpar,
	YEAR = 1995,
	MONTH = {mai-juin},
	SUMMARY = {\references{10}}
}

		  

@TECHREPORT{Creu:95d,
	AUTHOR = {Creusillet, B{\'e}atrice},
	TITLE ={Array Regions for Interprocedural Parallelization and Array
		  Privatization}, 
	INDEX ={\indexbib{r{\'e}gions!poly\`{e}dres}},
	YEAR = 1995,
	MONTH = nov,
	INSTITUTION = cri-ensmp,
	TYPE = {Report},
	NUMBER = {A-279},
	NOTE = {Available at {\tt http://www.cri.ensmp.fr/\verb+~+creusil}},
	
}
		  

@TECHREPORT{Creu:96a,
	AUTHOR = {Creusillet, B{\'e}atrice and Irigoin, Fran\c{c}ois},
	TITLE ={Interprocedural Array Regions Analyses},
	INDEX ={\indexbib{}},
	YEAR = 1996,
	MONTH = jan,
	INSTITUTION = cri-ensmp,
	TYPE = {Submitted to IJPP - special issue on LCPC},
	NUMBER = {A/282/CRI},
	NOTE = {Not yet accepted - Do not disclose},
	SUMMARY = {Extended version of \cite{Creu:95a}. READ, WRITE, IN and
		  OUT regions for assignment, sequences and loops; complete
		  interprocedural translation framework; enhanced related
		  work. \references{30}}
}

		  
@INPROCEEDINGS{Croo:93,
	AUTHOR = {P. Crooks and R.H. Perrot},
	TITLE ={An Automatic Data Distribution Generator for Distributed
		  Memory {MIMD} machines},
	INDEX ={\indexbib{distribution! de donn{\'e}es}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "33--44",
	SUMMARY = {\references{6}}
}


@INPROCEEDINGS{Cros:94,
	AUTHOR = {Cross, M. and Ierotheou, C.S. and  Johnson, S.P. and Leggett, P.F.},
	TITLE ={{CAPT}ools - Semiautomatic Parallelization of Mesh Based
		  Computational Mechanics Codes},
	INDEX ={\indexbib{parall{\'e}lisation!interactive}},
	BOOKTITLE = hpcn,
	YEAR = 1994,
	MONTH = apr,
	PAGES = {241--246},
	SUMMARY = {Description tr\`{e}s rapide des caract{\'e}ristiques de CAPTools,
		  sans entrer dans les d{\'e}tails th{\'e}oriques. \references{10}}
}



@INPROCEEDINGS{Cytr:88,
	AUTHOR = {Cytron, Ron and Karlovsky, Steve and McAuliffe, Kevin},
	TITLE ={Automatic Management of Programmable Caches},
	INDEX ={\indexbib{}},
	BOOKTITLE = icpp,
	YEAR = 1988,
	MONTH = aug,
	PAGES = {229--238},
	SUMMARY = {\references{22}}
}


@INPROCEEDINGS{Cytr:89,
	AUTHOR = {Cytron, Ron  and Ferrante, Jeanne and Rosen, Barry
                  and Wegman, Mark and Zadeck, Kenneth},
	TITLE ={Efficiently Computing Static Single Assignement Form and The
		  Control Dependence Graph},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es}},
	BOOKTITLE = popl,
	YEAR = 1989,
	MONTH = jan,
	PAGES = {25--35},
}


%
% -D-
%



@TECHREPORT{Dart:95a,
	AUTHOR = {Darte, Alain and Vivien, Fr{\'e}d{\'e}ric},
	TITLE ={A comparison of Nested Loops Parallelization Algorithms},
	INDEX ={\indexbib{}},
	YEAR = 1995,
	MONTH = may,
	INSTITUTION = lip,
	TYPE = {Research Report},
	NUMBER = {95-11},
	SUMMARY = {\references{21}}
}


@ARTICLE{Das:94,
	AUTHOR = {Das, Raja and Saltz, Joel and van Hanxleden, Reinhard and
		  Kennedy, Ken and Koelbel, Chuck},
	TITLE = {Index Array Flattening Through Program Transformation},
	INDEX ={\indexbib{}},
	YEAR = 1994,
	MONTH = oct,
	JOURNAL = pcr,
	VOLUME = 2,
	NUMBER = 4,
	PAGES = {12},
	SUMMARY = {traitement des indirections. \references{0}}
}


@INPROCEEDINGS{Das:95a,
	AUTHOR = {Das, Raja and Sussman, Alan and Havlak, Paul and Saltz, Joel},
	TITLE ={Compiler Analysis and Optimization of Indirect Array Accesses},
	INDEX ={\indexbib{}},
	BOOKTITLE = malaga95,
	YEAR = 1995,
	MONTH = jun,
	PAGES = {98--110},
	SUMMARY = {\references{27}}
}


@INPROCEEDINGS{Das:95b,
	AUTHOR = {Das, Raja and Havlak, Paul and Saltz, Joel and Kennedy, Ken},
	TITLE ={Index Array Flatening Through Program Transformation},
	INDEX ={\indexbib{}},
	BOOKTITLE = sc,
	YEAR = 1995,
	MONTH = dec,
	SUMMARY = {\references{27}}
}

		  
		  
@UNPUBLISHED{Dele:89,
        AUTHOR = {Delebecque, Henri},
        TITLE ={Issues in concurrent activations of an object in {S}malltalk-80},
        INDEX ={\indexbib{langage!langages \`{a} objets}
		\indexbib{parall{\'e}lisme}},
        YEAR = 1989,
        NOTE = {rapport interne ESE},
}


@TECHREPORT{Desp:86,
	AUTHOR = {Despeyroux, Jo{\"e}lle},
	TITLE ={Proof or Translation in Natural Semantics},
	INDEX ={},
	YEAR = 1986,
	MONTH = {avril},
	INSTITUTION = inria,
	TYPE = {Rapport de recherche},
	NUMBER = 514,
	SUMMARY = {\references{19}}
}



@TECHREPORT{Dete:93,
	AUTHOR = {Detert, Ulrich and Gerndt, Michael},
	TITLE ={{TOP2} --- Tool Suite for Partial Parallelization, Version 2.01,
		  User's Guide},
	INDEX ={\indexbib{parall{\'e}lisation}},
	YEAR = 1993,
	MONTH = oct,
	INSTITUTION = {Forshungszentrum J{\"u}lich},
	TYPE = {Interner Bericht},
	NUMBER = {KFA--ZAM--IB--9321},
	NOTE = {Available by anonymous ftp at {\tt \small
		  ftp.zam.kfa-juelich.de} in {\tt \small pub/zamdoc/}.},
}



@UNPUBLISHED{Deut:94,
	AUTHOR = {Deutsch, Alan},
	TITLE ={Interprocedural May-Alias Analysis for Pointers : beyond
		  $k$-limiting}, 
	INDEX ={\indexbib{analyse!interproc{\'e}durale}},
	YEAR = 1994,
	NOTE = {extended abstract submitted to PLDI'94},
	SUMMARY = {Alias analysis of recursive pointer data
		  structures. \references{51}} 
}


@TECHREPORT{Dion:93,
	AUTHOR = {Dion, Bernard and Angeli, Laurent and Bravo Lastra, Angel},
	TITLE ={{P}ara{G}raph : An Interactive Environment for Parallelizing 
		{Fortran} Programs},
	INDEX ={\indexbib{parall{\'e}lisation!interactive}
		\indexbib{environnement de programmation}},
	YEAR = 1993,
	MONTH = {mai},
	INSTITUTION = inria,
	TYPE = {Rapport de Recherche},
	NUMBER = 1920,
	SUMMARY = {
                Ce rapport pr{\'e}sente l'implantation de ParaGraph, un
		parall{\'e}liseur pour le langage F (un sous-ensemble de
		Fortran) \`{a} l'aide du g{\'e}n{\'e}rateur d'environnements
		interactifs Centaur. La s{\'e}mantique dynamique du langage a
		{\'e}t{\'e} sp{\'e}cifi{\'e}e formellement en Typol, ainsi que le calcul
		des graphes de d{\'e}pendances. Un ensemble de transformations
		classiques a finalement {\'e}t{\'e} sp{\'e}cifi{\'e}. Une interface
		utilisateur interactive, r{\'e}alis{\'e}e en Sophtalk, a {\'e}t{\'e}
		exp{\'e}riment{\'e}e. \references{32}} }


@ARTICLE{Duco:95a,
	AUTHOR = {Ducourneau, Roland and Habib, Michel and Huchard, Marianne
		  and Mugnier, Marie-Laure and Napoli, Amedeo},
	TITLE = {Le point sur l'h{\'e}ritage multiple},
	INDEX ={\indexbib{langage!objet}},
	YEAR = 1995,
	MONTH = mar,
	JOURNAL = TSI,
	VOLUME = 14,
	NUMBER = 3,
	PAGES = {309--345},
	SUMMARY = {\references{53}}
}
		  
		  
@INPROCEEDINGS{Dues:93,
	AUTHOR = {Duesterwald, Evelyn and Gupta, Rajiv and Soffa, Mary Lou},
	TITLE ={A Practical Data Flow Framework for Array Reference Analysis
		  and its Use in Optimizations},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es}},
	BOOKTITLE = pldi,
	YEAR = 1993,
	MONTH = jun,
	PAGES = {68--77},
	NOTE = sigplan,
	SUMMARY = {Calcul de l'origine d'une r{\'e}f{\'e}rence \`{a} un {\'e}l{\'e}ment de
		  tableau, sous forme de distance d'it{\'e}ration. Exemple :
		  cette r{\'e}f{\'e}rence \`{a} l'it{\'e}ration i provient de l'it{\'e}ration
		  i-2. Le r{\'e}sultat est alors 2. Application \`{a}
		  l'optimisation pour machines s{\'e}quentielles ou parall\`{e}les
		  \`{a} grain fin. L'analyse data flow est faite sous forme
		  it{\'e}rative. Point fixe atteint en trois passes maximum. 
                  \references{26}}
}


@INPROCEEDINGS{Dues:95a,
	AUTHOR = {Duesterwald,Evelyn and Gupta, Rajiv and Soffa, Mary Lou},
	TITLE ={Demand-driven Computation of Interprocedural Data-Flow},
	INDEX ={\indexbib{analyse flot de don{\'e}es!framework}},
	BOOKTITLE = popl,
	YEAR = 1995,
	MONTH = jan,
	PAGES = {37--48},
	SUMMARY = {Analyse de flot de donn{\'e}es \`{a} la demande. I.e. seule la
		  r{\'e}ponse \`{a} une question pr{\'e}cise est recherch{\'e}e, sans
		  s'occuper des r{\'e}ponses au probl\`{e}me g{\'e}n{\'e}ral. Pour cela,
		  le probl\`{e}me est {\em renvers{\'e}}, i.e. on cherche d'o\`{u} la
		  solution peut venir au lieu de calculer la solution dans
		  le bon sens (il y a une certaine similitude avec l'analyse
		  {\em lazy\/} de Maslov). \references{36}}
}


@PHDTHESIS{Duma:92,
	AUTHOR = {Dumay, Alain},
	TITLE ={Traitement des indexations non lin{\'e}aires en
		  parall{\'e}lisation automatique : une m{\'e}thode de
		  lin{\'e}arisation contextuelle},
	INDEX ={\indexbib{analyse!d{\'e}pendances}},
	SCHOOL = paris-6,
	YEAR = 1992,
	MONTH = dec,
	SUMMARY = {Analyse des d{\'e}pendances lorsque les indices de tableau
		  ont des expressions non lin{\'e}aires. Pour cela, il {\'e}tudie
		  l'{\'e}quation de d{\'e}pendance : monotonie, diff{\'e}rence,
		  ... pour transformer le syst\`{e}me de contraintes non
		  lin{\'e}aire un un syst\`{e}me lin{\'e}aire non {\'e}quivalent, mais
		  plus contraint que si l'on enl\`{e}ve les contraintes non
		  lin{\'e}aires.
                  \references{112}} 
}


%
% -E-
%


@PHDTHESIS{Edwa:94,
	AUTHOR = {Edward},
	TITLE ={Extracting Dataflow Information for Parallelizing {FORTRAN}
		  Nested Loop Kernels},
	INDEX ={\indexbib{}},
	SCHOOL = {minster},
	YEAR = 1994,
        NOTE = {anonymous ftp at minster.york.ac.uk, dans /pub/edward/thesis.ps.Z},
	
}



@INPROCEEDINGS{Eise:93,
	AUTHOR = {C. Eisenbeis and J. Wang},
	TITLE ={Decomposed Sofware Pipelining : a New Approach to
		Exploit Instruction Level Parallelism for Loop Programs},
	INDEX ={\indexbib{transformations de programme!software pipelining}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "56--67",
	SUMMARY = {\references{18}}
}



@TECHREPORT{Emir:95a,
	AUTHOR = {Emiris, Ioannis Z.},
	TITLE ={A complete Implementation for Computing General Dimensional
		  Convex Hulls},
	INDEX ={\indexbib{poly\`{e}dre}},
	YEAR = 1995,
	MONTH = may,
	INSTITUTION = inria,
	TYPE = {Rapport de Recherche},
	NUMBER = 2551,
	SUMMARY = {\references{41}}
}


%
% -F-
%


@INPROCEEDINGS{Fahr:93,
	AUTHOR = {Fahringer, Thomas},
	TITLE ={Automatic Cache Performance Prediction in a Parallelizing Compiler},
	INDEX ={\indexbib{}},
	BOOKTITLE = {AICA},
	YEAR = 1993,
	MONTH = sep,
	SUMMARY = {Pr{\'e}diction du comportement du cache \`{a} la
		  compilation. Pour cela, utilise la mod{\'e}lisation suivante
		  du cache : $cls$ pour {\em cache line size\/} et $ocl$ pour
		  {\em overall number of cache lines}. \references{27}}
}


@INPROCEEDINGS{Feau:88,
	AUTHOR = {Feautrier, Paul},
	TITLE ={Array Expansion},
	INDEX ={\indexbib{transformations de programme!expansion de tableaux}
		\indexbib{analyse!d{\'e}pendances}},
	BOOKTITLE = ics,
	YEAR = 1988,
	MONTH = jul,
	PAGES = {429--441},
	SUMMARY = {Utilisation de PIP pour r{\'e}soudre le probl\`{e}me
		  d'expansion de tableaux. La d{\'e}tection d'un tableau
		  ``expandable'' se fait en d{\'e}tectant les d{\'e}pendances
		  producteur/producteur entre deux instances d'une m{\^e}me
		  instruction (si c'est deux instructions diff{\'e}rentes, un
		  renommage suffit). Il n'y a pas de test de profitabilit{\'e}
		  de l'op{\'e}ration, qui d{\'e}pend de ce qu'on veut en faire
		  apr\`{e}s. L'expansion consiste \`{a} rajouter une dimension au
		  tableau (la fa\c{c}on dont s'est fait est mal expliqu{\'e}e). Il
		  faut ensuite rechercher la source de chaque site de
		  consommation en r{\'e}solvant un probl\`{e}me de programmation
		  param{\'e}trique en nombres entiers. Les restrictions sur le
		  langage source (tout est lin{\'e}aire, pas de IFs, ...)
		  assurent l'unicit{\'e} de cette source, et sa d{\'e}termination.
		  \references{9}}
}

@ARTICLE{Feau:88b,
	AUTHOR = {Feautrier, Paul},
	TITLE = {Parametric Integer Programming},
	INDEX ={\indexbib{}},
	YEAR = 1988,
	MONTH = sep,
	JOURNAL = {{RAIRO} Recherche Op{\'e}rationnelle},
	PAGES = {243--268},
}


@ARTICLE{Feau:91,
	AUTHOR = {Feautrier, Paul},
	TITLE = {Dataflow Analysis of Array and Scalar References},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es}
		\indexbib{analyse!d{\'e}pendances}},
	YEAR = 1991,
	MONTH = sep,
	JOURNAL = ijpp,
	VOLUME = 20,
	NUMBER = 1,
	PAGES = {23--53},
	SUMMARY = {
                Description d'un algorithme pour l'analyse data-flow de
		programmes comportant des r{\'e}f{\'e}rences \`{a} des tableaux et
		des boucles {\em for}.  Les exemples d'application sont la
		conversion des programmes en programmes \`{a} assignation
		unique, l'expansion de tableaux et de scalaires, la
		v{\'e}rification de programmes, et l'optimisation en g{\'e}n{\'e}ral.
		\references{28}} 
}


@TECHREPORT{Feau:94,
	AUTHOR = {Feautrier, Paul and Collard, Jean-Fran\c{c}ois},
	TITLE ={Fuzzy Array Dataflow Analysis},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es}
                \indexbib{analyse!d{\'e}pendances}},
	YEAR = 1994,
	MONTH = jul,
	INSTITUTION = ens-lyon,
	TYPE = {Research Report},
	NUMBER = {94--21},
	SUMMARY = {Fonctions sources pour les programmes \`{a} contr{\^o}le non
		  statique : dans ce cas, on calcule des ensembles de
		  sources possibles. \references{13}}
}


@INPROCEEDINGS{Feau:94b,
	AUTHOR = {Feautrier, Paul},
	TITLE ={Compiling for Massively Parallel Architectures: A Perspective},
	INDEX ={\indexbib{parall{\'e}lisation!automatique}},
	BOOKTITLE = {Workshop on Algorithms and Parallel {VLSI} Architectures},
	YEAR = 1994,
	MONTH = aug,
	SUMMARY = {Propose une classification des architectures parall\`{e}les,
		  et pour chacune des classes une combinaison de techniques
		  permettant de compiler un programme s{\'e}quentiel. Les
		  techniques de base propos{\'e}es sont l'ordonnancement et la
		  distribution. \references{14}}
}


@INPROCEEDINGS{Feau:94c,
	AUTHOR = {Feautrier, Paul},
	TITLE ={Fine-grain Scheduling under Resource Constraints},
	INDEX ={\indexbib{compilation}},
	BOOKTITLE = lcpc,
	YEAR = 1994,
	MONTH = aug,
	SUMMARY = {\references{17}}
}


@TECHREPORT{Fern:88,
	AUTHOR = {Fernandez, F. and Quinton, P.},
	TITLE ={Extension of Chernikova's Algorithm for Solving General
		  Mixed Linear Programming Problems},
	INDEX ={\indexbib{poly\`{e}dres}},
	YEAR = 1988,
	INSTITUTION = irisa,
	TYPE = {Publication Interne},
	NUMBER = 437,
}


@INPROCEEDINGS{Ferr:86,
	AUTHOR = {Ferrari, D. and Zhou, S.},
	TITLE ={A Load Index for Dynamic Load Balancing},
	INDEX ={\indexbib{placement de processus!dynamique}},
	BOOKTITLE = {Fall Joint Computer Conference},
	YEAR = 1986,
	MONTH = nov,
	PAGES = {684--690},
}


@UNPUBLISHED{Ferr:94,
	AUTHOR = {Ferrante, Jeanne 
		and Grunwald, Dirk 
		and Srinivasan, Harini },
	TITLE ={Array Section Analysis for Control Parallel Programs},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es}
		\indexbib{compilation!langages parall\`{e}les}},
	YEAR = 1994,
	NOTE = {submitted to PLDI'94, but not accepted},
	SUMMARY = {
		General subject : Array section data flow analysis of
                parallel programs.

		Originality : Generalization and extension of other works
		(deals with arrays and synchronization).  Application to
		compute Send and Receive sets. \references{50}}

}


@INPROCEEDINGS{Ferr:94a,
	AUTHOR = {Ferrante, Jeanne 
		and Grunwald, Dirk 
		and Srinivasan, Harini},
	TITLE ={Computing Communication Sets for Control Parallel Programs},
	INDEX ={\indexbib{}},
	BOOKTITLE = lcpc,
	YEAR = 1994,
	MONTH = aug,
	PAGES = {21.1--21.16},
	SUMMARY = {\references{44}}
}




@BOOK{Fisc:88,
	AUTHOR = {Fischer, Charles N. and LeBlanc, Richard J.},
	TITLE = {Crafting a Compiler},
	INDEX ={\indexbib{compilation}},
	YEAR = 1988,
	PUBLISHER = BC,
}


@MANUAL{Fore:93,
	TITLE ={{F}oresys, version 1.2},
	ORGANIZATION = {Connexit{\'e}},
	YEAR = 1993,
	INDEX ={\indexbib{Foresys}},
}


@MANUAL{Fort:77,
	TITLE ={Programming Language {FORTRAN},
		  {ANSI} X3.9-1978, {ISO 1539-1980}},
        ORGANIZATION={American National Standard Institute},		  
	YEAR = 1983,
	INDEX ={\indexbib{langage!fortran}},
	SUMMARY = {Norme Fortran 77. \references{}}
}


@INCOLLECTION{Four:1823,
	AUTHOR = {Fourier, J.B.J.},
	TITLE ={Analyse des travaux de l'{A}cad{\'e}mie {R}oyale des {S}ciences
		  pendant l'ann{\'e}e 1823, partie math{\'e}matiques},
	INDEX ={\indexbib{poly\`{e}dres}},
	BOOKTITLE = {Histoire de l'{A}cad{\'e}mie {R}oyale des {S}ciences de
		  l'{I}nstitut de {F}rance},
	YEAR = 1827,
        VOLUME = 7,
}

@Book{Frie:92,
  AUTHOR = 	{Daniel P. Friedman and Mitchell Wand and Chris Haynes},
  TITLE = 	{Essentials of Programming Languages},
  PUBLISHER = 	{MIT Press},
  YEAR = 	{1992},
  ISBN =	{0-262-06145-7},
  SUMMARY = { It covers coroutines, closures, continuations, method
              dispatching, and tail recursion. It also covers register
              allocation, and transforming interpreters to compilers (and
              unifies the coverage of parsing and compilation). It also
              covers more mundane topics like call-by-reference
              vs. call-by-value.}  }


@INPROCEEDINGS{Frit:93,
	AUTHOR = {P. Fritzson and N. Anderson},
	TITLE ={Generating Parallel Code from Equations in the {ObjectMath}
		Programming Environments},
	INDEX ={\indexbib{environnement de programmation}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "512--523",
	NOTE = {not presented},
	
}



@BOOK{Froi:90,
	AUTHOR = {Froidevaux, Christine and Gaudel, Marie-Claude and Soria,
		  Mich\`{e}le},
	TITLE = {Types de Donn{\'e}es et Algorithmes},
	INDEX ={\indexbib{types de donn{\'e}es}},
	YEAR = 1990,
	PUBLISHER = mcgh,
	SUMMARY = {Chapitre 4 sur les types de donn{\'e}es abstraits. \references{}}
}



%
% -G-
%


@ARTICLE{Gard:94,
	AUTHOR = {Gardiner, Paul H.B. and Martin, Clare E. and de Moor, Oege},
	TITLE = {An Algebraic Construction of Predicate Transformers},
	INDEX ={\indexbib{}},
	YEAR = 1994,
	JOURNAL = scp,
	VOLUME = 22,
	PAGES = {21--44},
	SUMMARY = {\references{30}}
}


@BOOK{Gare:79,
	AUTHOR = {Garey, M.R. and Johnson, D.S.},
	TITLE = {Computers and Intractability: 
                     A Guide to the Theory of NP Completness},
	YEAR = 1879,
	PUBLISHER = {Freeman},
}


@UNPUBLISHED{Garz:94,
	AUTHOR = {Garza, David and B\"{o}hm, Wim},
	TITLE ={Uniqueness and Completeness Analysis of Array Comprehension},
	INDEX ={\indexbib{langage!fonctionnel}
                \indexbib{analyse!flot de donn{\'e}es}},
	YEAR = 1994,
	MONTH = apr,
	NOTE = {submitted to SAS'94 -- DO NOT CITE},
	SUMMARY = {\references{20}}
}

		  
@ARTICLE{Gele:95a,
	AUTHOR = {Gelerk, Michael and Stoltz, Eric and  Wolfe, Michael},
	TITLE = {Beyond Induction Variable: Detecting and Classifying
		  Sequences Using a Demand-Driven {SSA}-Form},
	INDEX ={\indexbib{}},
	YEAR = 1995,
	MONTH = jan,
	JOURNAL = toplas,
	VOLUME = 17,
	NUMBER = 1,
	PAGES = {85--122},
	SUMMARY = {\references{24}}
}


@INPROCEEDINGS{Gemu:93,
	AUTHOR = {A.J.C van Gemund},
	TITLE ={Compile-Time Performance Prediction with {PAMELA}},
	INDEX ={\indexbib{performances!pr{\'e}diction}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "428--435",
	SUMMARY = {\references{10}}
}


@ARTICLE{Geto:95a,
	AUTHOR = {Getov, Vladimir},
	TITLE = {Performance Characterisation of the Memory Cache Effect},
	INDEX ={\indexbib{architecture!caches}},
	YEAR = 1995,
	MONTH = sep,
	JOURNAL = {Supercomputer},
	VOLUME = {XI},
	NUMBER = 4,
	PAGES = {31--49},
	SUMMARY = {\references{14}}
}
		  
		  
@BOOK{Gold:89,
	AUTHOR = {Goldberg, D.E.},
	TITLE = {Genetic Algorithm in Search, Optimization, and Machine Learning},
	INDEX ={\indexbib{algorithmes g{\'e}n{\'e}tiques}},
	YEAR = 1989,
	PUBLISHER = aw,
}



@INPROCEEDINGS{Geud:93,
	AUTHOR = {U. Geuder and M. H{\"a}rdtner and B. W{\"o}rner and R. Zink},
	TITLE ={The {GRIDs} Approach to Automatic Parallelization},
	INDEX ={\indexbib{parall{\'e}lisation!automatique}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "333--344",
	SUMMARY = {\references{21}}
}



@INPROCEEDINGS{Gong:93,
	AUTHOR = {Gong, Chun and Gupta, Rajiv and Melhem, Rami},
	TITLE ={Compilation Techniques for Optimizing Communication on
		  Distributed-Memory Systems},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es}},
	BOOKTITLE = icpp,
	YEAR = 1993,
	MONTH = aug,
	PAGES = {II-39--II-46},
	SUMMARY = {Pr{\'e}sente un cadre d'analyse de flot de donn{\'e}es, pour le
		  moins restreint : tableaux \`{a} une dimension, dont les indices
		  ne d{\'e}pendent que des bornes de boucles et de constantes, les
		  bornes de boucles sont des constantes connues \`{a} la
		  compilation \ldots. Ils d{\'e}finissent des op{\'e}rations sur les
		  ensembles d'{\'e}l{\'e}ments de tableaux qui sont difficiles \`{a}
		  {\'e}tendre \`{a} des formes d'ensemble plus compl\`{e}tes. Y'a
		  m{\^e}me pas toutes les r{\'e}f{\'e}rences classiques sur 
		  l'analyse du flot des {\'e}l{\'e}ments de tableaux. \references{16}}
}


@ARTICLE{Grah:76,
	AUTHOR = {Graham, S. and Wegman, M.},
	TITLE = {Fast and Usually Linear Algorithm for Global Flow Analysis},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es}},
	YEAR = 1976,
	MONTH = jan,
	JOURNAL = jacm,
	VOLUME = 23,
	NUMBER = 1,
	PAGES = {172--202},
	SUMMARY = {je ne l'ai pas. cf \cite{Ryde:86}.}
}


@INPROCEEDINGS{Grah:93,
	AUTHOR = {Graham, Susan and Lucco, Steven and Sharp, Oliver},
	TITLE ={Orchestrating Interactions Among Parallel Computations},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es!SDD}},
	BOOKTITLE = pldi,
	YEAR = 1993,
	MONTH = jun,
	PAGES = {100-111},
	NOTE = sigplan,
	SUMMARY = {First definition of SDDs (Symbolic Data Descriptors) which
		  are summary sets of memory accesses, like regions.  In
		  this definition, the only access patterns are those of RSD
		  with strides, except that the bounds and strides are
		  symbolic affine expressions. Non affine conditions are
		  added to restrict the access pattern of each dimension,
		  and there is a global condition. The analysis relies on
		  the SSA form of the program.

                  Presentation of the {\em split} transformation, which
		  subdivides computations into independant and dependant
		  parts. This reduces synchronization constraints, and
		  exposes concurrency and pipelining
		  opportunities. \references{21}} 
}


@TECHREPORT{Gran:91a,
	AUTHOR = {Granger, Philippe},
	TITLE ={Improving the Results of Static Analyses of Programs by
		  Local Decreasing Iterations},
	INDEX ={\indexbib{}},
	YEAR = 1991,
	MONTH = dec,
	INSTITUTION = lix,
	TYPE = {Research Report},
	NUMBER = {LIX/RR/91/08},
	SUMMARY = {{\'E}tend les trucs de la th\`{e}se de Cousot. Consiste \`{a}
		  calculer de mani\`{e}re it{\'e}rative les valeurs donn{\'e}es par
		  certains op{\'e}rateurs abstraits.\references{22}}
}

		  
@INPROCEEDINGS{Gran:92a,
	AUTHOR = {Granger, Philippe},
	TITLE ={Improving the Results of Static Analyses of Programs by
		  Local Decreasing Iterations},
	INDEX ={\indexbib{}},
	BOOKTITLE = {Proceedings of the 12th Foundations of Software
		  Technology and Theoretical Computer Science Conference},  
	YEAR = 1992,
	MONTH = dec,
	SUMMARY = {See~\cite{Gran:91a}.}
}


@MISC{Gran:??,
	AUTHOR = {Granger, Philippe},
	TITLE ={Combination of Semantic Analyses (draft)},
	HOWPUBLISHED = lix,
	YEAR = {?},
	SUMMARY = {Pass{\'e} par Arnauld Leservot. \references{13}}
}
		  
		  
@TECHREPORT{Gran:92,
	AUTHOR = {Granston, Elana D. and Veidenbaum Alexander V.},
	TITLE ={Combining Flow and Dependence Analysis to Expose Redundant
		  Array Access}, 
	INDEX ={\indexbib{analyse!flot de donn{\'e}es}
		\indexbib{analyse!sections de tableaux}},
	YEAR = 1992,
	MONTH = oct,
	INSTITUTION = {Leiden University},
	SUMMARY = {But : {\'e}liminer les acc\`{e}s redondants \`{a} des sections de
		  tableaux. Pour cela, ils r{\'e}solvent le probl\`{e}me des reaching
		  definitions pour les sections de tableaux. Ils d{\'e}finissent
		  les conditionally/unconditionally downwardly/upwardly reaching
		  definitions, puis les full/partial/conditional redundancies.
		  Ils utilisent une analyse bas{\'e}e sur les intervalles comme
		  dans \cite{Gros:90}. Leur m{\'e}thode est ind{\'e}pendente de la
		  mani\`{e}re de repr{\'e}senter les sections de
		  tableaux. \references{41}} 
}

@ARTICLE{Gran:95a,
	AUTHOR = {Granston, Elana  and Veidenbaum Alexander },
	TITLE = {Combining Flow and Dependence Analysis to Expose Redundant
		  Array Access},
	INDEX ={\indexbib{}},
	YEAR = 1995,
	JOURNAL = ijpp,
	VOLUME = 23,
	NUMBER = 5,
	PAGES = {423--470},
	SUMMARY = {\references{32}}
}


@TECHREPORT{Grie:93,
	AUTHOR = {Griebl, Martin and Lengauer, Christian},
	TITLE ={On the space-Time Mapping of {WHILE}-Loops},
	INDEX ={\indexbib{poly\`{e}dres}},
	YEAR = 1993,
	MONTH = jul,
	INSTITUTION = passau,
	TYPE = {Technisches Bericht},
	NUMBER = {MIP-9304},
	SUMMARY = {Les nids de boucles while sont trait{\'e}es de la m{\^e}me mani\`{e}re
		  que les nids de boucles do, sauf que l'on a des poly\`{e}dres
		  au lieu de polytopes (pas de dimension infinie). Ceci se
		  fait en introduisant un index artificiel. \references{15}}
}


@ARTICLE{Gros:90,
	AUTHOR = {Gross, Thomas and Steenkiste, Peter},
	TITLE = {Structured Dataflow Analysis for Arrays and its Use in an 
		Optimizing Compiler},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es}},
	YEAR = 1990,
	MONTH = feb,
	JOURNAL = spe,
	VOLUME = 20,
	NUMBER = 2,
	PAGES = {133--155},
	SUMMARY = {\references{36}}
}

@ARTICLE{Gros:95a,
	AUTHOR = {Grosse-Rhode, Martin},
	TITLE = {Transition Specifications for Dynamic Abstract Data Types},
	INDEX ={\indexbib{}},
	YEAR = 1995,
	JOURNAL = {EATCS Bulletin},
	VOLUME = {?},
	NUMBER = {?},
	PAGES = {121--128},
	SUMMARY = {\references{12}}
}


@INPROCEEDINGS{Grov:93,
	AUTHOR = {Grove, Dan and Torczon, Linda},
	TITLE ={Interprocedural Constant Propagation: A Study of Jump
		  Functions Implementations},
	INDEX ={\indexbib{analyse!interproc{\'e}durale}},
	BOOKTITLE = pldi,
	YEAR = 1993,
	MONTH = jun,
	PAGES = {90--99},
	NOTE = sigplan,
	SUMMARY = {{\'E}tude exp{\'e}rimentale sur l'utilisation des {\em jump
		  functions} pour la propagation interproc{\'e}durale des
		  constantes. Dommage qu'il n'y ait pas de comparaison avec
		  le nombre de constantes que l'on aurait pu trouver \`{a} la
		  main. Les conclusion sont qu'il faut propager des
		  expressions polynomiales, et non des constantes strictes,
		  et qu'il faut propager de la fonction appelante vers la
		  fonction appel{\'e}e, mais aussi le contraire, i.e. de la
		  fonction appel{\'e}e, vers la fonction appelante, ce que nous
		  fait le transformeur dans PIPS. \references{16}}
}


@INPROCEEDINGS{Gu:95a,
	AUTHOR = {Gu, Jungie and Li, Zhiyuan and Lee, Gyungho},
	TITLE ={Symbolic Array Dataflow Analysis for Array Privatization and
		  Program Parallelization},
	INDEX ={\indexbib{}},
	BOOKTITLE = sc,
	YEAR = 1995,
	MONTH = dec,
	SUMMARY = {\references{37}}
}

@INCOLLECTION{Gunt:90a,
	AUTHOR = {Gunter, C. and Scott, D.},
	EDITOR = {van Leeuwen, Jan},
	TITLE = {Denotational Semantics},
        BOOKTITLE = {Theoretical Computer Science},
	INDEX ={\indexbib{}},
	YEAR = 1990,
	PUBLISHER = esp,
	CHAPTER = 12,
	VOLUME = {B},
	SUMMARY = {\references{}}
}
	  
@INPROCEEDINGS{Gupt:90,
	AUTHOR = {Gupta, R. and Gopinath, P.},
	TITLE ={A hierarchical Approach to Load Balancing in Distributed Systems},
	INDEX ={\indexbib{placement de processus!dynamique}},
	BOOKTITLE = {Distributed Memory Computing Conference},
	YEAR = 1990,
	MONTH = apr,
	PAGES = {1000--1005},
}


@ARTICLE{Gupt:91,
	AUTHOR = {Gupta, Rajiv and Soffa, Mary Lou},
	TITLE = {Compile-Time Techniques for Improving Scalar Access
		  Performance in Parallel Memories},
	INDEX ={\indexbib{}},
	YEAR = 1991,
	MONTH = apr,
	JOURNAL = ieeetpds,
	VOLUME = 2,
	NUMBER = 2,
	PAGES = {138--148},
	SUMMARY = {Pas ce que je pensais : Sur une architecture LIW
		  distribu{\'e}e \`{a} modules m{\'e}moire, comment {\'e}viter, \`{a} la
		  compilation les conflits d'acc\`{e}s aux modules pour les variables
		  scalaires. Une des techniques repose sur le coloriage du
		  graphe des conflits, un peu comme pour l'allocation des
		  registres. \references{23}}
}


@ARTICLE{Gupt:93,
	AUTHOR = {Gupta, Rajiv},
	TITLE = {Optimizing Array Bound Checks Using Flow Analysis},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es}},
	YEAR = 1993,
	MONTH = {march--december},
	JOURNAL = loplas,
	VOLUME = 2,
	NUMBER = {1--4},
	PAGES = {135--150},
	SUMMARY = {Compile time optimizations to reduce the execution time
		  overhead due to bound checks : local and global
		  elimination of cheks and propagation of checks out of
		  loops. The data flow analysis is only intraprocedural. An
		  assumption is made that the optimizer can distinguish the
		  bound checks from the remainder of the program, and that
		  no control flow intructions are introduced in the code by
		  the bound checks.  \references{10}}


}


@INPROCEEDINGS{Gupt:94,
	AUTHOR = {Gupta, Manish
		and Schonberg, Edith
		and Srinivasan, Harini},
	TITLE ={A Unified Data-Flow Framework for Optimizing Communication},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es}
		\indexbib{optimisation de programme!communications}},
        BOOKTITLE = lcpc,
	YEAR = 1994,
        MONTH = aug,
        PAGES = {18.1--18.16},
	SUMMARY = {Pr{\'e}sente une technique, bas{\'e}e sur l'analyse globale du flot 
		de donn{\'e}es (tableaux), pour r{\'e}duire les communications dans les 
		architectures \`{a} m{\'e}moire distribu{\'e}es. \references{24}}
}


@INPROCEEDINGS{Gupt:95a,
	AUTHOR = {Gupta, Manish and Midkiff, Sam and Schonberg, Edith and
		  Seshadri, Ven and Shields, Dave and Wang, Ko-Yang and
		  Ching, Wei-Min and Ching, Wai-Mee},
	TITLE ={An {HPF} Compiler for the {IBM} {SP2}},
	INDEX ={\indexbib{}},
	BOOKTITLE = malaga95,
	YEAR = 1995,
	MONTH = jun,
	PAGES = {22-39},
	SUMMARY = {\references{23}}
}



%
% -H-
%


@TECHREPORT{Hade:88,
	AUTHOR = {Haden, P. and Berman, F.},
	TITLE ={A Comparative Study of Mapping Algorithms for an Automated
		  Parallel Programming Environment},
	INDEX ={\indexbib{placement de processus!statique}},
	YEAR = 1988,
	INSTITUTION = {University of California},
	TYPE = {Technical Report},
	NUMBER = {CS-088},
}


@MASTERSTHESIS{Hagh:90,
	AUTHOR = {Haghighat, Mohammad Reza},
	TITLE ={Symbolic Dependence Analysis for High Performance
		  Parallelizing Compilers},
	INDEX ={\indexbib{math{\'e}matiques}
		\indexbib{analyse!d{\'e}pendances}
		\indexbib{analyse!flot de donn{\'e}es}
		\indexbib{analyse!flot de contr{\^o}le}
		\indexbib{analyse!s{\'e}mantique}},
	SCHOOL = csrd,
	YEAR = 1990,
	MONTH = may,
	SUMMARY = {Tout est dans le titre. Soulignons la pr{\'e}sence d'une partie
		  sur l'analyse de flot de donn{\'e}e, l'analyse s{\'e}mantique, et
		  une grosse introduction sur le cadre math{\'e}matique (treillis
		  notamment). \references{107}}
}


@TECHREPORT{Hagh:94,
	AUTHOR = {Haghighat, Mohammad R. and Polychronopoulos, Constantine D.},
	TITLE ={Symbolic Analysis for Parallelizing Compilers},
	INDEX ={\indexbib{analyse!s{\'e}mantique}
                \indexbib{analyse!symbolique}},
	YEAR = 1994,
	INSTITUTION = csrd,
	TYPE = {CSRD Report},
	NUMBER = 1355,
	NOTE = {Do not cite. Submitted to TOPLAS. Reviewed by CA.},
	SUMMARY = {A powerful symbolic analysis framework is presented. It
		  is in fact a semantical analysis framework ({\em \`{a} la}
		  Cousot). But the mathematical representation of the
		  solutions are polynomial expressions, which are more
		  powerful than polyhedra. The applications are
		  interesting: symbolic constant propagation, generalized
		  induction variable substitution, and detection of loop
		  invariant computations. All this is performed
		  interprocedurally. The problem is that the related work
		  is not well analyzed. \references{94}}
}



@TECHREPORT{Haha:94,
	AUTHOR = {Hahad, Mounir and Priol, Thierry and Erhel, Jocelyne},
	TITLE ={Irregular Loop Patterns Compilation on Distributed Shared
		  Memory Multiprocessors},
	INDEX ={\indexbib{compilation} \indexbib{distribution! de code}},
	YEAR = 1994,
	MONTH = sep,
	INSTITUTION = irisa,
	TYPE = {Publication Interne},
	NUMBER = 862,
	SUMMARY = {Distribution des boucles dans lesquelles les indices des
		  {\'e}l{\'e}ments de tableaux sont des {\'e}l{\'e}ments de
		  tableaux, dans un mod\`{e}le SPMD \`{a} m{\'e}moire virtuelle
		  partag{\'e}e, et dans le but d'{\'e}viter des d{\'e}fauts de page.
		  Pour cela, ils introduisent la technique dite
		  {\em CIL} pour {\em Conditioned Iterations Loop}, qui sont
		  en fait des boucles dont le corps est conditionn{\'e} par un
		  test de telle sorte qu'un seul processeur ex{\'e}cute le
		  corps pour une valeur donn{\'e}e de l'indice
		  d'it{\'e}ration. Le probl\`{e}me est que tous les processeurs
		  ex{\'e}cutent le test pour toutes les it{\'e}rations. Ils ont un
		  peu am{\'e}lior{\'e} la chose par une technique d'{\em
		  apprentissage} s'appuyant sur le fait que les acc\`{e}s
		  seront r{\'e}guliers.   \references{11}}
}


@PHDTHESIS{Halb:79,
	AUTHOR = {Halbwachs, Nicholas},
	TITLE ={D{\'e}termination Automatique de Relations Lin{\'e}aires
		  V{\'e}rifi{\'e}es par les Variables d'un Programme},
	INDEX ={\indexbib{poly\`{e}dres}},
	SCHOOL = inpg,
	YEAR = 1979,
}


@INPROCEEDINGS{Hall:93,
	AUTHOR = {Hall, Mary W. 
		and Mellor-Crummey, John M. 
		and Carle, Alan 
		and Rodr{\'{\i}}guez, Ren{\'e} G.},
	TITLE ={{FIAT} : A Framework for Interprocedural Analysis and
		 Transformation},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es}
		\indexbib{analyse!interproc{\'e}durale}
		\indexbib{transformations de programme!cl{\^o}nage}
		\indexbib{environnement de programmation}},
	BOOKTITLE = portland93,
	YEAR = 1993,
	MONTH = aug,
	SUMMARY = {
                This paper presents FIAT, a framework that allows
		prototyping of interprocedural techniques, by providing a
		interprocedural data-flow analysis engine. The programmer
		has only to provide the initialization functions, the meet
		function, the transfer function, and the direction of the
		analysis. The engine is based upon a demand-driven paradigm,
		similar to the pipsmake mechanism. It performs only
		flow-insensitive analysis, but flow-sensitive analysis is
		planned and studied.  Interprocedural transformations are
		described. \references{51}} 
}



@UNPUBLISHED{Hall:94,
	AUTHOR = {Hall, Mary
		and Amarasinghe, Saman
		and Murphy, Brian
		and Sathyanathan, Patrick
		and Wilson, Christopher
		and Lam, Monica},
	TITLE ={Interprocedural Analysis for Parallelization},
	INDEX ={\indexbib{analyse!interproc{\'e}durale}
		\indexbib{transformations de programme!privatisation de tableaux}
		\indexbib{analyse!sections de tableaux}
		\indexbib{analyse!cl{\^o}nage}},
	YEAR = 1994,
	NOTE = {submitted to PLDI'94, not accepted (do not cite)},
	SUMMARY = {General subject : presentation of an interprocedural
		   scalar and array analysis system.

		   Originality : the use of lists of polyhedra to represent
		   regions of data accessed (instead of convex hulls of
		   polyhedra), along with the use of array privatisation and
		   of selective procedure cloning.

		   The exemples and results are motivating since they are
		   based on several Perfect benchmarks.

		   \references{18}}
}




@INPROCEEDINGS{Hall:95a,
	AUTHOR = {Hall, Mary and Murphy, Brian and Amarasinghe, Saman},
	TITLE ={Interprocedural Parallelization Analysis: A Case Study},
	INDEX ={\indexbib{}},
	BOOKTITLE = ppsc,
	YEAR = 1995,
	MONTH = feb,
	PAGES = {650--655},
	SUMMARY = {Presents FIAT/SUIF interprocedural framework: selective
		  procedure cloning, interval analysis, scalar analysis
		  (sorts of preconditions), data dependence, array
		  summaries, array privatization, reductions, array
		  reshapes.  \references{6}}
}


@INPROCEEDINGS{Hall:95b,
	AUTHOR = {Hall, Mary and Murphy, Brian and Amarasinghe, Saman and
		  Liao, Shih-Wei and Lam, Monica},
	TITLE ={Overview of an Interprocedural Automatic Parallelization System},
	INDEX ={\indexbib{}},
	BOOKTITLE = malaga95,
	YEAR = 1995,
	MONTH = jun,
	PAGES = {570--579},
	SUMMARY = {Same as~\cite{Hall:95a}. \references{7}}
}


@INPROCEEDINGS{Hall:95c,
	AUTHOR = {Hall, Mary and Murphy, Brian and Amarasinghe, Saman and
		  Liao, Shih-Wei and Lam, Monica},
	TITLE ={Interprocedural Analysis for Parallelization},
	INDEX ={\indexbib{}},
	BOOKTITLE = lcpc,
	YEAR = 1995,
	MONTH = aug,
	PAGES = {5.1--5.14},
	SUMMARY = {Pr{\'e}sente FIAT/SUIF. Ci-apr\`{e}s quelques diff{\'e}rences avec
		  ce que je fais: pas de notion d'exactitude; ils ne
		  d{\'e}crivent aps ce qui se passe lorsque la valeur d'une
		  variable est modifi{\'e}e; ils perdent moins d'info que nous
		  lors de l'{\'e}limination d'une vairable en la rempla\c{c}ant
		  par une variable muette (l'exactitude serait qd m{\^e}me
		  perdue je pense); ils ne disent pas ensuite ce qu'ils font
		  des variables muettes; ils ont une repr{\'e}sentation sous
		  forme de liste de r{\'e}gions; leurs r{\'e}gions ExposedRead
		  sont les upward exposed traditionnels, et sont donc
		  diff{\'e}rent de mes INs; en interproc{\'e}dural, l'id{\'e}e de
		  base est la m{\^e}me que moi, mais ils n'essayent jamais de
		  simplifier; sauf si ce n'est pas lin{\'e}aire, auquel cas,
		  ils cherchent les dimensions semblables, mais c'est tout
		  (pas le syst\`{e}me simplifi{\'e} complet tel que je le
		  d{\'e}finis); ce qu'ils font lorsque les typers ne sont aps
		  les m{\^e}mes n'est pas clair; les commons qui sont
		  d{\'e}clar{\'e}s diff{\'e}remment ne sont pas trait{\'e}s.
   		  \references{19}}
}


@INPROCEEDINGS{Hall:95d,
	AUTHOR = {Hall, Mary and Amarasinghe, Saman and Murphy, Brian and 
		  Liao, Shih-Wei and Lam, Monica},
	TITLE ={Detecting Coarse-Grain Parallelism Using an Interprocedural
		  Parallelizing Compiler},
	INDEX ={\indexbib{}},
	BOOKTITLE = sc,
	YEAR = 1995,
	MONTH = dec,
	SUMMARY = {\references{27}}
}

@ARTICLE{Hans:86,
	AUTHOR = {Hansen, J.V. and Giauque, W.C.},
	TITLE = {Task Allocation in Distributed Processing Systems},
	INDEX ={\indexbib{placement de processus!statique}},
	YEAR = 1986,
	MONTH = aug,
	JOURNAL = {Operations Research Letters},
	VOLUME = 5,
	NUMBER = 3,
	PAGES = {137--143},
}


@INPROCEEDINGS{Hanx:93,
	AUTHOR = {R. von Hanxleden},
	TITLE ={Handling Irregular Problems with {F}ortran {D} : a Preliminary Report},
	INDEX ={\indexbib{}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "353--364",
	SUMMARY = {\references{25}}
}


@ARTICLE{Harr:93,
	AUTHOR = {Harrold, Mary Jean and Malloy, Brian},
	TITLE = {A Unified Interprocedural Program Representation for a
		  Maintenance Environment},
	INDEX ={\indexbib{analyse!interproc{\'e}durale}},
	YEAR = 1993,
	MONTH = jun,
	JOURNAL = ieeetose,
	VOLUME = 19,
	NUMBER = 6,
	PAGES = {584--593},
	SUMMARY = {Encore un autre type de graphe interproc{\'e}dural. Il
		  comporte pour chaque proc{\'e}dure son graphe de d{\'e}pendance,
		  auquel on ajoute un n{\oe}ud d'entr{\'e}e, et un n{\oe}ud
		  d'entr{\'e}e/sortie pour chaque param\`{e}tre formel. On
		  connecte ensuite ces graphes individuels en liant les
		  sites d'appels aux n{\oe}uds d'entr{\'e}e des proc{\'e}dures
		  appel{\'e}es, et les param\`{e}tres r{\'e}els aux param\`{e}tres
		  formels. Il n'est pas pr{\'e}cis{\'e} comment on s'y prend pour
		  un param\`{e}tre r{\'e}el complexe, ou pour un {\'e}l{\'e}ment de
		  tableau. \references{21}}
}


@TECHREPORT{Havl:90,
	AUTHOR = {Havlak, Paul
		and Kennedy, Ken},
	TITLE ={Experience with Interprocedural Analysis of Array Side Effects},
	INDEX ={\indexbib{analyse!interproc{\'e}durale}
		\indexbib{analyse!sections de tableaux}
		\indexbib{analyse!d{\'e}pendances}},
	YEAR = 1990,
	INSTITUTION = rice,
	TYPE = {Computer Science Technical Report},
	NUMBER = {TR90--124},
	SUMMARY = {D{\'e}crit une impl{\'e}mentation des Regular Sections avec
		bornes et pas, pour r{\'e}sumer les effets interproc{\'e}duraux
		sur les sous-tableaux, en vue d'analyser les
		d{\'e}pendances. Les r{\'e}sultats d'exp{\'e}riences men{\'e}es sur la
		biblioth\`{e}que LINPACK et sur des programmes scientifiques
		sont donn{\'e}s.  Ces r{\'e}sultats sont meilleurs que ceux de Li
		\& Yew dans un seul cas.  Ce papier \`{a} le m{\'e}rite d'{\^e}tre
		clair et franc.  Amorce la r{\'e}flexion sur la privatisation
		de tableaux.  Compl{\'e}ment : les indices des tableaux peuvent
		{\^e}tre des expressions affines, d{\'e}pendant de constantes ou
		des valeurs des variables locales ou locales \`{a} l'entr{\'e}e de
		la proc{\'e}dure. Si une telle variable est modifi{\'e}e par un
		CALL, toute information est perdue. Il n'est pas pr{\'e}cis{\'e}
		ce qui est fait lorsqu'elle est modifi{\'e}e mais pas par un
		CALL. \references{29}} }



@ARTICLE{Havl:91,
	AUTHOR = "  Havlak, Paul
		and Kennedy, Ken",
	TITLE = {An Implementation of Interprocedural Bounded Regular
		  Section Analysis}, 
	INDEX ={\indexbib{analyse!interproc{\'e}durale}
		\indexbib{analyse!sections de tableaux}},
	YEAR = 1991,
	MONTH = jul,
	JOURNAL = ieeetpds,
	VOLUME = 2,
	NUMBER = 3,
	PAGES = "350--360",
	SUMMARY = {Analyses \`{a} base de RSD ({\em Regular Section
		Descriptors}) avec bornes et pas.  D{\'e}crit
		l'impl{\'e}mentation, depuis l'analyse locale des RSD, en ne
		tenant pas compte des effets interproc{\'e}duraux; puis
		l'analyse interproc{\'e}durale qui permet de tenir compte de
		ces effets, et qui pose des probl\`{e}mes de traduction. Donne
		des r{\'e}sultats exp{\'e}rimentaux bas{\'e}s sur Linpack et Riceps,
		et les compare avec ceux de Li \& Yew. Rq : c'est
		l'impl{\'e}mentation de \cite{Havl:90}. \references{38}} }



@PHDTHESIS{Havl:94,
	AUTHOR = {Havlak, Paul},
	TITLE ={Interprocedural Symbolic Analysis},
	INDEX ={\indexbib{analyse!interproc{\'e}durale}},
	SCHOOL = rice,
	YEAR = 1994,
	MONTH = may,
	SUMMARY = {Presque tout est dans le titre ! \`{A} relire. C'est tr\`{e}s
		  int{\'e}ressant, distinction entre expressions et pr{\'e}dicats
		  \ldots. pub pour PIPS ! \references{94}}
}


@INPROCEEDINGS{Hein:93,
	AUTHOR = {E.A. Heinz and S.U. H{\"a}nssgen and P. Ludowicz and M. Phillippsen
		and W.F. Tichy},
	TITLE ={The {Modula-2*} Environment for Parallel Programming},
	INDEX ={\indexbib{environnement de programmation}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "92--102",
	SUMMARY = {\references{11}}
}



@INPROCEEDINGS{Hira:94,
	AUTHOR = {Hiranandani, Seema and Kennedy, Ken and Tseng, Chau-Wen
		  and Warren, Scott},
	TITLE ={The {D} Editor: A New Interactive Parallel Programming Tool},
	INDEX ={\indexbib{}},
	BOOKTITLE = ics,
	YEAR = 1994,
	MONTH = nov,
	PAGES = {733--742},
	SUMMARY = {Tout sur l'{\'e}diteur interactif de Fortran D. Pour m{\'e}moire
		  partag{\'e}e, et m{\'e}moire distribu{\'e}e. \references{28}}
}


@MISC{HPFF:94,
	AUTHOR = {High Performance Fortran Forum},
	TITLE ={{HPF-2} Scope of Activities and Motivating Applications},
	INDEX ={\indexbib{langage!HPF}},
	YEAR = 1994,
	MONTH = nov,
	SUMMARY = {\references{104}}
}


@INPROCEEDINGS{Hind:92,
	AUTHOR = {Hind, M. and Burke, M. and Carini, P. and Midkiff, S.},
	TITLE ={Interprocedural Array Analysis : How Much Precision Do We Need ?},
	INDEX ={\indexbib{analyse!interproc{\'e}durale}},
	BOOKTITLE = vienna92,
	YEAR = 1992,
	MONTH = jul,
        PAGES = {48--64},
	SUMMARY = {Conclut que l'analyse interproc{\'e}durale des {\'e}l{\'e}ments de
		  tableaux ne sert pas \`{a} grand chose en elle-m{\^e}me. Mais que
		  utilis{\'e}e pour effectuer des transformations, elle pourrait
		  mettre en {\'e}vidence plus de parall{\'e}lisme. \references{48}}
}





@ARTICLE{Hind:94a,
	AUTHOR = {Hind, Michael and Burke, Michael and Carini, Paul and
		  Midkiff, Sam},
	TITLE = {An Empirical Study of Precise Interprocedural Array Analysis},
	INDEX ={\indexbib{analyse!interproc{\'e}durale}},
	YEAR = 1994,
	MONTH = may,
	JOURNAL = {Scientific Programming},
	VOLUME = 3,
	NUMBER = 3,
	PAGES = {255--271},
	SUMMARY = {Identique \`{a}~\cite{Hind:92}, mais prend en compte les common
		  blocks. Les r{\'e}sultats paraissent moins bons. J'ai demand{\'e} \`{a}
		  M. Hind des explications. \references{53}}
}


@BOOK{Horo:76,
	AUTHOR = {Horowitz, E. and Sahni, S.},
	TITLE = {Fundamentals of Data Structures},
	INDEX ={\indexbib{types de donn{\'e}es}},
	YEAR = 1976,
	PUBLISHER = {Pitman},
	
}


@ARTICLE{Howd:94,
	AUTHOR = {Howden, W.E. and Wieand, Bruce},
	TITLE = {{QDA} -- A Method for Systematic Informal Program Analysis},
	INDEX ={\indexbib{software engineering}},
	YEAR = 1994,
	MONTH = jun,
	JOURNAL = ieeetose,
	VOLUME = 20,
	NUMBER = 6,
	PAGES = {445--462},
	SUMMARY = {QDA stands for Quick Defect Analysis. It is a comments
		  analysis method. \references{36}}
}


@ARTICLE{Huan:94,
	AUTHOR = {Huang, Andrew S. and Slavenburg, Gert and Shen, John Paul},
	TITLE = {Speculative Disambiguation : A compilation Technique for
		  Dynamique Memory Disambiguation},
	INDEX ={\indexbib{analyse!d{\'e}pendances}
                \indexbib{parall{\'e}lisation!dynamique}},
	YEAR = 1994,
	MONTH = apr,
	JOURNAL = SIGARCHN,
	VOLUME = 22,
	NUMBER = 2,
	PAGES = {200--210},
	NOTE = {Special issue : Proceedings of the 21\fup{st} Annual International
		  Symposium on Computer Architecture},
	SUMMARY = {Compilation pour architecture parall\`{e}le grain fin, avec ex{\'e}cution
		  conditionnelle ou sp{\'e}culative. Les d{\'e}pendances sont
		  analys{\'e}es \`{a} l'ex{\'e}cution par ajout de gardes, et
		  l'ex{\'e}cution est sp{\'e}culative : deux chemins sont cr{\'e}{\'e}s,
		  le premier consid{\'e}rant qu'il y a d{\'e}pendance, et le
		  deuxi\`{e}me qu'il n'y a pas d{\'e}pendance. \references{17}}
}


@INPROCEEDINGS{Hulm:93,
	AUTHOR = {J. Hulman and B.M. Chapman and H.P. Zima and S. Andel},
	TITLE ={Intelligent Parallelization within the {V}ienna {F}ortran
		Compilation System},
	INDEX ={\indexbib{parall{\'e}lisation!automatique}
		\indexbib{syst\`{e}me expert}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "455-467",
	SUMMARY = {Parall{\'e}lisation automatique \`{a} l'aide d'un syst\`{e}me
		  expert. 
                  \references{27}}
}



@UNPUBLISHED{Humm:93,
	AUTHOR = {Hummel, Joseph and Hendren, Laurie and Nicolau, Alexandru},
	TITLE ={Applying an Abstract Data Structure Description Approach to
		  Parallelizing Scientific Pointer Programs},
	INDEX ={\indexbib{parall{\'e}lisation!automatique}},
	YEAR = 1993,
	NOTE = {trouv{\'e} dans les papiers de P. Bazet. Ne pas citer, au cas o\`{u}},
	SUMMARY = {J'en ai deux versions. Parall{\'e}lisation de programmes
		  comportant des structures de donn{\'e}es construites \`{a}
		  l'aide de pointeurs. S'appuie sur les ADDs, ou Abstract
		  Description of Data Structures. C'est un m{\'e}canisme pour
		  permettre au programmeur de d{\'e}crire la forme de ses
		  structures de pointeurs, ceci afin d'aider le compilateur.
		  \references{14}}
}
		  

		  

@INPROCEEDINGS{Hwan:95a,
	AUTHOR = {Hwang, Se-Jin and Park, Myong-Soon},
	TITLE ={Loop Transformation Algorithm to Efficiently Insert
		  Prefetching Intructions},
	INDEX ={\indexbib{architecture!caches}},
	BOOKTITLE = hpcs,
	YEAR = 1995,
	MONTH = jul,
	PAGES = {450},
	SUMMARY = {Surtout pour les r{\'e}f{\'e}rences. Peu compr{\'e}hensible \`{a}
		  cause de l'anglais.  \references{3}}
}
		  
		  

%
% -I-
%

@INPROCEEDINGS{Imai:92,
	AUTHOR = {Imai, Toru},
	TITLE ={Detecting more independent loops accross hierarchical structures},
	INDEX ={\indexbib{transformations de programme!{\em loop fission}}
		\indexbib{transformations de programme!{\em loop peeling}}
		\indexbib{}},
	BOOKTITLE = icci,
	YEAR = 1992,
	MONTH = may,
	PAGES = "168--172",
	
}

@TECHREPORT{Inge:92,
        AUTHOR = {Ingels, P.
		and Maziero, C.
		and Raynal M.},
        TITLE ={Un Noyau de Syst\`{e}me R{\'e}parti pour les Applications
		G{\'e}r{\'e}es par un Temps Virtuel},
        INDEX ={\indexbib{temps virtuel}},
        YEAR = 1992,
        MONTH = "janvier",
        INSTITUTION = irisa,
        TYPE = {publication interne},
        NUMBER = 634
}


@TECHREPORT{Irig:90,
	AUTHOR = {Irigoin, Fran\c{c}ois and Jouvelot, Pierre},
	TITLE ={Projet {PIPS}, Analyseur S{\'e}mantique, Rapport de Synth\`{e}se},
	INDEX ={\indexbib{PIPS}},
	YEAR = 1990,
	MONTH = {d{\'e}cembre},
	INSTITUTION = cri-ensmp,
	TYPE = {Document},
	NUMBER = {EMP--CAI--I E--137},
	NOTE = {contrat DRET No. 88.017.01},
	SUMMARY = {Effets, transformers, preconditions, U--D chains, syst\`{e}mes
		  de containtes, syst\`{e}mes g{\'e}n{\'e}rateurs. \references{0}}
}


@INPROCEEDINGS{Irig:91,
	AUTHOR = "Irigoin, Fran\c{c}ois
		and Jouvelot, Pierre
		and Triolet, R{\'e}mi ",
	TITLE = {Semantical Interprocedural Parallelization: 
                 An Overview of the {PIPS} project},
	INDEX = {\indexbib{parall{\'e}lisation!automatique}
		 \indexbib{analyse!s{\'e}mantique}
		 \indexbib{analyse!interproc{\'e}durale}},
	BOOKTITLE = ics,
        PAGES = {144--151},
	YEAR = 1991,
	MONTH = jun,
}

@INPROCEEDINGS{Irig:92,
	AUTHOR = "Irigoin, Fran\c{c}ois",
	TITLE = {Interprocedural Analyses for Programming Environments},
	INDEX = {\indexbib{analyse!interproc{\'e}durale}
		 \indexbib{analyse!s{\'e}mantique}
		 \indexbib{parall{\'e}lisation!automatique}},
	BOOKTITLE = wetpsc,
        PAGES = {333-350},
	YEAR = 1992,
	MONTH = sep,
	SUMMARY = {calcul des tranformers, pr{\'e}conditions, r{\'e}gions;
		  justification de l'utilit{\'e} de leur calcul interproc{\'e}dural}
	
}


%
% -J-
%

@TECHREPORT{Jaco:93,
	AUTHOR = {Jacobs, Ian and Montagnac, Francis and Bertot, Janet
                  and Cl{\'e}ment, Dominique and Prunet, Vincent},
	TITLE ={The {S}ophtalk Reference Manual},
	INDEX ={\indexbib{Foresys}},
	YEAR = 1993,
	MONTH = {f{\'e}vrier},
	INSTITUTION = inria,
	TYPE = {Rapport technique},
	NUMBER = 150,
}


@INPROCEEDINGS{Jacq:89,
	AUTHOR = {Jacqmot, C. and Milgrom, E. and Joosen, W. and Berbers, Y.},
	TITLE ={Naming and Network Transparent Process Migration in Loosely
		  Coupled Distributed Systems},
	INDEX ={\indexbib{placement de processus!dynamique}},
	BOOKTITLE = {IFIP Conference on Decentralized Systems},
	YEAR = 1989,
	MONTH = dec,
	PAGES = {77--92},
}


@ARTICLE{Jeff:85,
        AUTHOR = {Jefferson, David},
        TITLE ={Virtual Time},
        INDEX ={\indexbib{temps virtuel}},
        JOURNAL = toplas,
        YEAR = 1985,
        MONTH = jul,
        PAGES = "404--425",
	VOLUME = 7,
	NUMBER = 3
}

@TECHREPORT{Jeff:89,
        AUTHOR = {Jefferson, David},
        TITLE ={Virtual Time {II} : the Cancelback Protocol for Storage
		  Management in {T}ime {W}arp},
        INDEX ={\indexbib{temps virtuel}},
        YEAR = 1989,
        MONTH = nov,
        INSTITUTION = {UCLA},
        TYPE = "Technical Report"
}



@TECHREPORT{Jegu:93,
	AUTHOR = {J{\'e}gou, Yvon},
	TITLE ={Characterization of Program Dependencies by Integer
		  Programming Techniques},
	INDEX ={\indexbib{analyse!d{\'e}pendances}},
	YEAR = 1993,
	MONTH = {novembre},
	INSTITUTION = inria,
	TYPE = {Rapport de Recherche},
	NUMBER = 2138,
	SUMMARY = {Analyse des d{\'e}pendances \`{a} l'aide de techniques de
		  programmation en nombre entiers. Le but est d'avoir un
		  encadrement de la valeur de la variable, sans perdre trop
		  d'information. Pour cela, des variables {\em
		  artificielles} sont introduites pour exprimer sous fomr
		  d'{\'e}galit{\'e}s les relations entre les variables. 

                  Toutes les varialbes intervenant dans le probl\`{e}me en
		  nombre entier sont consid{\'e}r{\'e}es de la m{\^e}me mani\`{e}re, que
		  ce soit des variables normales ou artificielles, des
		  indices de boucle \ldots. Leur diff{\'e}rence  de nature est
		  exprim{\'e}e sous forme d'{\'e}quations lin{\'e}aires,
		  {\'e}ventuellement \`{a} l'aide de nouvelles variables
		  artificielles. 

                  Ce serait int{\'e}ressant de ragarder de plus pr\`{e}s, car cela
		  peut m'apporter des id{\'e}es pour les r{\'e}gions, la
		  distinction des variables phi des autres variables, et
		  l'introduction de variables suppl{\'e}mentaires. 

                  \references{7}}      
}


@INPROCEEDINGS{Jemn:94,
	AUTHOR = {Jemni, M. and Mahjoub Z.},
	TITLE ={Autour de la Parall{\'e}lisation d'une Boucle Conditionnelle Statique},
	INDEX ={\indexbib{analyse!d{\'e}pendances}},
	BOOKTITLE = renpar,
	YEAR = 1994,
	MONTH = {juin},
	PAGES = {69--72},
	NOTE = {},
	SUMMARY = {\references{4}}
}

		  
@ARTICLE{Jere:95a,
	AUTHOR = {Jeremiassen, Tor and Eggers, Susan},
	TITLE = {Reducing False Sharing on Shared Memory Multiprocessors
		  through Compile Time Data Transformations},
	INDEX ={\indexbib{architecture!cache}},
	YEAR = 1995,
	MONTH = aug,
	JOURNAL = sigplan,
	VOLUME = 30,
	NUMBER = 8,
	PAGES = {179--188},
	SUMMARY = {Restructuration des donn{\'e}es du programme explicitement
		  parall\`{e}le pour r{\'e}duire les conflits de cache. Ainsi, les
		  donn{\'e}es locales sont group{\'e}es dans la m{\^e}me page, alors
		  que les donn{\'e}es partag{\'e}es sont s{\'e}par{\'e}es. Augmente la
		  vitesse d'ex{\'e}cution et la {\em scalabilit{\'e}}. \references{37}}
}
		  

@INPROCEEDINGS{Jess:93,
	AUTHOR = {C.R. Jesshope and V.B. Muchnick A.V. Shafarenko and C.D. Sutton},
	TITLE ={{F--code} and its Implementation : a Portable Software
		  Platform for Data Parallelism},
	INDEX ={\indexbib{repr{\'e}sentation interm{\'e}diaire}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "209--224",
	SUMMARY = {\references{25}}
}

@ARTICLE{Jim:94,
	AUTHOR = {Jim Li, Chung-Chi and Stewart, Elliot M. and Fuchs, W. Kent},
	TITLE = {Compiler-assisted Full Checkpointing},
	INDEX ={\indexbib{}},
	YEAR = 1994,
	MONTH = oct,
	JOURNAL = spe,
	VOLUME = 24,
	NUMBER = 10,
	PAGES = {871--886},
	SUMMARY = {Checkpointing : technique pour les syst\`{e}mes \`{a}
		  tol{\'e}rance de panne (fault-tolerant computing
		  environments).  Consiste \`{a} faire un rollback en cas
		  de probl\`{e}me. Il faut donc sauver le contexte du programme
		  \`{a} intervalles r{\'e}guliers. Ce qui est fait en ajoutant des
		  appels \`{a} une biblioth\`{e}que de fonctions d{\'e}di{\'e}e. Le
		  probl\`{e}me est de savoir o\`{u} placer ces appels de
		  fonction. Pour cela, une des techniques utilis{\'e}es
		  s'appuie sur un profiling du programme instrument{\'e} ;  
		  les informations collect{\'e}es sur la fr{\'e}quence de chacun
		  des appels \`{a} la biblioth\`{e}que, sur l'entrelacement de
		  ces appels, et sur la taille des informations
		  sauvegard{\'e}es. 

                  Id{\'e}e fi : application possible des r{\'e}gions IN, pour
		  sauvegarder moins d'information au niveau des points de
		  continuation.
                  references{26}}
}


@INPROCEEDINGS{John:93,
	AUTHOR = {S.L. Johnson and A. Ruttenberg and R.G. Brickner and W. George},
	TITLE ={A Stencil Compiler for the {C}onnexion {M}achine Models {CM-2/200}},
	INDEX ={\indexbib{}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "68--78",
	SUMMARY = {\references{6}}
}

@UNPUBLISHED{Jour:94,
        AUTHOR = "  Jourdan, Jean
                and Fages, Fran\c{c}ois
                and Rozzonelli, Didier
                and Demeure, Alain",
        TITLE ={Data Alignment and Task Scheduling on Parallel Machines
                  using Concurrent Model-based Programming},
        INDEX ={\indexbib{distribution! de donn{\'e}es}
                \indexbib{placement!statique }},
        YEAR = 1994,
        NOTE = {Soumis \`{a} publication},
        SUMMARY = {Les auteurs consid\`{e}rent les probl\`{e}mes d'alignement de
                  partitionnement des donn{\'e}es, et de placement et
                  d'ordonnancement des t{\^a}ches comme un probl\`{e}me global. Il
                  est formalis{\'e} sous forme d'un syst\`{e}me de contrainte
                  {\em \`{a} la prolog} et r{\'e}solu par un moteur en fonction
                  des objectifs assign{\'e}s. Le miracle semble avoir lieu. \references{25}}
}





@PHDTHESIS{Jouv:87,
	AUTHOR = {Jouvelot, Pierre},
	TITLE ={Parall{\'e}lisation S{\'e}mantique : Une Approche D{\'e}notationnelle
		  Non-Standard pour la Parall{\'e}lisation de Programmes
		  Imp{\'e}ratifs S{\'e}quentiels.},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es}
                \indexbib{interpr{\'e}tation abstraite}},
	SCHOOL = paris-6,
	YEAR = 1987,
	SUMMARY = {\references{143}}
}


@TECHREPORT{Jouv:87b,
	AUTHOR = {Jouvelot, Pierre and Feautrier, Paul},
	TITLE ={Parall{\'e}lisation S{\'e}mantique},
	INDEX ={\indexbib{parall{\'e}lisation!automatique}
                \indexbib{interpr{\'e}tation abstraite}},
	YEAR = 1987,
	MONTH = oct,
	INSTITUTION = paris-6,
	TYPE = {Rapport de Recherche},
	NUMBER = 230,
	SUMMARY = {\references{36}}
}


@TECHREPORT{Jouv:89,
	AUTHOR = {Jouvelot, Pierre
		and Triolet, R{\'e}mi},
	TITLE ={NewGen : A Langage-Independent Program Generator},
	INDEX ={\indexbib{NewGen}},
	YEAR = 1989,
	MONTH = jul,
	INSTITUTION = cri-ensmp,
	TYPE = {rapport interne},
	NUMBER = {EMP-CRI 191},
}

@MANUAL{Jouv:90,
	TITLE ={NewGen User Manual},
	ORGANIZATION = cri-ensmp,
	AUTHOR = {Jouvelot, Pierre
		and Triolet, R{\'e}mi},
	YEAR = 1990,
	MONTH = dec,
	INDEX ={\indexbib{NewGen}},
	SUMMARY = {}
}

%
% -K-
%

@ARTICLE{Kam:76,
	AUTHOR = {Kam, John B. and Ullman, Jeffrey D.},
	TITLE = {Global Data Flow Analysis and Iterative Algorithms},
	INDEX ={\indexbib{analyse flot de donn{\'e}es!scalaires}},
	YEAR = 1976,
	MONTH = jan,
	JOURNAL = jacm,
	VOLUME = 23,
	NUMBER = 1,
	PAGES = {158--171},
	SUMMARY = {\references{14}}
}


@INPROCEEDINGS{Kasa:93,
	AUTHOR = {H. Kasahara and M. Okamoto and K. Aida and A. Yoshida and W. Ogata
		and H. Honda},
	TITLE ={Fortran macro-dataflow compiler},
	INDEX ={\indexbib{analyse flot de donn{\'e}es}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "265--286",
	SUMMARY = {\references{39}}
}


@ARTICLE{Keef:95,
	AUTHOR = {O'Keefe, Matthew and Parr, Terence and Edgar, B. Kevin and
		  Anderson, Steve and Woodard, Paul and Dietz, Hank},
	TITLE = {The {F}ortran-{P} Translator: Towards Automatic Translation
		  of {F}ortran 77 Programs for Massively Parallel Processors},
	INDEX ={\indexbib{parall{\'e}liseur!Fortran-P}},
	YEAR = 1995,
	MONTH = apr,
	JOURNAL = {Scientific Programing},
	VOLUME = 4,
	NUMBER = 2,
	PAGES = {1--21},
	SUMMARY = {\references{44}}
}


@INPROCEEDINGS{Kell:95a,
	AUTHOR = {Kelly, Wayne and Pugh, William and Rosser, Evan and
		  Shpeisman, Tatiana},
	TITLE ={Transitive Closure of Infinite Graphs and Its Applications},
	INDEX ={\indexbib{}},
	BOOKTITLE = lcpc,
	YEAR = 1995,
	MONTH = aug,
	PAGES = {9.1--9.15},
	SUMMARY = {\references{8}}
}


@ARTICLE{Kels:95a,
	AUTHOR = {Kelsey, Richard},
	TITLE = {A Correspondence between Continuation Passing Style and
		  Static Single Assignement Form},
	INDEX ={\indexbib{}},
	YEAR = 1995,
	JOURNAL = sigplan,
	VOLUME = 30,
	NUMBER = 3,
	PAGES = {13--22},
	NOTE = {In Workshop on Intermediate Representation, january 1995},
	SUMMARY = {\references{13}}
}

		  
@INPROCEEDINGS{Kenn:92a,
	AUTHOR = {Kennedy, Ken and McKinley, Kathrin},
	TITLE ={Optimizing for Parallelism and Data Locality},
	INDEX ={\indexbib{optimisation/transformations!localit{\'e}}},
	BOOKTITLE = ics,
	YEAR = 1992,
	MONTH = jul,
	PAGES = {323--334},
	SUMMARY = {\references{29}}
}


@ARTICLE{Kenn:93,
	AUTHOR = {Kennedy, Ken and McKinley, Kathryn and Tseng, Chau-Wen},
	TITLE = {Analysis and Transformation in an interactive Parallel
		  Programming Tool},
	INDEX ={\indexbib{parall{\'e}lisation!automatique}},
	YEAR = 1993,
	MONTH = oct,
	JOURNAL = cpe,
	VOLUME = 5,
	NUMBER = 7,
	PAGES = {575--602},
	SUMMARY = {Description de {PED}, le successeur de PFC. D{\'e}crit
		  toutes les phases d'analyse et de transformation de fa\c{c}on
		  assez rapide. Int{\'e}ressante bibliographie, qui d{\'e}crit
		  tous les parall{\'e}liseurs. \references{50}}
}


@ARTICLE{Kenn:94,
	AUTHOR = {Kennedy, Ken},
	TITLE = {Compiler Technology for Machine-Independent Parallel Programming},
	INDEX ={\indexbib{compilation}},
	YEAR = 1994,
	MONTH = feb,
	JOURNAL = ijpp,
	VOLUME = 22,
	NUMBER = 1,
	PAGES = {79--98},
	SUMMARY = {\references{36}}
}


@BOOK{Kern:84,
	AUTHOR = "Kernighan, Brian W.
		and Pike, Rob",
	TITLE = {The Unix Programming Environment},
	INDEX ={\indexbib{syst\`{e}me d'exploitation!Unix}
		\indexbib{langage!C}},
	PUBLISHER = phi,
	YEAR = 1984,
}	

@INPROCEEDINGS{Kess:93,
	AUTHOR = {C.W. Kessler},
	TITLE ={Pattern Recongnition Enables Automatic Parallelization of
		Numerical Codes},
	INDEX ={\indexbib{parall{\'e}lisation!automatique}
		\indexbib{optimisation/transformations!{\em pattern matching}}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "385--397",
	SUMMARY = {\references{30}}
}


@UNPUBLISHED{Kess:94,
	AUTHOR = {Kessler, Christoph},
	TITLE ={Symbolic Array Data Flow Analysis and Pattern Recognition in
		  Dense Matrix Computations},
	INDEX ={\indexbib{analyse flot de donn{\'e}es!tableaux}
                \indexbib{optimisation/transformations!{\em pattern matching}}},
	YEAR = 1994,
	NOTE = {submitted somewhere. do not quote},
	SUMMARY = {pas vraiment clair !\references{34}}
}


@INPROCEEDINGS{Kild:73,
	AUTHOR = {Kildall, Gary A.},
	TITLE ={A Unified Approach to Global Program Optimization},
	INDEX ={\indexbib{analyse flot de donn{\'e}es!framework}},
	BOOKTITLE = popl,
	YEAR = 1973,
	MONTH = jan,
	PAGES = {194--206},
	SUMMARY = {Description de la m{\'e}thode it{\'e}rative de r{\'e}solution des
		  probl\`{e}mes de flot de donn{\'e}es. \references{49}}
}


@INPROCEEDINGS{Kinl:94,
	AUTHOR = {McKinley, Kathryn},
	TITLE ={Evaluating Automatic Parallelization for Efficient Execution on
		  Shared-Memory Multiprocessors},
	INDEX ={\indexbib{parall{\'e}lisation!besoins}},
	BOOKTITLE = ics,
	YEAR = 1994,
	SUMMARY = {Rassemblement de diverses techniques d{\'e}j\`{a} publi{\'e}es.
		  Exp{\'e}riences sur des programmes bien structur{\'e}s, avec
		  un fort taux de parall{\'e}lisme intrins\`{e}que. Introduction des
		  {\em sections}, une version suppl{\'e}mentaire des RSDs. 
		  \references{10}}
}

@ARTICLE{Klei:95a,
	AUTHOR = {Kleinrubatscher, Paul and Kriegshaber, Albert and
		  Z{\"o}chling, Robert and gl{\"u}ck, Robert},
	TITLE = {Fortran Program Specialization},
	INDEX ={\indexbib{optimisation/transformations!{\'e}valuation partielle}},
	YEAR = 1995,
	MONTH = apr,
	JOURNAL = sigplan,
	VOLUME = 30,
	NUMBER = 4,
	PAGES = {61--70},
	SUMMARY = {{\'E}valuateur partiel d'un sous-ensemble de Fortran
		  77. En entr{\'e}e : un program Fortran et un sous-ensemble
		  des donn{\'e}es d'entr{\'e}e; en sortie, un program Fortran
		  sp{\'e}cialis{\'e} pour l'ensemble des donn{\'e}es d'entr{\'e}e.
		  \references{25}}
}


@INPROCEEDINGS{Kley:93,
	AUTHOR = {M.F. Kleyn and J.C. Browne},
	TITLE ={A High Level Language for Specifying Graph Based Languages
		  and their Programming Environments},
	INDEX ={\indexbib{visualisation}},
	BOOKTITLE = icse,
	YEAR = 1993,
	PAGES = "324--338",
	SUMMARY = {\references{46}}
}


@INPROCEEDINGS{Kolt:95a,
	AUTHOR = {Kolte, Priyadarshan and Wolfe, Michael},
	TITLE ={Elimination of Redundant Array Subscript Range Checks},
	INDEX ={\indexbib{compilation!d{\'e}tection erreurs}},
	BOOKTITLE = pldi,
	YEAR = 1995,
	MONTH = jun,
	PAGES = {270--278},
	NOTE = {In} # sigplan,
	SUMMARY = {La m{\'e}thode elle-m{\^e}me ne me concerne pas vraiment, mais
		  le related work est int{\'e}ressant car parle aussi de la
		  d{\'e}tection des erreurs \`{a} la compilation. \references{18}}
}
		  
		  
		  
@INPROCEEDINGS{Krem:93,
	AUTHOR = {U. Kremer},
	TITLE ={{NP}--completeness of Dynamic Remapping},
	INDEX ={\indexbib{}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "135--141",
	SUMMARY = {\references{7}}
}

%
% -L-
%


@TECHREPORT{Lako:94,
	AUTHOR = {Lakos, Charles},
	TITLE ={Object Petri Nets --- Definition and Relationship to Coloured
		  Petri Nets},
	INDEX ={\indexbib{r{\'e}seaux de Petri}},
	YEAR = 1994,
	INSTITUTION = {University of Tasmania (Australia)},
	TYPE = {Technical report},
	NOTE = {Available by anonymous ftp at {\tt opn.cs.utas.edu.au}, file
		  {\tt /pub/postscript/tr94-3.ps.Z}.},
}


@PHDTHESIS{Lamo:91,
	AUTHOR = {Lamour, Fran\c{c}oise},
	TITLE ={Contribution aux Probl\`{e}mes de Placement Sans Routage sur un
		  R{\'e}seau de Transputers},
	INDEX ={\indexbib{placement de processus!statique}},
	SCHOOL = paris-6,
	YEAR = 1991,
	MONTH = {avril},
	SUMMARY = {\references{26}}
}


@ARTICLE{Lamp:78,
	AUTHOR = {Lamport, Leslie},
	TITLE = {Time, Clocks, and the ordering of events in a distributed system},
	INDEX ={\indexbib{temps virtuel}},
	YEAR = 1978,
	MONTH = jul,
	JOURNAL = cacm,
	VOLUME = 21,
	NUMBER = 7,
	PAGES = "558--565"
}


@ARTICLE{Lebe:94,
	AUTHOR = {Lebeck, Alvin R. and Wood, David A.},
	TITLE = {Cache Profiling and the {SPEC} Benchmarks: A Case Study},
	INDEX ={\indexbib{performance}
                \indexbib{cache}},
	YEAR = 1994,
	MONTH = oct,
	JOURNAL = {Computer},
	VOLUME = 27,
	NUMBER = 10,
	PAGES = {15--26},
	SUMMARY = {Pas mal car indique tous les pb que pose un cache.
		  \references{12}}
}

	  
@ARTICLE{Lee:95a,
	AUTHOR = {Lee, Yong-Fong and Ryder, Barbara and Fiuczynski, Marc},
	TITLE = {Region Analysis: a parallel elimination method for data flow
		  analysis},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es} 
		\indexbib{compilation!parall\`{e}le}},
	YEAR = 1995,
	MONTH = nov,
	JOURNAL = ieeetose,
	VOLUME = 21,
	NUMBER = 11,
	PAGES = {913--926},
	SUMMARY = {See~\cite{Ryde:93} \references{33}}
}

		  

@TECHREPORT{LeFu:93,
	AUTHOR = {Le Fur, Marc and Pazat, Jean-Louis and Andr{\'e} Fran\c{c}oise},
	TITLE ={Static Domain Analysis for Compiling Commutative Loop Nests},
	INDEX ={\indexbib{distribution! de code} 
                \indexbib{poly\`{e}dres}},
	YEAR = 1993,
	MONTH = oct,
	INSTITUTION = irisa,
	TYPE = {Rapport de Recherche},
	NUMBER = 2067,
	SUMMARY = {Optimisation des communications lors de la compilation
		  des boucles pour un mod\`{e}le SPMD, et en repectant la
		  r\`{e}gle {\em owner write rule}. Pour cela, tout doit
		  {\^e}tre affine (et m{\^e}me encore plus restreint, car les
		  m{\'e}thodes employ{\'e}es reposent sur la repr{\'e}sentation des
		  contraintes sous forme de poly\`{e}dres).  Le code est
		  transform{\'e} de mani\`{e}re \`{a} grouper les
		  communications. Pour cela, ils utilisent des m{\'e}thodes de
		  parcours de poy\`{e}dres
		  \references{12}}
}


@ARTICLE{Leiv:93,
	AUTHOR = {Leivent, Jonathan I. and Watro, Ronald J.},
	TITLE = {Mathematical Foundations for Time Warp Systems},
	INDEX ={\indexbib{temps virtuel!time warp}},
	YEAR = 1993,
	MONTH = nov,
	JOURNAL = toplas,
	VOLUME = 15,
	NUMBER = 5,
	PAGES = {771--794},
	SUMMARY = {V{\'e}rification de trois points : safety, progress and
		  termination. \references{11}}
}


@TECHREPORT{Leng:93,
	AUTHOR = {Lengauer, Christian},
	TITLE ={Loop Parallelization in the Polytope Model},
	INDEX ={\indexbib{poly\`{e}dres}},
	YEAR = 1993,
	MONTH = jun,
	INSTITUTION = passau,
	TYPE = {Technisches Bericht},
	NUMBER = {MIP-9303},
	NOTE = {Invited Paper at Concur'93},
	SUMMARY = {Tout sur la g{\'e}n{\'e}ration de code parall\`{e}le \`{a} partir de
		  nids de boucles parfaits, et ayant de bonnes
		  propri{\'e}t{\'e}s. 
                  \references{60}}
}


@TECHREPORT{Lese:94,
	AUTHOR = {Leservot, Arnauld},
	TITLE ={Extension de {C3} aux unions de Poly\`{e}dres},
	INDEX ={\indexbib{poly\`{e}dres}},
	YEAR = 1994,
	MONTH = {janvier},
	INSTITUTION = cea,
	TYPE = {Rapport Technique},
	SUMMARY = {Pr{\'e}sentation des disjonctions et des chemins. \references{3}}
}



@PHDTHESIS{Lese:96a,
	AUTHOR = {Leservot, Arnauld},
	TITLE ={Analyses interproc{\'e}durales du flot des donn{\'e}es},
	INDEX ={\indexbib{}},
	SCHOOL = paris-6,
	YEAR = 1996,
	MONTH = mar,
	
}


@ARTICLE{Li:88,
	AUTHOR = {Li, Z. and Yew, P.-C.},
	TITLE = {Efficient Interprocedural Analysis and Program
		  Restructuring for Parallel Programs},
	INDEX ={\indexbib{analyse!interproc{\'e}durale}},
	YEAR = 1988,
	JOURNAL = sigplan,
	VOLUME = 23,
	NUMBER = 9,
	PAGES = {85--99},
	SUMMARY = {Pr{\'e}sentation des atomes, structure de donn{\'e}es
		  permettant de propager inteproc{\'e}duralement les valeurs
		  des indices de tableaux. Remarques : rien n'est dit sur la
		  mani\`{e}re dont les {\em atome images} son fabriqu{\'e}es
		  lorsque l'on a des r{\'e}f{\'e}rences \`{a} plusieurs {\'e}l{\'e}ments
		  d'un m{\^e}me tableau \`{a} l'int{\'e}rieur d'une m{\^e}me routine. 
                  Le test de d{\'e}pendence est ex{\'e}cut{\'e} dimension par
		  dimension. \references{38}}
}



@INPROCEEDINGS{Li:89,
	AUTHOR = {Li, Zhiyuan and Yew, Pen-Chung and Zhu, Chuang-Qi},
	TITLE ={Data Dependence Analysis on Multi-Dimensional Array References},
	INDEX ={\indexbib{analyse!d{\'e}pendances}},
	BOOKTITLE = ics,
	YEAR = 1989,
	MONTH = jun,
	PAGES = {215--224},
	SUMMARY = {Pr{\'e}sente un test de d{\'e}pendances, le $\lambda$-test,
		  prenant en compte les indices de tableaux coupl{\'e}s,
		  c'est-\`{a}-dire dont les expressions d{\'e}pendent des m{\^e}me
		  indices de boucles. Par cons{\'e}quence, leur test marche pour des
		  tableaux multidimensionnels. \references{14}}
}



@INPROCEEDINGS{Li:92,
	AUTHOR = {Li, Zhiyuan},
	TITLE ={Array Privatization for Parallel Execution of Loops},
	INDEX ={\indexbib{parall{\'e}lisation}
		\indexbib{transformations de programme!privatisation de tableaux}},
	BOOKTITLE = ics,
	YEAR = 1992,
	MONTH = jul,
	PAGES = "313--322",
	SUMMARY = {Pr{\'e}sente un algorithme complet de privatisation de
		  sections de tableaux. Tous les types de graphe de
		  contr{\^o}le sont accept{\'e}s, mais l'algorithme est tout
		  d'abord pr{\'e}sent{\'e} pour un graphe de contr{\^o}le
		  hi{\'e}rarchique comme dans PIPS. L'analyse est
		  intraproc{\'e}durale, et se fait en trois phases. La
		  privatisabilit{\'e} est tout d'abord d{\'e}tect{\'e}e (c'est mieux
		  formalis{\'e} que dans~\cite{Feau:88}. Ensuite, la
		  n'ecessit{\'e} de copy-out est recherch{\'e}e. Si il n'est pas
		  n{\'e}cessaire d'exporter des parties du tableau candidat \`{a}
		  la privatisation, celui-ci est privatis{\'e}. Ceci est
		  d{\'e}tect{\'e} par une live array analysis. Dans le cas
		  contraire, il faut d{\'e}terminer les it{\'e}rations qui
		  fournissent la derni\`{e}re valeur des diff{\'e}rents {\'e}l{\'e}ments
		  privatis{\'e}s. Si cette d{\'e}termination est impossible, le
		  tableau n'est pas privatis{\'e}. Vient ensuite une phase de
		  g{\'e}n{\'e}ration de code, avec constructions DOALL et
		  private. La repr{\'e}sentation choisie pour r{\'e}sumer les
		  ensembles d'{\'e}l{\'e}ments de tableaux n'est pas
		  pr{\'e}cic{\'e}e. C'est un papier purement th{\'e}orique, avec de
		  petits exemples d'{\'e}cole. Rq : cela doit fonctionner pour
		  les sections de tableaux. \references{17}}
}


@MANUAL{Li:94,
	TITLE ={{\em {L}ambda} : A Loop Transformation Tool-kit (User's
		  Reference Manual)},
	ORGANIZATION = {Department of Computer Science, Cornell University,
		  Ithaca, New York},
	AUTHOR = {Li, Wei},
        EDITION = {Preliminary version},
	YEAR = 1994,
	INDEX ={\indexbib{transformations de programme}},
	SUMMARY = {Pas tr\`{e}s int{\'e}ressant pour moi. Implantation des
		  tansformations de boucles sous forme de matrices
		  non-singuli\`{e}res. \references{0}}
}


@ARTICLE{Lin:87,
	AUTHOR = {Lin, C.H. and Keller, R.M. },
	TITLE = {The Gradient Model Load Balancing Method},
	INDEX ={\indexbib{placement de processus!dynamique}},
	YEAR = 1987,
	MONTH = jan,
	JOURNAL = ieeetose,
	VOLUME = {SE--13},
	NUMBER = 1,
	PAGES = {32--38},
}

@BOOK{Lisk:86,
	AUTHOR = {Liskov, B. and Guttag, J.},
	TITLE = {Abstraction and Specification in Program Development},
	INDEX ={\indexbib{type de donn{\'e}es}},
	YEAR = 1986,
	PUBLISHER = {MIT Press and McGraw-Hill},
}



@INPROCEEDINGS{Lisp:94,
	AUTHOR = {Lisper, Bjo"rn and Collard, Jean-Fran\c{c}ois},
	TITLE ={Extent Analysis of Data Fields},
	INDEX ={\indexbib{interpr{\'e}tation abstraite}},
	BOOKTITLE = sas,
	YEAR = 1994,
	MONTH = sep,
	PAGES = {208--222},
	SUMMARY = {\references{19}}
}


@INPROCEEDINGS{Lo:84,
	AUTHOR = {Lo, Virginia Mary},
	TITLE ={Heuristic Algorithms for Task Assignment in Distributed Systems},
	INDEX ={\indexbib{placement de processus!statique}},
	BOOKTITLE = icdcs,
	YEAR = 1984,
	PAGES = {30--39},
	SUMMARY = {\references{18}}
}

@INPROCEEDINGS{Lo:88,
	AUTHOR = {Lo, Virginia Mary},
	TITLE ={Algorithms for Static Task Assignment and Symetric Contraction
		  in Distributed Systems},
	INDEX ={\indexbib{placement de processus!statique}},
	BOOKTITLE = icpp,
	YEAR = 1988,
	PAGES = {239--244},
}


@ARTICLE{Loel:94,
	AUTHOR = {Loelinger, Jon and Metzger, Robert},
	TITLE = {Developing and Interprocedural Optimizing Compiler},
	INDEX ={\indexbib{analyse!interproc{\'e}durale}},
	YEAR = 1994,
	MONTH = apr,
	JOURNAL = sigplan,
	VOLUME = 29,
	NUMBER = 4,
	PAGES = {41--48},
	SUMMARY = {Architecture et {\'e}tapes de d{\'e}veloppement d'un
		  compilateur interproc{\'e}dural chez Convex Computer
		  Corporation. Compilateur C et Fortran. Plusieurs passes
		  intra- et inter-proc{\'e}durales en alternance. Expansion et
		  cl{\^o}nage de proc{\'e}dures. Tout est automatique, i.e. pas
		  d'intervention de l'utilisateur. Temps de compilation
		  raisonnable (minutes). \references{4}}
}


%
% -M-
%


@INPROCEEDINGS{Magh:92,
	AUTHOR = {Maghrabi, Tala and Forouzan, Golshani},
	TITLE ={Automatic Program Generation Using Sequent Calculus},
	INDEX ={g{\'e}n{\'e}ration automatique de programme},
	BOOKTITLE = csc,
	YEAR = 1992,
	MONTH = mar,
	PAGES = {73--81},
	SUMMARY = {\references{22}}
}

@TECHREPORT{Mahe:93,
        AUTHOR = "  Mah{\'e}o, Yves
                and Pazat, Jean-Louis",
        TITLE ={Distributed Array Management for HPF Compilers},
        INDEX ={\indexbib{compilation!allocation}},
        YEAR = 1993,
        MONTH = dec,
        INSTITUTION = irisa,
        TYPE = "Publication interne ",
        NUMBER = 787,
        COUNTS = {\references{13}, \pages{13}},
        SUMMARY = {Gestion de la m{\'e}moire pour les tableaux r{\'e}partis avec
                  un syst\`{e}me de pagination logicielle. Une fonction
                  lin{\'e}aire est choisie qui permet de passer des indices
                  globaux \`{a} un entier. En d{\'e}composant cet entier dans une
                  base donn{\'e}e, on peut l'interpr{\'e}ter comme un num{\'e}ro de
                  page et un offset dans la page. Les auteurs sugg\`{e}rent
                  d'utiliser cette approche pour allouer les portions
                  locales de tableau {\em et} les portions distantes, en
                  g{\'e}rant ainsi de mani\`{e}re unifi{\'e}e l'adressage tableaux
                  locaux et temporaires. Puissances de 2 recherch{\'e}es et
                  appr{\'e}ci{\'e}es. Seules les pages non vides sont
                  allou{\'e}es. Ajoute un niveau d'indirection pour l'acc\`{e}s, \`{a}
                  travers la table associant la base des blocs aux num{\'e}ros
                  de pages. Il faut faire \`{a} un moment donn{\'e} l'allocation,
                  et donc {\'e}num{\'e}r{\'e} ces pages (techniques de manipulation de
                  polyh\`{e}dres utilisables ?). Calcul de l'appartenance peut
                  {\^e}tre «~compil{\'e}~» dans un tableau de bits. Petite revue
                  des diff{\'e}rentes techniques d'adressage propos{\'e}es, pour
                  les temporaires et les tableaux (tables de hashage,
                  recouvrements, etc.).}
}



@INPROCEEDINGS{Manj:95a,
	AUTHOR = {Manjikian, Naraig and Abdelrahman, Tarek},
	TITLE ={Array Data Layout for the Reduction of Cache Conflicts in
		  Loop Nests},
	INDEX ={\indexbib{architecture!caches}
		\indexbib{optimisation/transformations!localit{\'e}}},
	BOOKTITLE = hpcs,
	YEAR = 1995,
	MONTH = jul,
	PAGES = {449},
	SUMMARY = {{\em cache partitionning\/} i.e. division du cache en
		  parts {\'e}gales, et allocation de chaque tableau dans une
		  partition dif{\'e}rente. \references{3}}
}

		  
		  
@INPROCEEDINGS{Mark:82,
	AUTHOR = {Markstein, V. and Cocke, J. and Markstein, P.},
	TITLE ={Optimization of Range Checking},
	INDEX ={\indexbib{optimisation de programme}},
	BOOKTITLE = acm-scc,
	YEAR = 1982,
	MONTH = jun,
	PAGES = {114--119},
}


		  
@TECHREPORT{Marl:95a,
	AUTHOR = {Marlowe, Thomas and Ryder, Barbara and Burke, Michael},
	TITLE ={Defining Flow Sensitivity in Data Flow Problems},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es}},
	YEAR = 1995,
	MONTH = jul,
	INSTITUTION = {Rutgers University, Laboratory of Computer Science},
	TYPE = {Research Technical Report},
	NUMBER = {lcsr-tr-249},
	SUMMARY = {Donne un crit\`{e}re de caract{\'e}risation des analyses
		  flow-sensitives apr\`{e}s avoir examin{\'e} les crit\`{e}res
		  explicites ou implicites d{\'e}j\`{a} donn{\'e}es dans d'autres
		  {\'e}tudes. (Cf. mon cahier bleu). \references{45}}
}

		  
@ARTICLE{Marr:93,
	AUTHOR = {Marriot, Kim},
	TITLE = {Frameworks for Abstract Interpretation},
	INDEX ={\indexbib{interpr{\'e}tation abstraite}},
	YEAR = 1993,
	JOURNAL = actinf,
	VOLUME = 30,
	NUMBER = 2,
	PAGES = {103--129},
}

@BOOK{Mart:86,
	AUTHOR = {Martin, Johannes J.},
	TITLE = {Data Types and Data Structures},
	INDEX ={\indexbib{types de donn{\'e}es}},
	YEAR = 1986,
	PUBLISHER = phi,
	
}


@INPROCEEDINGS{Masl:92,
	AUTHOR = {Maslov, Vadim},
	TITLE ={Delinearization: an Efficient Way to Break Multiloop
		  Dependence Equations},
	INDEX ={\indexbib{polyn{\^o}mes}},
	BOOKTITLE = pldi,
	YEAR = 1992,
	MONTH = jun,
	PAGES = {152--161},
	SUMMARY = {D{\'e}lin{\'e}arisation, premi\`{e}re approche. Transforme une
		  {\'e}quation comportant plusieurs variables en plusieurs
		  {\'e}quations comportant chacune moins de variables, et
		  portant sur des variables diff{\'e}rentes. Le syst\`{e}me est
		  {\'e}quivalent au syst\`{e}me initial. Le principe qui soutend
		  cela est le suivant : si $ N e_1 + e_2 = 0 $ et $ 1-N \leq
		  e_2 \leq N-1 $ alors  $ e_1 = e_2 = 0 $. Rendu oblsol\`{e}te
		  par \cite{Masl:94a}. \references{29}}
}



@INPROCEEDINGS{Masl:94,
	AUTHOR = {Maslov, Vadim},
	TITLE = {Lazy Array Data-Flow Analysis},
	INDEX = {\indexbib{analyse!flot de donn{\'e}es}
               \indexbib{analyse!d{\'e}pendances}},
	BOOKTITLE = popl,
	YEAR = 1994,
	MONTH = jan,
	PAGES = {311--325},
	SUMMARY = {calcul des relations de d{\'e}pendences {\em value-based}
		  exactes pour des portions de programmes affines, et
		  approximatives pour des portions de programmes non-affines.
		  Les fonctions-source d'une instruction sont calcul{\'e}es en
		  commen\c{c}ant la recherche par les instructions les plus proches
		  dans l'ordre lexicographique ; la recherche se poursuit en
		  examinant des instructions de plus en plus distantes. La
		  recherche s'arr{\^e}te lorsque la r{\'e}f{\'e}rence en lecture est
		  couverte par toutes les {\'e}critures de la fonction-source. La
		  d{\'e}finition des fonctions-source est celle de
		  Feautrier~\cite{Feau:91}, mais c'est l'algorithme de calcul
		  qui diff\`{e}re. Le traitement des parties de programmes
		  non-affines se fait \`{a} partir du concept de {\em constantes 
                  symboliques}, ou constante locale. Je ne vois pas la
		  diff{\'e}rence de cette approche avec l'approche de PIPS pour
		  le calcul des r{\'e}gions (algorithme d{\'e}crit dans \cite{Apvr:94a}). 
		  \references{26}}
}


@TECHREPORT{Masl:94a,
	AUTHOR = {Maslov, Vadim and Pugh, William},
	TITLE ={Simplifying Polynomial Constraints Over Integers to Make
		  Dependence Analysis More Precise},
	INDEX ={\indexbib{analyse!d{\'e}pendances}
                 \indexbib{polyn{\^o}mes}},
	YEAR = 1994,
	MONTH = feb,
	INSTITUTION = maryland,
	TYPE = {Technical Report},
	NUMBER = {CS-TR-3109.1},
	SUMMARY = {Transformation de contraintes ({\'e}galit{\'e}s et
		  in{\'e}galit{\'e}s) polyn{\^o}miales en disjonctions de poly\`{e}dres
		  lorsque cela est possible. Ceci permet de prendre en
		  compte des probl\`{e}mes o\`{u} les expressions des d{\'e}pendances
		  ne sont pas affines. Ceci est r{\'e}alis{\'e} \`{a} l'aide de
		  transformations successives des contraintes
		  polyn{\^o}miales : {\em factoring} (ou mise en facteur d'une
		  variable symbolique) et {\em affinization} ou mise sous
		  forme affine de contraintes polin{\^o}miales particuli\`{e}res.
		  \references{11}}
}


@INPROCEEDINGS{Masl:95a,
	AUTHOR = {Maslov, Vadim},
	TITLE ={Enhancing Array Dataflow Dependence Analysis with On-Demand
		  Gloval Value Propagation},
	INDEX ={\indexbib{}},
	BOOKTITLE = ics,
	YEAR = 1995,
	MONTH = jul,
	PAGES = {265--269},
	SUMMARY = {Analyse de flot de donn{\'e}es scalaires et tableau. Ou
		  comment raffiner l'analyse \`{a} la Feautrier en propageant
		  les valeurs des variables scalaires enti\`{e}res et les
		  valeurs des {\'e}l{\'e}ments de tableaux. Utilise pour cela la
		  notion d'{\'e}tat-m{\'e}moire (tiens, tiens...) et les relations
		  fonctionnelles ({\em F-relation\/}), extension du concept
		  de relation de d{\'e}pendance (Pugh). Une F-relation est une
		  fonction de l'{\'e}tat-m{\'e}moire initial dans l'{\'e}tat-m{\'e}moire
		  final. Ainsi, on peut exprimer les valeurs en sortie de
		  fragment de programme en fonction des valeurs d'entr{\'e}e. 
		  M{\^e}me pour les tableaux.
		  
		  \references{13}}
}

@ARTICLE{Mast:95a,
	AUTHOR = {Masticola, Stephen and Marlowe, Thomas and Ryder, Barbara},
	TITLE = {Lattice Frameworks for Multisource and Bidirectional Data
		  Flow Problems},
	INDEX ={\indexbib{}},
	YEAR = 1995,
	MONTH = sep,
	JOURNAL = toplas,
	VOLUME = 17,
	NUMBER = 5,
	PAGES = {777--803},
	SUMMARY = {\references{24}}
}
		  
		  

@TECHREPORT{Mats:91a,
	AUTHOR = {Matsumoto, Y.
		and Taki, K.},
	TITLE ={Parallel Logic-Level Simulation System on a Distributed
		Memory Machine},
	INDEX ={\indexbib{temps virtuel}},
	YEAR = 1991,
	MONTH = feb,
	INSTITUTION = {ICOT},
	TYPE = {technical memorandom},
	NUMBER = {TM-1030},
}

@TECHREPORT{Mats:91b,
	AUTHOR = {Matsumoto, Y.
		and Taki, K.},
	TITLE ={Evaluation of Parallel Logic Simulation System using the {T}ime
		{W}arp Mechanism},
	INDEX ={\indexbib{temps virtuel}},
	YEAR = 1991,
	MONTH = may,
	INSTITUTION = {ICOT},
	TYPE = {technical report},
	NUMBER = {TR-646},
}


@PHDTHESIS{Maur:89,
	AUTHOR = {Mauras, Christophe},
	TITLE ={Alpha : un Langage {\'E}quationnel pour la Conception et la
		  Programmation d'architectures Parall\`{e}les Synchrones},
	INDEX ={\indexbib{langage!Alpha}},
	SCHOOL = {Universit{\'e} de Rennes I},
	YEAR = 1989,
	MONTH = {d{\'e}cembre},
	SUMMARY = {Chapitre 4 sur les domaines spatiaux int{\'e}ressant. \references{68}}
}


@PHDTHESIS{Mayd:92,
	AUTHOR = {Maydan, Dror Eliezer},
	TITLE ={Accurate Analysis of Array References},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es}
                \indexbib{analyse!interproc{\'e}durale}
                \indexbib{analyse!d{\'e}pendances}},
	SCHOOL = stanford,
	YEAR = 1992,
	MONTH = sep,
	SUMMARY = {\references{55}}
}


@TECHREPORT{Mayd:93a,
	AUTHOR = "  Maydan, Dror E. 
		and Amarasinghe, Saman P. 
		and Lam, Monica S.",
	TITLE ={Data Dependence and Data-Flow Analysis of Arrays},
	INDEX ={\indexbib{transformations de programme!privatisation de tableaux}
		\indexbib{analyse!flot de donn{\'e}es}},
	INSTITUTION = stanford,
	YEAR = 1993,
	SUMMARY = {Ce papier pr{\'e}sente plusieurs techniques utiles pour des
		   optimisations de haut niveau. Sont introduits les RT
		   (Reference Tree), et les LWT (Last Write Tree, cas
		   particulier de Feautrier). Enfin, la privatisation de
		   tableaux est un peu abord{\'e}e ; mais elle se cantonne aux
		   nids de boucles simples, sans if ni call. De plus, seuls
		   les tableaux entiers sont privatis{\'e}s. L'article des
		   m{\^e}mes auteurs (\cite{Mayd:93b}) est une reprise plus
		   d{\'e}taill{\'e}e de ce rapport.  \references{16}.}  
}


@INPROCEEDINGS{Mayd:93b,
	AUTHOR = "  Maydan, Dror E. 
		and Amarasinghe, Saman P. 
		and Lam, Monica S.",
	TITLE ={Array Data-Flow Analysis and its Use in Array 
		Privatization},
	INDEX ={\indexbib{transformations de programme!privatisation de tableaux}
		\indexbib{analyse!flot de donn{\'e}es}
                \indexbib{analyse!d{\'e}pendances}},
	BOOKTITLE = popl,
	YEAR = 1993,
	MONTH = jan,
	SUMMARY = {Idem~\cite{Mayd:93a} en un peu plus d{\'e}taill{\'e}. L'analyse
		  est intraproc{\'e}durale. Les auteurs utilisent les LWTs pour
		  privatiser les tableaux, \`{a} l'aide de la notion de vecteur
		  de d{\'e}pendance de flot de donn{\'e}es. \references{22}}
}

		  
		  
@INPROCEEDINGS{McKi:95a,
	AUTHOR = {McKinley, Kathrin and Singhai, Sharad and Weaver, Glen and
		  Weems, Charles},
	TITLE ={Compiler Architecture for Heterogeneous Systems},
	INDEX ={\indexbib{}},
	BOOKTITLE = lcpc,
	YEAR = 1995,
	MONTH = aug,
	PAGES = {29.1--29.15},
	SUMMARY = {\references{46}}
}


@BOOK{Metc:90,
	AUTHOR = {Metcalf, Michael and Reid, John},
	TITLE = {Fortran 90 Explained},
	INDEX ={\indexbib{langage!Fortran}},
	YEAR = 1990,
	PUBLISHER = {Oxford University Press},
	
}


@INPROCEEDINGS{Midk:92a,
	AUTHOR = {Midkiff, S. and Nicolau, A. and Padua, D.},
	TITLE ={Research Directions in Compiling for Massive Parallelism},
	INDEX ={\indexbib{}},
	BOOKTITLE = {The New Frontiers: A Workshop on Future Directions of
		  Massively Parallel Processing},
	YEAR = 1992,
	MONTH = oct,
	PAGES = {2--10},
	SUMMARY = {Consid\`{e}re les probl\`{e}mes qui se posent en 1992 pour la
		  recherche dans le domaine de la compilation pour machines
		  parall\`{e}les. Probl\`{e}mes de langage (parall{\'e}lisation
		  automatique vs language explicitement parall\`{e}le,
		  compilateurs interactifs,), probl\`{e}mes d'architectures,
		  probl\`{e}mes de compilation dont l'analyse de flot des
		  tableaux.  \references{26}}
}
		 
@INPROCEEDINGS{Midk:93,
	AUTHOR = {S. Midkiff and E. Schonberg and M. Gupta and P. Sweeney
		  and K.Y. Wang and M. Burke},
	TITLE ={{PTran II}~---~a Compiler for {H}igh {P}erformance {F}ortran},
	INDEX ={\indexbib{langage!HPF}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "479--493",
	SUMMARY = {IBM. \references{21}}
}


		  
	  

@INPROCEEDINGS{Mirc:94,
	AUTHOR = {Mirchandaney, Ravi and Hiranandani, Seema and Sethi, Ajay},
	TITLE ={Improving the Performance of {DSM} Systems via Compiler Involvement},
	INDEX ={\indexbib{utilisation des r{\'e}gions}},
	BOOKTITLE = ics,
	YEAR = 1994,
	MONTH = nov,
	PAGES = {763--772},
	SUMMARY = {DSM = Distributed Shared Memory. En gros, comment
		  utiliser un systeme qui simule une m{\'e}moire partag{\'e}e sur
		  une m{\'e}moire physiquement distribu{\'e}e. Et ce \`{a} l'aide
		  d'un compilateur. Cela revient \`{a} ajouter des points de
		  synchronisation, et des communications pour rapatrier les
		  donn{\'e}es qui ne sont pas \`{a} jour dnas la m{\'e}moire
		  locale. Pour cela, il faut conna{\^\i}tre quelles seront les
		  sections de tableaux qui seront utilis{\'e}es dans la portion
		  de code consid{\'e}r{\'e}e. D'o\`{u} une utilisation potentielle
		  des r{\'e}gions exactes. \references{30}}
}

@INCOLLECTION{Moss:90a,
	AUTHOR = {Mosses, Peter},
	EDITOR = {van Leeuwen, Jan},
	TITLE = {Denotational Semantics},
        BOOKTITLE = {Theoretical Computer Science},
	INDEX ={\indexbib{}},
	YEAR = 1990,
	PUBLISHER = esp,
	CHAPTER = 11,
	VOLUME = {B},
	SUMMARY = {\references{}}
}


@INPROCEEDINGS{Mowr:92a,
	AUTHOR = {Mowry, Todd and Lam ,Monica and Gupta, Anoop},
	TITLE ={Design and Evaluation of a Compiler Algortihm for Prefetching},
	INDEX ={\indexbib{}},
	BOOKTITLE = asplos,
	YEAR = 1992,
	MONTH = oct,
	PAGES = {62--73},
	SUMMARY = {\references{29}}
}


@INPROCEEDINGS{Muel:95a,
	AUTHOR = {Mueller, Frank},
	TITLE ={Compiler Support for Software-Based Cache Partitionning},
	INDEX ={\indexbib{archtecture!caches}},
	BOOKTITLE = lctrts,
	YEAR = 1995,
	MONTH = jun,
	SUMMARY = {real-time systems - cahce partitioning - pas d'int{\'e}r{\^e}t
		  pour moi -\references{10}} 
}
		  

@INPROCEEDINGS{Mull:93,
	AUTHOR = {L.M.R Mullin and S.A. Thibault and D.R. Dooling and E.A. Sandberg},
	TITLE ={Formal Method for Scheduling, Routing and Communication Protocol},
	INDEX ={\indexbib{}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "47--55",
	SUMMARY = {\references{11}}
}

@ARTICLE{Munt:91,
	AUTHOR = {Muntean, Traian and Talbi, El-Ghazali},
	TITLE = {M{\'e}thodes de Placement Statique des Processus sur
		  Architectures Parall\`{e}les},
	INDEX ={\indexbib{placement de processus!statique}},
	YEAR = 1991,
	JOURNAL = tsi,
	VOLUME = 10,
	NUMBER = 5,
	PAGES = {355--373},
	SUMMARY = {Synth\`{e}se bibliographique sur le sujet du titre. \references{144}}
}


@INPROCEEDINGS{Myer:81,
	AUTHOR = {Myers, E.},
	TITLE ={A Precise Inter-procedural Data-Flow Algorithm},
	INDEX ={\indexbib{analyse!interproc{\'e}durale}
                \indexbib{analyse!flot de donn{\'e}es}},
	BOOKTITLE = popl,
	YEAR = 1981,
	MONTH = jan,
	SUMMARY = {Analyse de flot de donn{\'e}es interproc{\'e}durale et
		  it{\'e}rative en pr{\'e}sence d'aliasing. D{\'e}finition des
		  probl\`{e}mes may et must. \references{18}}
}


%
% -N-
%



@INPROCEEDINGS{Nguy:95a,
	AUTHOR = {Nguyen,Trung and Gu, Jungie and Li, Zhiyuan},
	TITLE ={An Interprocedural Parallelizing Compiler and Its Support
		  for Memory Hierarchy Research},
	INDEX ={\indexbib{}},
	BOOKTITLE = lcpc,
	YEAR = 1995,
	MONTH = aug,
	PAGES = {7.1--7.15},
	SUMMARY = {
		  
		  This article is  an overview of several analyses performed
 		  by the  Panorama  compiler developed at the  university of
 		  Minnesota. The first   technique  is an array  data   flow
 		  analysis  (GARs), based on the interprocedural hierachical
 		  control flow graph    of the program.  The second,  called
 		  'static task   profil{\'e},  helps in  deciding  whether  the
 		  parallel    loops    must be   scheduled   statically   or
 		  dynamically. The  third one, handles  task assignment  and
 		  data allocation   at   the    same  time,  by   using    a
 		  heuristic.  

		  The main part is dedicated to GARs, but it only consists
 		  of RSDs with bounds and strides, with a guard, approach
 		  already used by other authors.

		  More interesting is the static task profile, because it is
 		  used to estimate the benefit of a static schedule vs a
 		  dynamic schedule; I cannot remember of another similar
 		  method.
		  
		  The compiler seems very fast (at least as fast as f77 -O).
		  
		  \references{31}}
}
		  
		  
@ARTICLE{Ni:85,
	AUTHOR = {Ni, L.M. and Xu, C.-W. and Gendreau, T.B.},
	TITLE = {A Distributed Drafting Algorithm for Load Balancing},
	INDEX ={\indexbib{placement de processus!dynamique}},
	YEAR = 1985,
	MONTH = oct,
	JOURNAL = ieeetose,
	VOLUME = {SE--11},
	NUMBER = 10,
	PAGES = {1153--1161},
}

@INPROCEEDINGS{Ning:93,
	AUTHOR = {Qi. Ning and V. van Dongen and G.R. Gao},
	TITLE ={Advanced Techniques for Compiling Loops onto Distributed
		  Memory Machines},
	INDEX ={\indexbib{parall{\'e}lisation!automatique}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "398--398",
	NOTE = {abstract},
}

%
% -O-
%

%
% -P-
%

@ARTICLE{Padu:86,
	AUTHOR = {Padua, David and Wolfe, Michael},
	TITLE = {Advanced Compiler Optimizations for Supercomputers},
	INDEX ={\indexbib{optimisation de programme}},
	YEAR = 1986,
	MONTH = dec,
	JOURNAL = cacm,
	VOLUME = 29,
	NUMBER = 12,
	PAGES = {1184--1201},
	
}


@INPROCEEDINGS{Padu:93,
	AUTHOR = {D.A. Padua and K.A. Faigin and J.P. Hoeflinger and P.M. Petersen 
		and S.A. Weatherford},
	TITLE ={The {P}olaris Internal Representation},
	INDEX ={\indexbib{repr{\'e}sentation interm{\'e}diaire}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "287--318",
	SUMMARY = {PIPS, 5 ans plus tard \dots. \references{7}}
}

@INPROCEEDINGS{Pale:95,
	AUTHOR = {Paleczny, Michael and Kennedy, Ken and Koelbel, Charles},
	TITLE ={Compiler Support for Out-of-Core Arrays on Parallel Machines},
	INDEX ={\indexbib{}},
	BOOKTITLE = {Frontiers'95},
	YEAR = 1995,
	MONTH = feb,
	PAGES = {110--118},
	SUMMARY = {Comment traiter une application dans laquelle la taille
		  des tableaux est sup{\'e}rieure \`{a} celle de la m{\'e}moire ? La
		  solution propos{\'e}e consiste \`{a} ajouter des directives
		  sp{\'e}ciales {\em \`{a} la Fortran D\/} pour que le programmeur
		  puisse d{\'e}clarer les tableaux ne tenant pas en m{\'e}moire,
		  et indiquer la taille et la disposition des tuiles
		  {\'e}l{\'e}mentaires qu'il faudra manipuler, qui elles tiennent
		  en m{\'e}moire. Le mod\`{e}le de compilation associe \`{a} chaque
		  processeur un fichier d'E/S dans lequel seront stock{\'e}es
		  les tuiles r{\'e}sidantes non utilis{\'e}es. Il faut alors
		  g{\'e}n{\'e}rer le code qui manipulera les tuiles, ainsi que les
		  instructions d'E/S lorsque l'on acc\`{e}de \`{a} une tuile
		  r{\'e}sidante, ou les messages lorsque l'on r{\'e}f{\'e}rence une
		  tuile distante. L'article donne juste le principe, et dit
		  que c'est fait comme pour les directives classiques de
		  Fortran D. Tout repose sur l'analyse \`{a} l'aide des
		  RSDs. Les auteurs se demandent tout de m{\^e}me si c'est une
		  repr{\'e}sentation suffisamment pr{\'e}cise. \references{14}}
}

		  
@ARTICLE{Pas:94a,
	AUTHOR = {Pase, Douglas and MacDonald, Tom and Meltzer, Andrew},
	TITLE = {The {CRAFT} {F}ortran Programming Model},
	INDEX ={\indexbib{langage!Fortran}},
	YEAR = 1994,
	JOURNAL = {Scientific Programming},
	VOLUME = 3,
	PAGES = {227--253},
	SUMMARY = {\references{12}}
}
		  

@TECHREPORT{Perf:89,
	AUTHOR = {Berry, M. and Chen, D. and Koss, P. and Kuck, D. and Lo,
		  V. and Pang, Y. and Roloff, R. and Sameh, A. and Clementi,
		  E. and Chin, S. and Schneider, D. and Fox, G. and Messina,
		  P. and Walker, D. and Hsiung, C. and Schwarzmeier, J. and
		  Lue, K. and Orzag, S. and Seidl, F. and Johnson, O. and
		  Swanson, G. and Goodrum, R. and Martin, J.},
	TITLE ={The {PERFECT} {C}lub Benchmarks : Effective Performance
		  Evaluation of Supercomputers},
	INDEX ={\indexbib{}},
	YEAR = 1989,
	MONTH = may,
	INSTITUTION = csrd,
	TYPE = {Technical Report},
	NUMBER = {CSRD-827}
}

@TECHREPORT{Perf:89b,
	AUTHOR = {Berry, M. and others},
	TITLE ={The {PERFECT} {C}lub Benchmarks: Effective Performance
		  Evaluation of Supercomputers},
	INDEX ={\indexbib{}},
	YEAR = 1989,
	MONTH = may,
	INSTITUTION = csrd,
	TYPE = {Technical Report},
	NUMBER = {CSRD-827}
}


@TECHREPORT{Perr:94,
	AUTHOR = {Perrot, R.H. and Zarea-Aliabadi, Adib},
	TITLE ={Parallel Computational Models and High Level Programming
		  Abstractions },
	INDEX ={\indexbib{langage!langages \`{a} objets}},
	YEAR = 1994,
	INSTITUTION = {APPARC},
	TYPE = {Deliverable},
	NUMBER = {HLL4},
	SUMMARY = {\references{17}}
}


@PHDTHESIS{Pete:93,
	AUTHOR = {Petersen, Paul Marx},
	TITLE ={Evaluation of Programs and Parallelizing Compilers using
		  Dynamic Analysis Techniques},
	INDEX ={\indexbib{parall{\'e}lisation!automatique}},
	SCHOOL = csrd,
	YEAR = 1993,
	MONTH = jan,
	NOTE = {CSRD report No. 1273},
	SUMMARY = {Voir le titre ! Le cadre est constitu{\'e} par le `{\em
		  Delta Program Manipulation System}, i.e. PIPS 5 ans plus
		  tard. {\'E}value le gain de performance donn{\'e} par KAP \`{a}
		  l'aide de m{\'e}thodes dynamiques. \references{47}}
}



@ARTICLE{Phil:93,
	AUTHOR = {Philippsen, Michael 
		and Heinz, Ernst A. 
		and Lukowicz, Paul},
	TITLE ={Compiling Machine-Independent Parallel Programs},
	INDEX ={\indexbib{}},
	MONTH = aug,
	YEAR = 1993,
	JOURNAL = sigplan,
	VOLUME = 28,
	NUMBER = 8,
	SUMMARY = {\references{22}}
}


@PHDTHESIS{Piep:93,
	AUTHOR	= {Pieper, Karen L.},
	TITLE	= "Parallelizing Compilers: Implementation and Effectiveness",
	SCHOOL	= "Stanford University, Computer Systems Laboratory",
	INDEX   = {\indexbib{parall{\'e}lisation!automatique}},
	MONTH	= jun,
	YEAR	= 1993,
	SUMMARY = {available by anonynous ftp at hawk.stanford.edu, pub/papers/.
		\references{}}
}



@TECHREPORT{Plat:90,
	AUTHOR = {Platonoff, Alexis},
	TITLE ={Calcul des effets des proc{\'e}dures au moyen des r{\'e}gions},
	INDEX ={\indexbib{analyse!d{\'e}pendances}
		\indexbib{analyse!sections de tableaux}},
	YEAR = 1990,
	MONTH = {Septembre},
	INSTITUTION = cri-ensmp,
	TYPE = {Rapport de Stage},
	NUMBER = {EMP-CAI-I 132},
}


@INPROCEEDINGS{Poly:93,
	AUTHOR = {C.D. Polychronopoulos},
	TITLE ={{NANO--T}hreads : Compiler-driven multithreading},
	INDEX ={\indexbib{}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "189--205",
	SUMMARY = {\references{20}}
}



@TECHREPORT{Port:89a,
	AUTHOR = {Portfield, Allan},
	TITLE ={Software Methods for Improvement of Cache Performance on
		  Supercomputer Applications},
	INDEX ={\indexbib{}},
	YEAR = 1989,
	MONTH = may,
	INSTITUTION = rice,
	TYPE = {Technical Report},
	NUMBER = {COMP TR89-93},
	SUMMARY = {\references{51}}
}
		  
		  
@ARTICLE{Psar:93,
	AUTHOR = {Psarris, Kleanthis and Kong, Xiangyun and Klappholz, David},
	TITLE = {The Direction Vector {I} Test},
	INDEX ={\indexbib{analyse!d{\'e}pendances}},
	YEAR = 1993,
	MONTH = nov,
	JOURNAL = ieeetpds,
	VOLUME = 4,
	NUMBER = 11,
	PAGES = {1280--1290},
	SUMMARY = {Extension du I test par ajout de contraintes mod{\'e}lisant
		  les directions de d{\'e}pendances. Il s'agit d'une extension
		  des tests du GCD et de Banerjee, bas{\'e}e sur un nouveau
		  concept, les {\em {\'e}quations-intervalles}. La r{\'e}solution
		  consiste \`{a} {\'e}liminer successivement les variables du
		  syst\`{e}me initial par des r\`{e}gles sp{\'e}cifiques au type
		  d'{\'e}quations introduit. Le syst\`{e}me initial est
		  l'{\'e}quation de d{\'e}pendance de deux indices de
		  tableau. C'est donc moins pr{\'e}cis que F-M., car les
		  poly\`{e}dres peremttent de prendre en compte tous les
		  indices \`{a} la fois.  \references{15}}
}


@ARTICLE{Pugh:92,
	AUTHOR = {Pugh, William},
	TITLE = {A practical Algorithm for Exact Array Dependence Analysis},
	INDEX ={\indexbib{analyse!d{\'e}pendances}
		\indexbib{analyse!d{\'e}pendances}},
	YEAR = 1992,
	MONTH = aug,
	JOURNAL = cacm,
	VOLUME = 35,
	NUMBER = 8,
	PAGES = "102--114",
	NOTE = {},
	SUMMARY = {Omega test: Test de d{\'e}ependence. En fait projeciton
		  presque comme dans PIPS. D'abord, normalization ( =
		  division par le pgcd) ; puis traitement des {\'e}galit{\'e}s ;
		  l\`{a} c'est un peu diff{\'e}rent quand le coefficient n'est pas
		  {\'e}gal \`{a} +/- 1 ; il introduit une variable
		  suppl{\'e}mentaire ; l'avantage, c'est que cela peut faire
		  appara{\^\i}tre un coefficient unitaire qqpart, et on en
		  tiendra compte ; l'inconv{\'e}nient est que cela fait plus de
		  projections ; ensuite, il s'occupe des in{\'e}galit{\'e}s. Il
		  regarde d'abord s'il y a des in{\'e}galit{\'e}s contradictoires,
		  ou trivialement redondantes (contraintes parall\`{e}les) ;
		  puis il applique F-M avec la notion de {\em dark shadow}
		  (Cf. papier). 

                  Applications : directions et vecteurs de d{\'e}pendance,
		  r{\'e}gions de tableaux, bornes de boucles...

                  \references{27}}
}



@INPROCEEDINGS{Pugh:92a,
	AUTHOR = {Pugh, William and Wonnacott, David},
	TITLE ={Eliminating False Data Dependences using the {O}mega Test},
	INDEX ={\indexbib{}},
	BOOKTITLE = pldi,
	YEAR = 1992,
	MONTH = jun,
	PAGES = {140--151},
	SUMMARY = {\references{20}}
}


@INPROCEEDINGS{Pugh:93,
	AUTHOR = {Pugh, William and Wonnacott, David},
	TITLE ={An Exact Method for Analysis of Value-Based Array
		  Data Dependences},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es}
                \indexbib{analyse!d{\'e}pendances}},
	BOOKTITLE = lcpc,
	YEAR = 1993,
	MONTH = aug,
	SUMMARY = {Comparaison des m{\'e}thodes de Pugh, de Feautrier
		  \cite{Feau:91}, de Maydan \cite{Mayd:93a} et de Maslov
		  \cite{Masl:94} pour le calcul des d{\'e}pendances {\em value-based}. 
                  Un petit mot sur le travail de Tu et Padua. \references{28}}
}




@INPROCEEDINGS{Pugh:94,
	AUTHOR = {Pugh, William},
	TITLE ={Counting Solutions to Presburger Formulas: How and Why},
	INDEX ={\indexbib{}},
	BOOKTITLE = pldi,
	YEAR = 1994,
	MONTH = jun,
	PAGES = {121--134},
	NOTE = {In} # sigplan,
	SUMMARY = {\references{17}}
}



@TECHREPORT{Pugh:94a,
	AUTHOR = {Pugh William and Wonnacot, David},
	TITLE ={Static Analysis of Upper and Lower Bounds on Dependences and
		  Parallelism},
	INDEX ={\indexbib{analyse!d{\'e}pendances}},
	YEAR = 1994,
	MONTH = mar,
	INSTITUTION = maryland,
	TYPE = {Technical Report},
	NUMBER = {CS-TR-3250},
	NOTE = {Will appear in ACM TOPLAS},
	SUMMARY = {\references{49}}
}


%
% -Q-
%


@UNPUBLISHED{Quin:94,
	AUTHOR = {Quinton, Patrice and Rajdopahdye, Sanjay and Wilde, Doran},
	TITLE ={Application of Static Analysis to the derivation of Imperative
		  Code from a Functional Program},
	INDEX ={\indexbib{langage!fonctionnel}},
	YEAR = 1994,
	MONTH = apr,
	NOTE = {submitted to SAS'94 -- DO NOT CITE},
	SUMMARY = {\references{42}}
}


%
% -R-
%

@INPROCEEDINGS{Raub:93,
	AUTHOR = {T. Rauber and A. Dierstein and R. Hayer},
	TITLE ={Automatic Data Distribution and Parallelization},
	INDEX ={\indexbib{distribution! de donn{\'e}es}
		\indexbib{parall{\'e}lisation!automatique}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "399--410",
	SUMMARY = {\references{23}}
}


@INPROCEEDINGS{Rauc:94,
	AUTHOR = {Rauchwerger, Lawrence and Padua, David},
	TITLE ={The Privatizing {DOALL} Test : a Run-Time Technique for {DOALL}
		  Loop Identification and Array Privatization},
	INDEX ={\indexbib{transformations de programme!privatisation de tableaux}},
	BOOKTITLE = ics,
	YEAR = 1994,
	SUMMARY = {Run-time parallelisation of loops. In facts, detects at
		  run-time if the loop is intrinsicly parallel, even if there
		  are subscripted subscripts. Run-time privatization of sections
		  of arrays. No copy-in and no copy-out. Examples from the
		  Perfect Club. \references{29}}
}


@INPROCEEDINGS{Rauc:95a,
	AUTHOR = {Rauchwerger, Lawrence and Padua, David},
	TITLE ={The {LRPD} Test : Speculative Run-Time Parallelization of
		  Loops wiht Privatization and Reduction Parallelization},
	INDEX ={\indexbib{}},
	BOOKTITLE = pldi,
        MONTH = jun,
	YEAR = 1995,
	SUMMARY = {\references{39}}
}


@ARTICLE{Rauc:95b,
	AUTHOR = {Rauchwerger, Lawrence and Amato, Nancy and Padua, David},
	TITLE = {A Scalable Method for Run-Time Loop Parallelization},
	INDEX ={\indexbib{}},
	YEAR = 1995,
	JOURNAL = ijpp,
	VOLUME = 23,
	NUMBER = 6,
	PAGES = {537--576},
	SUMMARY = {\references{44}}
}



@INPROCEEDINGS{Redo:94,
	AUTHOR = {Redon, Xavier},
	TITLE ={D{\'e}tection et Exploitation des R{\'e}currences dans les
		  Programmes Scientifiques},
	BOOKTITLE = renpar,
	YEAR = 1994,
	MONTH = {juin},
	PAGES = {81--86},
	SUMMARY = {\references{11}}
}


@ARTICLE{Reed:83,
	AUTHOR = {Reed, D.P.},
	TITLE = {Implementing Atomic Actions on Decentralized Data},
	INDEX ={\indexbib{}},
	YEAR = 1983,
	MONTH = feb,
	JOURNAL = tocs,
	VOLUME = 1,
	NUMBER = 1,
	PAGES = "3--23"
}


@TECHREPORT{Reif:82,
	AUTHOR = {Reif, John H. and Lewis, Harry R.},
	TITLE ={Efficient Symbolic Analysis of Programs},
	INDEX ={\indexbib{analyse!symbolique}
                \indexbib{analyse!s{\'e}mantique}},
	YEAR = 1982,
	MONTH = dec,
	INSTITUTION = {Center for Research in Computing Technology, Harvard
		  University, Cambridge, Massachussets},
	TYPE = {Technical Report},
	NUMBER = {TR-37-82},
	SUMMARY = {Defines a {\em cover} as being a mapping from text to
		  symbolic expressions whose values are equal to the value
		  of the text expressions for all executions of the program.
		  \references{39}}
}

		  

@INPROCEEDINGS{Reps:95a,
	AUTHOR = {Reps, Thomas and Horwitz, Susan and Sagiv, Mooly},
	TITLE ={Precise interprocedural Dataflow Analysis via Graph Reachability},
	INDEX ={\indexbib{analyse interproc{\'e}durale!framework}},
	BOOKTITLE = popl,
	YEAR = 1995,
	MONTH = jan,
	PAGES = {49-61},
	SUMMARY = {Framework pour l'analyse interproc{\'e}durale. Le graphe
		  utilis{\'e} est le {\em Supergraph}. Chaque proc{\'e}dure est
		  repr{\'e}sent{\'e}e par un sous-graphe, comportant un n{\oe}ud
		  d'entr{\'e}e et un n{\oe}ud de sortie. A cahque appel de
		  proc{\'e}dure, il y a un n{\oe}ud d'appel et un n{\oe}ud de
		  retour, connect{\'e}s \`{a} l'entr{\'e}e et \`{a} la sortie de la
		  proc{\'e}dure. Il y a {\'e}galement un arc du n{\oe}ud d'appel
		  vers le n{\oe}ud de retour pour la propagation locale. 
		  
		  L'originalit{\'e} vient du fait que lors de la propagation
		  interproc{\'e}durale, seuls les chemins dits {\em valides}
		  sont consid{\'e}r{\'e}s. Ce sont les chemins tels que le
		  n{\oe}ud de retour correspond au n{\oe}ud d'appel.
		  \references{32}}
}
		  

@ARTICLE{Rina:93,
	AUTHOR = "  Rinard, Martin C. 
		and Scales, Daniel J. 
		and Lam, Monica S.",
	TITLE ={Jade: A High-Level, Machine Independent Language for
		Parallel Programming},
	INDEX ={\indexbib{langage!Jade}},
	JOURNAL = comp,
	VOLUME = 26,
	NUMBER = 6,
	MONTH = jun,
	YEAR = 1993,
	NOTE = {},
	SUMMARY = { \begin{itemize} \item for loosely coupled
			multiprocessors and networks of machines; \item
			dependencies treated statically (help of the
			programmer) and dynamically; \item Jade appears as
			an extension of a serial language.  \end{itemize}
			\references{12} } }



@UNPUBLISHED{Rina:94,
	AUTHOR = {Rinard, Martin C and Diniz, Pedro},
	TITLE ={Commutativity Analysis : A New Technique for Automatically
		  Parallelizing Serial Programs},
	INDEX ={\indexbib{parall{\'e}lisation !automatique}},
	YEAR = 1994,
	NOTE = {Ne pas citer. Review{\'e} pour POPL'95 (avis: ne pas accepter)},
	
SUMMARY = {This paper deals with commutativity analysis, a technique for
           generating parallel programs that may violate the original data
           dependencies. The idea of recognizing commuting operation is not
           new, but the originality of the paper is that it provides a
           technique for automatically discovering commuting operations and
           generating parallel code. Unfortunately, the frame in which it
           aplies is rather restricted : pure object-oriented language, with
           methods built in a restrictive way (the receiver update itself in
           a first part, and the method calls itself recursively in a second
           part).

           The technique in itself is rather simple. A first part describes
           it informally ; this renders the paper accessible to a wide range
           of people. The second part is a very heavy technical description
           which leads to the parallelizing algorithm. We don't think it is
           false, but it brings nothing new, because it uses only standard
           techniques (even in the core of the formal description, ie. the
           symbolic analysis), applied to a very specific (and restrictive)
           source language.

           \references{16}}
}


@INPROCEEDINGS{Rina:95a,
	AUTHOR = {Rinard, Martin},
	TITLE ={Communication Optimizations for Parallel Computing Using
		  Data Access Information},
	INDEX ={\indexbib{}},
	BOOKTITLE = sc,
	YEAR = 1995,
	MONTH = dec,
	SUMMARY = {\references{23}}
}

@INPROCEEDINGS{Ritc:93a,
	AUTHOR = {Ritchie, Dennis},
	TITLE ={The Development of the C language},
	INDEX ={\indexbib{langage!C}},
	BOOKTITLE = {Second Conference on History of Programming Languages},
	YEAR = 1993,
	MONTH = apr,
	SUMMARY = {PLein de choses sur commetn le langage C est venu au
		  monde, les choix qu'il a faluu faire... tr\`{e}s instructif.
		  \references{36}}
}


@INPROCEEDINGS{Roge:93,
	AUTHOR = {A. Rogers and M.C. Carlisle and J.H. Reppy and L.J. Hendren},
	TITLE ={Supporting {SPMD} Execution for Dynamic Data Structures},
	INDEX ={\indexbib{}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "142--153",
	SUMMARY = {\references{32}}
}

@ARTICLE{Roge:94,
	AUTHOR = {Rogers, Anne and Pingali, Keshav},
	TITLE = {Compiling for Distributed Memory Architectures},
	INDEX ={\indexbib{compilation}},
	YEAR = 1994,
	MONTH = mar,
	JOURNAL = ieeetpds,
	VOLUME = 5,
	NUMBER = 3,
	PAGES = {281--298},
	SUMMARY = {Compilation de programmes dans lesquels le placement des
		  donn{\'e}es est sp{\'e}cifi{\'e}. La premi\`{e}re m{\'e}thode est une
		  r{\'e}solution \`{a} l'ex{\'e}cution ; puis une phase
		  d'{\'e}valutation partielle \`{a} la compilation pour
		  sp{\'e}cialiser le code sur chaque processeur. Puis les
		  communications sont optimis{\'e}es ( pipelining = envoi d'une
		  donn{\'e}e d\`{e}s qu'elle est disponible, vectorisation de
		  messages) \references{35}}
}


@ARTICLE{Ryde:86,
	AUTHOR = {Ryder, Barbara G. and Paull, Marvin C.},
	TITLE = {Elimination Algorithms for Data-Flow Analysis},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es}},
	YEAR = 1986,
	MONTH = sep,
	JOURNAL = acmcs,
	VOLUME = 18,
	NUMBER = 3,
	PAGES = {277--316},
	SUMMARY = {Synth\`{e}se des m{\'e}thodes de r{\'e}solution des probl\`{e}mes
		  d'analyse de flot de donn{\'e}es bas{\'e}s sur la m{\'e}thode
		  d'{\'e}limination de Gauss. Pr{\'e}sente les m{\'e}thodes d'Allen
		  \cite{Alle:70}, d'Hecht et Ullmann \cite{Ullm:73}, de Tarjan
		  \cite{Tarj:74} et de Graham et Wegman
		  \cite{Grah:76}. \references{44}} 
}
		  

@ARTICLE{Ryde:90,
	AUTHOR = {Ryder, Barbara and Landi, William and Pande, H.},
	TITLE = {Profiling an Incremental Data-Flow Analysis Algorithm},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es}},
	YEAR = 1990,
	MONTH = feb,
	JOURNAL = ieeetose,
	VOLUME = 16,
	NUMBER = 2,
	
}

@INPROCEEDINGS{Ryde:93,
	AUTHOR = {B.G. Ryder and M.E. Fiuczynski and Y-F. Lee},
	TITLE ={Region Analysis : a parallel elimination method for data flow analysis},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es} 
		\indexbib{compilation!parall\`{e}le}
		\indexbib{ma th\`{e}se}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "225--245",
	SUMMARY = {Parall{\'e}lisation d'un parall{\'e}liseur interproc{\'e}dural. 
                   \references{34}}
}


		  
		  
%
% -S-
%


@ARTICLE{Sakh:94,
	AUTHOR = {Sakharov, Alexander},
	TITLE = {Propagation of Constants and Assertions},
	INDEX ={\indexbib{optimisation de programme!propagation de constantes}},
	YEAR = 1994,
	MONTH = mar,
	JOURNAL = sigplan,
	VOLUME = 29,
	NUMBER = 3,
	PAGES = {28--32},
	SUMMARY = {Propagation d'{\'e}galit{\'e}s entre des variables et des
		  constantes, d'{\'e}galit{\'e}s venant des expressions
		  conditionnelles, et d'{\'e}galit{\'e}s provenant d'affectations.   
                  \references{10}} 
}

@INPROCEEDINGS{Sada:87,
	AUTHOR = {Sadayapan, P. and Ercal, F.},
	TITLE ={Cluster-Partitionning Approaches to Mapping Parallel Programs
		  onto an Hypercube},
	INDEX ={\indexbib{placement de processus!statique}},
	BOOKTITLE = ics,
	YEAR = 1987,
}


@UNPUBLISHED{Salo:94,
        AUTHOR = " Salomon, David J.",
        TITLE = {Making Evaluation Time an Explicit Attribute of Variables},
	INDEX = {\indexbib{compilation}
		 \indexbib{langage!C}
		 \indexbib{pr{\'e}processeur}},
        YEAR = 1994,
	NOTE = "Submitted to CC'94. Not accepted.",
	SUMMARY = {This paper presents new techniques to enhance the
		power of compilers, allowing them to evaluate part of
		the source code, under the control of the programmer.
		The notation proposed allows the latter to write generic
		procedures, increasing the expressiveness of the language.
		Reviewed October 26, 1993} 
}



@INPROCEEDINGS{Salt:93,
	AUTHOR = {J. Saltz and G. Agrawal and A. Sussmann},
	TITLE ={Compiler and Run-time Support for Structured and Block 
		Structured Grid Applications},
	INDEX ={\indexbib{parall{\'e}lisation!automatique}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "436--447",
	SUMMARY = {\references{21}}
}



@TECHREPORT{Sark:90,
	AUTHOR = {Sarkar, Vivek},
	TITLE ={{PTRAN} --- the {IBM} Parallel Translation System},
	INDEX ={\indexbib{parall{\'e}lisation!automatique}},
	YEAR = 1990,
	MONTH = jun,
	INSTITUTION = {IBM, Research Division},
	TYPE = {Research report},
	NUMBER = {RC 16194},
	NOTE = {},
	SUMMARY = {Description de PTRAN. Essentiellement sur l'analyse de
		  d{\'e}pendances. Les effets sur les variables des commons ne
		  sont aps analys{\'e}s variable par variable, masi par partie
		  de common, ce qui rend l'analyse interproc{\'e}durale plus
		  facile en cas de reformatage du common, mais n'irait pas
		  du tout avec des poly\`{e}dres convexes. \references{104}}
}



@INCOLLECTION{Sark:91,
	AUTHOR = {Sarkar, Vivek},
	TITLE ={{PTRAN} --- the {IBM} Parallel Translation System},
	INDEX ={\indexbib{parall{\'e}lisation!automatique}},
	BOOKTITLE = {Parallel Functional Programming Languages and Compilers},
	PUBLISHER = acmpfs,
	YEAR = 1991,
	PAGES = {309--391},
	
}



@INPROCEEDINGS{Sark:91b,
	AUTHOR = {Sarkar, Vivek and Gao, Guang},
	TITLE ={Optimization of Array Accesses by Collective Loop Transformations},
	INDEX ={\indexbib{}},
	BOOKTITLE = ics,
	YEAR = 1991,
	MONTH = jun,
	PAGES = {194--205},
	SUMMARY = {\references{27}}
}


@INPROCEEDINGS{Sark:94,
	AUTHOR = {Sarkar, Vivek and Vasquez, Lelia},
	TITLE ={Automatic Localization for Distributed-Memory
		  Multiprocessors Using a Shared-Memory Compilation Framework},
	INDEX ={\indexbib{}},
	BOOKTITLE = icss,
	YEAR = 1994,
	PAGES = {4--13},
	SUMMARY = {Au lieu de distribuer les donn{\'e}es, puis les calculs en
		  focntion de la distribution des donn{\'e}es, ils partent de
		  boucles DOALL, et partant d'un mapping intitial,
		  distribuent calculs et donn{\'e}es de facon \`{a} minimiser les
		  communications (dynamiquement). Extension aux s{\'e}quences
		  de DOALL. Mais pas de DOALL imbriqu{\'e}s. \references{33}}
}



@INPROCEEDINGS{Sark:95a,
	AUTHOR = {Sarkar, Vivek},
	TITLE ={Convergence in Compiling for Shared-Memory and Distributed
		  Memory Multiprocessors},
	INDEX ={\indexbib{}},
	BOOKTITLE = malaga95,
	YEAR = 1995,
	MONTH = jun,
	NOTE = {},
	
}



@INPROCEEDINGS{Sass:94,
	AUTHOR = {Sass, Ron and Mutka, Matt},
	TITLE ={Enabling Unimodular Transformations},
	INDEX ={\indexbib{}},
	BOOKTITLE = ics,
	YEAR = 1994,
	MONTH = nov,
	PAGES = {753--762},
	SUMMARY = {Bof! Transformations de programme pour transformer les
		  nids de boucle non parfaits en nids de boucle
		  parfaits. Pour cela, deux transformations sont
		  utilis{\'e}es : {\em loop distribution} et {\em scalar
		  forward substitution}. En fait cette derni\`{e}re ne marche
		  que dans les cas o\`{u} la privatisation de scalaires marche
		  aussi, de mani\`{e}re plus optimlae je pense, puisque l'on
		  {\'e}vite les calculs inutiles, et dans un plus grand nombre
		  de cas. \references{23}}
}


@ARTICLE{Schn:82,
	AUTHOR = {Schneider, F.B.},
	TITLE = {Synchronization in Distributed Programs},
	INDEX ={\indexbib{}},
	YEAR = 1982,
	MONTH = apr,
	JOURNAL = toplas,
	VOLUME = 4,
	NUMBER = 2,
	PAGES = "179--195"
}

@BOOK{Schr:86,
	AUTHOR = {Schrijver, Alexander},
	TITLE = {Theory of Linear and Integer Programming},
	INDEX ={\indexbib{poly\`{e}dres}},
	YEAR = 1986,
	PUBLISHER = wiley,
	SERIES = {Interscience Series in Discrete Mathematics and Optimization},
}


@INPROCEEDINGS{Schu:93,
	AUTHOR = {V. Schuster and Z. Bozkus and S. Nakamoto and L. Meadows},
	TITLE ={Retargetable {HPF} compiler Interface},
	INDEX ={\indexbib{langage!HPF}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "494--502",
	SUMMARY = {The Portlang Group Incorporated. \references{12}}
}


@UNPUBLISHED{Shar:94,
	AUTHOR = {Sharp, Oliver and Graham, Susan L.},
	TITLE ={Symbolic Data Descriptors},
	INDEX ={\indexbib{analyse!symbolique}},
	YEAR = 1994,
	NOTE = {Submitted to PLDI'94, but not accepted. do not cite},
	SUMMARY = {SDDs : sorts of regions in which they have added
		  conditionals for each dimensions. The dimensions can be
		  coupled, but it is not clear whether several dimensions
		  can be coupled in different ways ($*1 = *2 \; and \; *3 =
		  *4$). The operators are not defined. I wonder how they
		  manage union.

                 \references{15}}
}


@INCOLLECTION{Shar:81,
	AUTHOR = {Sharir, M. and Pnueli, A.},
	TITLE ={Two Approaches to Interprocedural Data Flow Analysis},
	INDEX ={\indexbib{}},
	BOOKTITLE = {Program Flow Analysis : Theory and Applications},
	PUBLISHER = phi,
	YEAR = 1981,
	
}

@ARTICLE{Shel:94,
	AUTHOR = {Shelekhov, Vladimir and Kuksenko, Serguey},
	TITLE = {Object Analysis of Program},
	INDEX ={\indexbib{}},
	YEAR = 1994,
	MONTH = sep,
	JOURNAL = sigplan,
	VOLUME = 29,
	NUMBER = 9,
	PAGES = {125--134},
	SUMMARY = {Initial stage of language-oriented dataflow analysis. \references{23}}
}


@ARTICLE{Shen:85,
	AUTHOR = {Shen, Chien-Chung and Tsai, Wen-Hsiang},
	TITLE = {A Graph Matching Approach to Optimal Task Assigment in
		  Distributed Computing Systems Using a Minimax Criterion},
	INDEX ={\indexbib{placement de processus!statique}},
	YEAR = 1985,
	MONTH = mar,
	JOURNAL = ieeetoc,
	VOLUME = {C--34},
	NUMBER = 3,
	PAGES = {197--203},
	SUMMARY = {\references{18}}
}



@TECHREPORT{Simm:93,
	AUTHOR = {Simmons, Harold},
	TITLE ={How to Eliminate Predicate Variables},
	INDEX ={\indexbib{}},
	YEAR = 1993,
	MONTH = jan,
	INSTITUTION = {Department of Computer Science, University of Manchester},
	TYPE = {Technical report},
	NUMBER = {UMCS-93-1-2},
	SUMMARY = {\references{10}}
}


@INPROCEEDINGS{Slom:93a,
	AUTHOR = {B. Sloman and T. Lake},
	TITLE ={Scalar Renaming, Rescoping and Optimizing Liveness Analysis
		in the Presence of Pointer Induced Aliasing and Side-effecting 
		Expressions},
	INDEX ={\indexbib{transformations de programme}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "372--382",
	SUMMARY = {\references{9}}
}
@INPROCEEDINGS{Slom:93b,
	AUTHOR = {B. Sloman and T. Lake},
	TITLE ={Representing Parallel Programs},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "505--511",
	NOTE = {not presented},
	SUMMARY = {\references{3}}
}


@PHDTHESIS{Stec:94,
	AUTHOR = {Steckler, Paul A.},
	TITLE ={Correct Higher-Order Program Transformations},
	INDEX ={\indexbib{optimisation de programme}},
	SCHOOL = {Northeastern University},
	YEAR = 1994,
	MONTH = jul,
	SUMMARY = {\references{61}}
}


@TECHREPORT{Stee:85,
	AUTHOR = {Steele, C.S.},
	TITLE ={Placement of Communicating Processes on Multiprocessor Networks},
	INDEX ={\indexbib{placement de processus!statique}},
	YEAR = 1985,
	MONTH = apr,
	INSTITUTION = {California Institute of Technologie},
	TYPE = {Technical report},
	NUMBER = {5284:TR:85},
}



@TECHREPORT{Stee:94,
	AUTHOR = {van der Steen, Aad J.},
	TITLE ={Overview of Recent Supercomputers},
	INDEX ={\indexbib{architecture}},
	YEAR = 1994,
	MONTH = sep,
	INSTITUTION = {NCF},
	TYPE = {Publication},
	NUMBER = 350,
	SUMMARY = {\references{24}}
}


@ARTICLE{Stei:93,
	AUTHOR = {Stein, Josef and Fox, Geoffrey C.},
	TITLE = {Dependence Analysis for Outer Loop Parallelization of Existing
		{F}ortran-77 Programs},
	INDEX ={\indexbib{parall{\'e}liseur}},
	YEAR = 1993,
	MONTH = dec,
	JOURNAL = cpe,
	VOLUME = 5,
	NUMBER = 8,
	PAGES = {659--674},
	NOTE = {available by anonymous ftp at minerva.npac.syr.edu},
	SUMMARY = {{\'E}valuation qualitative de divers parall{\'e}liseurs sur
		divers programmes.  Exemples de test int{\'e}ressants,
		notamment pour la privatisation. Conclue entre autres que
		l'aide de l'utilisateur doit se faire sous forme
		d'assertions ajout{\'e}es au code comme dans
		Partita. \references{17}} }


@ARTICLE{Stic:94,
	AUTHOR = {Stichnoth, James M.and O'Hallaron, David and Gross,
		  Thomas R.},
	TITLE = {Generating Communication for Array Statements: Design,
		  Implementation and Evaluation},
	INDEX ={\indexbib{}},
	YEAR = 1994,
	MONTH = apr,
	JOURNAL = jpdc,
	VOLUME = 21,
	NUMBER = 1,
	PAGES = {150--159},
	SUMMARY = {Comment compiler une instruction de la forme $A(f1:l1:s1)
		  = g(B(f2:l2:s2))$. I.e. Comment g{\'e}n{\'e}rer les
		  communications.  \references{15}}
}


@INPROCEEDINGS{Stol:94,
	AUTHOR = {Stoltz, Eric and Gelerk, Michael and Wolfe, Michael},
	TITLE ={Extended {SSA} with Factored Use-DEf Chains to Support
		  Optimization and Parallelism},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es}},
	BOOKTITLE = icss,
	YEAR = 1994,
	PAGES = {43--52},
	SUMMARY = {Pour {\'e}viter d'ajouter des noms \`{a} la table des symboles,
		  la mise sous forme SSA des programmes est en fait
		  g{\'e}n{\'e}relament la recherche de toutes les utilisations
		  possibles d'une valeur (def-use chains {\em directes}). Ce
		  papier propose d'utiliser les use-def chains pour
		  acc{\'e}l{\'e}rer leur calcul, et pour faciliter les op{\'e}rations
		  ult{\'e}rieures. \references{28}}
}


@INPROCEEDINGS{Stol:94a,
	AUTHOR = {Stolz, Eric and Wolfe, Michael},
	TITLE ={Detecting Values-based Scalar Dependence},
	INDEX ={\indexbib{}},
	BOOKTITLE = lcpc,
	YEAR = 1994,
	MONTH = aug,
	PAGES = {13.1--13.16},
	SUMMARY = {\references{20}}
}


@ARTICLE{Ston:77a,
	AUTHOR = {Stone, H.S.},
	TITLE = {Multiprocessor Scheduling with the Aid of Network Flow Algorithm},
	INDEX ={\indexbib{placement de processus!statique}},
	YEAR = 1977,
	MONTH = jan,
	JOURNAL = ieeetose,
	VOLUME = {SE--3},
	NUMBER = 2,
	PAGES = {85--93},
}

@ARTICLE{Ston:78,
	AUTHOR = {Stone, H.S. and Bokhari,S.H.},
	TITLE = {Control of Distributed Processes},
	INDEX ={\indexbib{placement de processus!statique}},
	YEAR = 1978,
	JOURNAL = comp,
	VOLUME = 11,
	NUMBER = 7,
	PAGES = {97--106},
}


@TECHREPORT{Ston:77b,
	AUTHOR = {Stone, H.S.},
	TITLE ={Program Assignment in Three Processor System and Tricutset
		  Partitionning of Graphs},
	INDEX ={\indexbib{placement de processus!statique}},
	YEAR = 1977,
	INSTITUTION = {Dept. of Electronic and Computer Engineering, University
		  of Massachussets},
	TYPE = {Technical Report},
	NUMBER = {ECE--CS--77--7},
}



@INPROCEEDINGS{Su:93,
	AUTHOR = {Su, Ernesto and Palermo, Daniel and Banerjee, Prithviraj},
	TITLE ={Automatic Parallelization of Regular Computations for
		  Distributed-Memory Multicomputers in the {P}aradigm Compiler},
	INDEX ={\indexbib{parall{\'e}lisation!automatique}
                \indexbib{distribution! de donn{\'e}es}
                \indexbib{placement!statique}},
	BOOKTITLE = icpp,
	YEAR = 1993,
	MONTH = aug,
	PAGES = {II-30--II-38},
	SUMMARY = {Une partie sur l'analyse du flot des {\'e}l{\'e}ments de tableaux :
		  calcul des {\em symbolic sets}. Un tel ensemble est
		  repr{\'e}sent{\'e} par deux bornes affines symboliques, un pas et un
		  cycle. Les bornes de boucles doivent {\^e}tre connues \`{a} la
		  compilation. \references{20}} 
}


@INPROCEEDINGS{Su:95a,
	AUTHOR = {Su, Ernesto and Lain, Antonio and Ramaswamy, Shankar and
		  Palermo, Daniel and Hodges IV, Eugene and Banerjee,
		  Prithviraj},
	TITLE ={Advanced Compilation Techniques in the {PARADIGM} Compiler
		  for Distributed-Memory Multicomputers},
	INDEX ={\indexbib{distribution!donn{\'e}es}},
	BOOKTITLE = ics,
	YEAR = 1995,
	MONTH = jul,
	PAGES = {424--433},
	SUMMARY = {Pr{\'e}sentation g{\'e}n{\'e}rale de PARADIGME. L'accent est mis
		  sur les distributions block-cyclic. \references{23}}
}


@INPROCEEDINGS{Suzu:77,
	AUTHOR = {Suzuki, N. and Ishihata, K.},
	TITLE ={Implementation of Array Biund Checker},
	INDEX ={\indexbib{optimisation de programme}},
	BOOKTITLE = popl,
	YEAR = 1977,
	PAGES = {132--143},
}



%
% -T-
%


@INPROCEEDINGS{Talb:91,
	AUTHOR = {Talbi, E.-G. and Bessi\`{e}re, P.},
	TITLE ={A parallel Genetic Algorithm for the Graph Partitionning Problem},
	INDEX ={\indexbib{algorithmes g{\'e}n{\'e}tiques}},
	BOOKTITLE = ics,
	YEAR = 1991,
	MONTH = jun,
}



@UNPUBLISHED{Talb:93,
	AUTHOR = {Talbi, El-Ghazali and Muntean, Traian},
	TITLE ={Allocation Dynamique de Processus dans les Syst\`{e}mes Distribu{\'e}s
		  et Parall\`{e}les : {\'E}tat de l'Art},
	INDEX ={\indexbib{placement de processus!dynamique}},
	YEAR = 1993,
	NOTE = {Communication personnelle. Soumis \`{a} TSI},
	SUMMARY = {Classification bas{\'e}e sur sur les strat{\'e}gies utilis{\'e}es dans
		  le maintien de de l'{\'e}tat courant du syst\`{e}me et dans le
		  placement des processus. \references{116}}
}

@ARTICLE{Talb:94,
	AUTHOR = {Talbi, El-Ghazali},
	TITLE = {Configuration Automatique d'une Architecture Parall\`{e}le},
	INDEX ={\indexbib{placement de processus!statique}},
	YEAR = 1994,
	MONTH = {mars},
	JOURNAL = {Calculateurs Parall\`{e}les},
	VOLUME = 21,
	SUMMARY = {Pb : comment adapter la structure d'une architecture
		  reconfigurable \`{a} un programme parall\`{e}le ? Pour cela,
		  l'auteur utilise une heuristique du m{\^e}me style que
		  \cite{Wu:94}. 1- grouper les processus sans tenir compte des
		  liens physiques, 2- transformer le graphe.}
}




@INPROCEEDINGS{Tang:93,
	AUTHOR = {Tang, Peiyi},
	TITLE ={Exact Side Effects for Interprocedural Dependence Analysis},
	INDEX ={\indexbib{analyse!interproc{\'e}durale}
		\indexbib{analyse!d{\'e}pendances}},
	BOOKTITLE = ics,
	YEAR = 1993,
	MONTH = jul,
	PAGES = "137--146",
	NOTE = {},
	SUMMARY = {D{\'e}crit une nouvelle mani\`{e}re de repr{\'e}senter les acc\`{e}s
		  aux tableaux, par un probl\`{e}me de programmation en nombres
		  entiers. Les r{\'e}sum{\'e}s obtenus sont sens{\'e}s {\^e}tre exacts,
		  dans le sens o\`{u} ils ne contiennent pas de point
		  n'appartenant pas \`{a} l'ensemble de d{\'e}part. Tang s'appuie
		  sur l'Om{\'e}ga test pour r{\'e}soudre ensuite le probl\`{e}me des
		  d{\'e}pendances. En r{\'e}alit{\'e}, Tang s'appuie sur des
		  hyphoth\`{e}ses tr\`{e}s fortes qu'il n'explicite m{\^e}me pas :
		  toutes les variables scalaires enti\`{e}res s'expriment
		  lin{\'e}airement les unes en fonction des autres, et ne
		  varient pas dans les corps des boucles. Les expressions
		  des indices des tableaux ne doivent d{\'e}pendre que des
		  indices des boucles englobantes et des param\`{e}tres entiers
		  qui sont soit des constantes, soit des variables locales
		  ou globales ne variant pas. L'int{\'e}r{\^e}t de cet article
		  r{\'e}side essentiellemtn dans la propagation
		  interproc{\'e}durale des ensembles d'el{\'e}ments de tableaux
		  repr{\'e}sent{\'e}s sous la forme d'un probl\`{e}me de
		  programmation en nombre entier. \references{16}} }


@ARTICLE{Tarj:74,
	AUTHOR = {Tarjan, R. E.},
	TITLE = {Testing Flow Graph Reducibility},
	INDEX ={\indexbib{}},
	YEAR = 1974,
	JOURNAL = jcss,
	VOLUME = 9,
	PAGES = {355--365},
	SUMMARY = {je ne l'ai pas. cf \cite{Ryde:86}.}
}

@ARTICLE{Tarj:81,
	AUTHOR = {Tarjan, R. E.},
	TITLE = {Fasts Algorithms for solving Paths Problems},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es}},
	YEAR = 1981,
	MONTH = jul,
	JOURNAL = jacm,
	VOLUME = 28,
	NUMBER = 3,
	PAGES = {594--614},
	SUMMARY = {je ne l'ai pas. cf \cite{Ryde:86}.}
}


@PHDTHESIS{Tawb:91,
	AUTHOR = {Tawbi, Nadia},
	TITLE ={Parall{\'e}lisation Automatique : Estimation des Dur{\'e}es
		  d'Ex{\'e}cution et Allocation statique de processeurs},
	INDEX ={\indexbib{placement de processus!statique}},
	SCHOOL = paris-6,
	YEAR = 1991,
}



@TECHREPORT{Tema:94,
	AUTHOR = {Teman, O.},
	TITLE ={Performance Analysis of Multiprocessors Memory System},
	INDEX ={\indexbib{performances!pr{\'e}diction}
                \indexbib{cache}},
	YEAR = 1994,
	INSTITUTION = {APPARC},
	TYPE = {Deliverable},
	NUMBER = {PME4b},
	SUMMARY = {\references{13}}
}


@ARTICLE{Tilb:84,
	AUTHOR = {Tilborg, A.M.V and Wittie, L.D.},
	TITLE = {Wave Scheduling - Decentralized Scheduling of Task Forces
		  in Multicomputers},
	INDEX ={\indexbib{placement de processus!statique}},
	YEAR = 1984,
	MONTH = sep,
	JOURNAL = ieeetoc,
	VOLUME = {C--33},
	NUMBER = 9,
	PAGES = {835--844},
}



@INPROCEEDINGS{Tjia:92a,
	AUTHOR = {Tjiang, Steven and Hennessy,John},
	TITLE ={Sharlit--A tool for Building Optimizers},
	INDEX ={\indexbib{}},
	BOOKTITLE = pldi,
	YEAR = 1992,
	MONTH = jun,
	PAGES = {82--93},
	NOTE = {In} # sigplan,
	SUMMARY = {Sharlit permet de construire un optimiseur bass{\'e} sur une
		  analyse de flot de donn{\'e}e en fournissant les op{\'e}rateurs
		  de flot de donn{\'e}e (meet, fixed-point) et la fa\c{c}on de
		  modifier le graphe de contr{\^o}le en fonction des r{\'e}sultats
		  de l'analyse. \references{93}}
}


@PHDTHESIS{Trio:84,
	AUTHOR = {Triolet, R{\'e}mi},
	TITLE ={Contribution \`{a} la parall{\'e}lisation automatique 
		de programmes {F}ortran comportant des appels de proc{\'e}dures},
	INDEX ={\indexbib{parall{\'e}lisation!automatique}
		\indexbib{analyse!interproc{\'e}durale}
		\indexbib{langage!Fortran}},
	SCHOOL = {Paris VI University},
	YEAR = 1984,
	SUMMARY = {
                Les parties introduisant la parall{\'e}lisation automatique de
		Fortran sont tr\`{e}s int{\'e}ressantes. On trouve aussi la
		pr{\'e}sentation de techniques existantes.}  
}



@TECHREPORT{Trio:84a,
	AUTHOR = {Triolet, R{\'e}mi},
	TITLE ={Contribution \`{a} la Parall{\'e}lisation Automatique 
		de Programmes Fortran Comportant des Appels de Proc{\'e}dures},
	INDEX ={\indexbib{parall{\'e}lisation!automatique}
		\indexbib{analyse!interproc{\'e}durale}
		\indexbib{langage!Fortran}},
	YEAR = 1984,
	INSTITUTION = paris-6,
	TYPE = {Th\`{e}se de doctorat},
	
}




@TECHREPORT{Trio:85,
	AUTHOR = {Triolet, R{\'e}mi},
	TITLE ={Interprocedural Analysis for Program Restructuring with
		  {P}arafrase},
	INDEX ={\indexbib{analyse!interprocedurale}},
	YEAR = 1985,
	MONTH = dec,
	INSTITUTION = csrd,
	TYPE = {Technical report},
	NUMBER = 538,
	SUMMARY = {Pr{\'e}conditions, r{\'e}gions. \references{29}}
}


@INPROCEEDINGS{Trio:86,
        AUTHOR = "  Triolet, R{\'e}mi 
		and Feautrier, Paul
		and Irigoin, Fran\c{c}ois",
        TITLE = "Direct Parallelization of Call Statements",
	INDEX ={\indexbib{parall{\'e}lisation!automatique}
		\indexbib{analyse!interproc{\'e}durale}
		\indexbib{analyse!sections de tableaux}},
        BOOKTITLE = acm-scc,
	PAGES = {176--185},
        YEAR = 1986,
	SUMMARY = {D{\'e}finition des r{\'e}gions, tests de d{\'e}pendance les utilisant.
                   \references{20}}
}



@PHDTHESIS{Tsen:93,
	AUTHOR = {Tseng, Chau-Wen},
	TITLE ={An optimizing {F}ortran {D} Compiler for {MIMD}
		  Distributed-Memory Machines},
	INDEX ={\indexbib{}},
	SCHOOL = rice,
	YEAR = 1993,
	MONTH = jan,
	NOTE = {},
	SUMMARY = {Ce compilateur utilise une forme de RSDs qui combine les
		  RSD de Havlak et les RSD de Callahan (contrainte diagonale
		  permettant de repr{\'e}senter les sections triangulaires. 
                  \references{213}}
}


@INPROCEEDINGS{Tsen:95a,
	AUTHOR = {Tseng, Chau-Wen and Anderson, Jennifer and Amarasinghe,
		  Saman and Lam, Monica},
	TITLE ={Unified Compilation Techniques for Shared and Distributed
		  Address Space Machines},
	INDEX ={\indexbib{parall{\'e}lisation!besoins}},
	BOOKTITLE = ics,
	YEAR = 1995,
	MONTH = jul,
	PAGES = {67--76},
	SUMMARY = {Les auteurs d{\'e}montrent \`{a} partir d'exp{\'e}riences que  les
		  optimisations pour machines \`{a} m{\'e}moire distribu{\'e}e
		  peremttent d'am{\'e}liorer les performances pour les machines
		  \`{a} espace d'adressage partag{\'e}. Ces optimisations sont
		  l'am{\'e}lioration de la localit{\'e}, la r{\'e}duction du nombre
		  de synchronisations, et du co{\^u}t de communications.
 		  \references{33}}
}


@INPROCEEDINGS{Tu:92,
	AUTHOR = {Tu, Peng
		and Padua, David},
	TITLE ={Array Privatization for Shared and Distributed Memory Machines 
		(Extended Abstract)},
	INDEX ={\indexbib{transformations de programme!privatisation de tableaux}},
	BOOKTITLE = wlcdmm,
	YEAR = 1992,
	PAGES = {64--67},
	SUMMARY = {\`{a} lire}
}



@INPROCEEDINGS{Tu:93,
	AUTHOR = {Tu, Peng and Padua, David},
	TITLE ={Automatic Array Privatization},
	INDEX ={\indexbib{transformations de programme!privatisation de tableaux}},
	BOOKTITLE = lcpc,
	YEAR = 1993,
	MONTH = aug,
	SUMMARY = {L'algo que je dois impl{\'e}menter, moins les relations
		entre variables symboliques.  bas{\'e} sur USE-DEF-KILL
		sets. Copy-out, mais pas copy-in. Copy-out dynamique.  Test
		de profitabilit{\'e} de la privatisation. Ne privatise que les
		tableaux entiers. Utilise les RSDs.  Exp{\'e}riences sur
		Perfect Club. Ca permettra de comparer. \references{22}} }




@PHDTHESIS{Tu:95a,
	AUTHOR = {Tu, Peng},
	TITLE ={Automatic Array Privatization and Demand-Driven Symbolic Analysis},
	INDEX ={\indexbib{privatisation de tableaux}},
	SCHOOL = illinois,
	YEAR = 1995,
	SUMMARY = {Privatisation de tableaux, et analyse symbolique de
		  programme bas{\'e}e sur une repr{\'e}sentation \`{a} assignation
		  unique gard{\'e}e (GSA) du programme. Utilisation des RSDs \`{a}
		  pas et pente de + ou -1 pour les ensembles d'{\'e}l{\'e}ments de
		  tableaux. \references{77}}
}

		  

@INPROCEEDINGS{Tu:95b,
	AUTHOR = {Tu, Peng and Padua, David},
	TITLE ={Gated {SSA}-Based Demand-Driven Symboli Analysis for
		  Parallelizing Compilers},
	INDEX ={\indexbib{}},
	BOOKTITLE = ics,
	YEAR = 1995,
	MONTH = jul,
	PAGES = {414--423},
	SUMMARY = {\references{25}}
}
		  

%
% -U-
%

@INPROCEEDINGS{Uhl:94,
	AUTHOR = "Uhl, James S.
		and Horspool, Nigel R.",
        TITLE = {Flow grammars - a flow analysis methodology},
	INDEX ={\indexbib{analyse!interproc{\'e}durale}
		\indexbib{analyse!flot de contr{\^o}le}
		\indexbib{analyse!flot de donn{\'e}es}},
        BOOKTITLE = cc,
        YEAR = 1994,
	NOTE = "Not yet accepted",
	SUMMARY = {\`{a} lire }
}

@ARTICLE{Ullm:73,
	AUTHOR = {Ullman, J. D.},
	TITLE = {Fast Algorithms for the Elimination of Common Subexpressions},
	INDEX ={\indexbib{analyse!flot de donn{\'e}es}},
	YEAR = 1973,
	JOURNAL = actinf,
	VOLUME = 2,
	NUMBER = 3,
	PAGES = {191--213},
	SUMMARY = {je ne l'ai pas. cf \cite{Ryde:86}.}
}



@MISC{Unde:81,
        AUTHOR = {Undergraduate Academic Support Office, at MIT},
	TITLE ={The Torch or the Firehose ?},
	INDEX ={\indexbib{{\'e}ducation}},
	YEAR = 1981
}


%
% -V-
%

@INPROCEEDINGS{Veen:93,
	AUTHOR = {A.H. Veen and M. de Lange},
	TITLE ={Overview of the {PREPARE} Project},
	INDEX ={\indexbib{environnement de programmation}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "365--371",
	SUMMARY = {\references{12}}
}


@MISC{Vois:92a,
	AUTHOR = {Voisin, Fr{\'e}d{\'e}rique},
	TITLE ={Math{\'e}matiques du Logiciel},
	INDEX ={\indexbib{math{\'e}matiques}},
	HOWPUBLISHED = {{\'E}cole Sup{\'e}rieure D'{\'E}lectricit{\'e}, Option
		  Informatique, Notes de Cours.},
	YEAR = 1992,
	SUMMARY = {\references{9}}
}
		  
		  
%
% -W-
%

@INPROCEEDINGS{Wall:88,
	AUTHOR = {Wallace, David R.},
	TITLE ={Dependence of Multi-Dimensional Array References},
	INDEX ={\indexbib{analyse!d{\'e}pendances}},
	BOOKTITLE = ics,
	YEAR = 1988,
	MONTH = jul,
	PAGES = {418--428},
	SUMMARY = {Le pb est mis sous forme matricielle. \references{21}}
}


@INPROCEEDINGS{Wang:93,
	AUTHOR = {K.Y. Wang},
	TITLE ={a Framework for Static, Precise Performance Prediction for
		Superscalar-based Parallel computers},
	INDEX ={\indexbib{performances!pr{\'e}diction}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "413--427",
	SUMMARY = {\references{22}}
}


@INPROCEEDINGS{Watt:92,
	AUTHOR = {Watts, Tia M. and Soffa, Mary Lou and Gupta, Rajiv},
	TITLE ={Techniques for Integrating Parallelizing Transformations and
		  Compiler Based Scheduling Methods},
	INDEX ={\indexbib{ordonnancement}
                \indexbib{parall{\'e}lisation!automatique}},
	BOOKTITLE = ics,
	YEAR = 1992,
	PAGES = {830--839},
	SUMMARY = {The authors first show that parallelizing transformations
		  (such as loop spliting) may affect the result of a further
		  scheduling phase. Their goal is to apply transformations
		  only if they can improve the original schedule of the
		  program. Three techniques are proposed. I have not read
		  them. This joins the more general problem of ordering
		  phases in an optimizimg compiler. \references{20}}
}


		  
@INPROCEEDINGS{Wen:95a,
	AUTHOR = {Wen, Renhua. and Gao, Guang and Dongen, Vincent},
	TITLE ={The Design and Implementation of the Accurate Array Data
		  Flow Analysis in the {HPC} Compiler},
	INDEX ={\indexbib{}},
	BOOKTITLE = hpcs,
	YEAR = 1995,
	MONTH = jul,
	PAGES = {144--155},
	SUMMARY = {Encore une version des l'{\em array data flow\/} \`{a} la
		  Feautrier. Cette fois-ci, ils calculent des {\em source
		  tree} qui sont des arbres \`{a} deux {\'e}tages. La racine est
		  le consommateur, les feuilles sont les producteurs. Les
		  conditions sous lesquelles une r{\'e}f{\'e}rence est bien
		  producteur est stock{\'e}e au niveau de la feuille et non
		  dans des niveaux interm{\'e}diaires de l'arbre. Ceci permet
		  une repr{\'e}sentation plus compacte. En plus, les
		  producteurs potentiels sont examin{\'e}s dans l'ordre
		  lexicographique inverse, ceux de niveau plus {\'e}lev{\'e}
		  (profondeur de d{\'e}pendance) avant ceux de niveau moins
		  {\'e}lev{\'e}. Et la recherche s'ar{\^e}te d\`{e}s que toutes les
		  feuilles ont trouv{\'e} un producteur correspondant.
		  
		  Il y a plus. La m{\'e}thode de Feautrier s'applique
		  normalement \`{a} un nid de boucles. Les auteurs l'{\'e}tendent
		  \`{a} la s{\'e}quence d'instructions complexes, sans introduire
		  de boucle imaginaire englobante. Mais si les r{\'e}sultats
		  exp{\'e}rimentaux sont plut{\^o}t bons pour les nids de boucles,
		  il semble qu'ils ne soient pas \`{a} la hauteur pour
		  l'analyse globale, car les codes du Perfect Club ne sont
		  pas assez {\em r{\'e}guliers\/} et il y a des appels de
		  proc{\'e}dure
		  
		  Le compilateur utilise PIP et Chernikova.
		  
		  \references{16}}
}

		  
@TECHREPORT{Wild:93,
	AUTHOR = {Wilde, Doran K.},
	TITLE ={A Library for Doing Polyhedral Operations},
	INDEX ={\indexbib{poly\`{e}dres}},
	YEAR = 1993,
	MONTH = dec,
	INSTITUTION = irisa,
	TYPE = {Publication Interne},
	NUMBER = 785,
	SUMMARY = {op{\'e}rations sur les poly\`{e}dres et les unions de
		  poly\`{e}dres. Ces unions ne sont pas disjointes. \references{19}}
}


@INPROCEEDINGS{Wild:94,
	AUTHOR = {Wilde, D. and Le Verge, H. and van Dongen, V.},
	TITLE ={La Synth\`{e}se de Nids de Boucles avec la Biblioth\`{e}que Poly\`{e}drique},
	INDEX ={\indexbib{}},
	BOOKTITLE = renpar,
	YEAR = 1994,
	MONTH = {juin},
	PAGES = {73--76},
	SUMMARY = {\references{10}}
}


@TECHREPORT{Wild:94a,
	AUTHOR = {Wilde, Doran and Rajopadhye, Sanjay},
	TITLE ={An Inductive Constructive Method for Computation of the Face
		  Lattice of a Polyhedron},
	INDEX ={\indexbib{poly\`{e}dres}},
	YEAR = 1994,
	MONTH = dec,
	INSTITUTION = irisa,
	TYPE = {Publication interne},
	NUMBER = 786,
	SUMMARY = {Tout est dans le titre. \references{10}}
}


@MISC{Wils:92,
	AUTHOR = "Wilson, Gregory W.",
	TITLE ={Practical Parallel Programming - Glossary},
	INDEX ={\indexbib{parall{\'e}lisme}},
	HOWPUBLISHED = {ftp {\tt ftp.epcc.ed.ac.uk}, 
		{\tt pub/personal/gvw/glossary.ps.Z.uu}},
	YEAR = 1992,
	NOTE = {},
	lieu = "trou ",
	SUMMARY = {Tout plein de d{\'e}finitions de mots du parall{\'e}lisme.
                   \references{10}
		\`{a} lire}
}

@ARTICLE{Wils:94,
	AUTHOR = {Wilson, Robert and French, Robert and Wilson, Christopher
		  and Amarasinghe, Saman and Anderson, Jennifer and Tjiang,
		  Steve and Hall, Mary and Lam, Monica and Hennessy, John},
	TITLE = {{SUIF}: An Infrastructure for Reasearch on Parallelizing
		  and Optimizing Compilers},
	INDEX ={\indexbib{}},
	YEAR = 1994,
	MONTH = dec,
	JOURNAL =sigplan,
	VOLUME = 29,
	NUMBER = 12,
	PAGES = {31--37},
	SUMMARY = {Overview of SUIF, the Stanford University Intermediate
		  Format. The {\em kernel} is an intermediate representaiton
		  of the program. Its a low level representation (adress
		  calculation like in traditional compilers) except for
		  array accesses, loops and conditional statements, to allow
		  particular treatments. There is a {\em global symbol
		  table} for global symbols (COMONs for instance). The
		  kernel is written in C++. It provides methods for
		  duplicating regions of code, creating new instrucitons and
		  symbols, reading and writing to the databas ({\em SUIF
		  files}). 

                  There are two  front-ends. One for C programs, that are
		  passed through a modifed version of {\tt lcc}, and one for
		  Fortran programs, that are first passed through {\tt
		  f2c}. THe main drawback of using {\tt f2c} is that the
		  code of the user is modified, and its semantic hard to
		  recognize in some cases. 

                  The scalar optimizations are the following: constant
		  propagation, forward propagation, induction variable
		  detection, constant folding and scalar privatization. 

                  The unimodular transformations are aimed at optimizing
		  data locality. Siumple reduction recognition is
		  implemented. 


                  The dependence analyzer is the one from Maydan. It handles
		  array privatization and some non linear array accesses. 

                  The back end includes a software prefetching tool, and an
		  instruction scheduler for superscalar processors. 

                  The underlying linear framework is based on inequalities,
		  and F-M (reals and integers). It deals with symbolic
		  coefficients in some cases. \references{14}}
}


@INPROCEEDINGS{Wolc:93,
	AUTHOR = {Wolczko, M. and Williams, I.},
	TITLE ={The Influence of the ObjectO-rientd Language Model on a
		  Supporting Architecture},
	INDEX ={\indexbib{langage!langages \`{a} objets}},
	BOOKTITLE = icss,
	YEAR = 1993,
	MONTH = jan,
        VOLUME = 1,
	PAGES = {182--191},
	SUMMARY = {\references{24}}
}


@BOOK{Wolf:89,
	AUTHOR = {Wolfe, Michael},
	TITLE = {Optimizing Supercompilers for Supercomputers},
	INDEX ={\indexbib{parall{\'e}lisation!automatique}},
	YEAR = 1989,
	PUBLISHER = {MIT Press},
}



@TECHREPORT{Wolf:90,
	AUTHOR = {Wolfe, Michael},
	TITLE ={Scalar vs. Parallel optimizations},
	INDEX ={\indexbib{optimisation de programme}},
	YEAR = 1990,
	INSTITUTION = ogist,
	TYPE = {Technical Report},
	SUMMARY = {Il montre que certianes optimisations parall\`{e}les sont
		  rendues possibles en effectuant l'inverse des
		  optimisations scalaires traditionnelles. De plsu l'ordre
		  dans lequle on applique les optimisations doit d{\'e}pendre
		  de l'architecture de la machine cible, et du programme
		  particulier que l'on traite. \references{24}}
}


@INPROCEEDINGS{Wolf:91a,
	AUTHOR = {Wolfe, Michael and Lam, Monica},
	TITLE ={A Data Locality Optimizing Algorithm},
	INDEX ={\indexbib{}},
	BOOKTITLE = pldi,
	YEAR = 1992,
	MONTH = jun,
	PAGES = {30--44},
	NOTE = {In} # sigplan,
	SUMMARY = {\references{18}}
}


		  
@INPROCEEDINGS{Woo:95a,
	AUTHOR = {Woo, Steven and Ohara, Moriyoshi and Torrie, Evan and
		  Singh, Jaswinder and Gupta, Anoop},
	TITLE ={The {SPLASH-2} Programs: Characterization and Methodological
		  Considerations},
	INDEX ={\indexbib{benchmarks}},
	BOOKTITLE = isca,
	YEAR = 1995,
	MONTH = jun,
	PAGES = {24-36},
	SUMMARY = {\references{22}}
}

		  
@ARTICLE{Wu:94,
	AUTHOR = {Wu, Shen Shen and Sweeting, David},
	TITLE = {Heuristic Algorithm for Task Assigment and Scheduling in a
		  Processor Network},
	INDEX ={\indexbib{placement de processus!statique}},
	YEAR = 1994,
	MONTH = jan,
	JOURNAL = parcomp,
	VOLUME = 20,
	NUMBER = 1,
	PAGES = {1--14},
	SUMMARY = {\references{18}}
}


@ARTICLE{Wu:95a,
	AUTHOR = {Wu, Janet and Das, Raja and Saltz, Joe and Berryman, Harry
		  and Hiranandani, Seema},
	TITLE = {Distributed Memory Compiler Design for Sparse Problems},
	INDEX ={\indexbib{}},
	YEAR = 1995,
	MONTH = jun,
	JOURNAL = ieeetoc,
	VOLUME = 44,
	NUMBER = 6,
	PAGES = {737--753},
	SUMMARY = {\references{45}}
}

%
% -X-
%


@INPROCEEDINGS{Xue:95a,
	AUTHOR = {Xue, Jingling},
	TITLE ={Constructing DO Loops for Non-convex Iteration Spaces in
		  Compiling for Parallel Machines},
	INDEX ={\indexbib{}},
	BOOKTITLE = ipps,
	YEAR = 1995,
	MONTH = apr,
	SUMMARY = {\references{13}}
}


%
% -Y-
%

@PHDTHESIS{Yang:93,
	AUTHOR = {Yang, Yi-Qing},
	TITLE ={Tests des D{\'e}pendances et Transformations de Programme},
	INDEX ={\indexbib{transformations de programme}
		\indexbib{analyse!d{\'e}pendances}},
	SCHOOL = paris-6,
	YEAR = 1993,
	MONTH = {Novembre},
	SUMMARY = {
                {\'E}tat de l'art sur les tests de d{\'e}pendance
		existants. Comparaisons. Exp{\'e}riences.  Clair (int{\'e}ressant
		pour savoir ce que fait PIPS en la
		mati\`{e}re). \references{111}} 
}



@INPROCEEDINGS{Yang:94,
	AUTHOR = {Yang, Yi-Qing and Ancourt, Corinne and Irigoin, Fran\c{c}ois},
	TITLE ={Minimal Data Dependence Abstractions for Loop Transformations},
	INDEX ={\indexbib{analyse!d{\'e}pendances}},
	BOOKTITLE = lcpc,
	YEAR = 1994,
	MONTH = jul,
	SUMMARY = {\references{26}}
}


%
% -Z-
%


@INPROCEEDINGS{Zaaf:94,
	AUTHOR = {Zaafrani, A. and Ito, M.R.},
	TITLE ={Expressing Cross-Loop Dependencies through Hyperplane Data
		  Dependence Anlaysis},
	INDEX ={\indexbib{analyse!d{\'e}pendances}},
	BOOKTITLE = ics,
	YEAR = 1994,
	MONTH = nov,
	PAGES = {508--517},
	SUMMARY = {\references{20}}
}


@INPROCEEDINGS{Zapa:93,
	AUTHOR = {E.L. Zapata and L.F. Romero},
	TITLE ={Data Distributions for Sparse Matrix Vector Multiplication},
	INDEX ={\indexbib{distribution! de donn{\'e}es}},
	BOOKTITLE = delft93,
	YEAR = 1993,
	MONTH = dec,
	PAGES = "154--167",
	SUMMARY = {\references{29}}
}

@ARTICLE{Zaya:87,
	AUTHOR = {Zayas, E.R.},
	TITLE = {Attacking the Process Migration Bottleneck},
	INDEX ={\indexbib{placement de processus!dynamique}},
	YEAR = 1987,
	MONTH = nov,
	JOURNAL = acmosr,
	VOLUME = 21,
	NUMBER = 5,
	PAGES = {13--24},
}



@PHDTHESIS{Zimm:93,
	AUTHOR = {Zimmermann, Falk},
	TITLE ={Portierung einer Datenparallelen Sprache in Programme mit
		  Explizitem Message Passing},
	INDEX ={\indexbib{}},
	SCHOOL = {Rheinische Friedrich-Wilhelms Universit{\"a}t, Bonn},
	YEAR = 1993,
	MONTH = may,
	SUMMARY = {Passage d'un langage SIMD \`{a} un langage MIMD avec
		  message passing explicite. \references{25}}
}


@INPROCEEDINGS{Zhou:87,
	AUTHOR = {Zhou, S. and Ferrari, D.},
	TITLE ={A Measurement Study of Load Balancing Performance},
	INDEX ={\indexbib{placement de processus!dynamique}},
	BOOKTITLE = icdcs,
	YEAR = 1987,
	MONTH = sep,
	PAGES = {490--497},
}