1. Florent Bouchez. A Study of Spilling and Coalescing in Register Allocation as Two Separate Phases. PhD thesis, École normale supérieure de Lyon, April 2009.

1. Christophe Guillon, Fabrice Rastello, Thierry Bidault, and Florent Bouchez. Procedure Placement using Temporal-Ordering Information: Dealing with Code Size Expansion. Journal of Embedded Computing, 1(4):437-459, 2005.

1. Florent Bouchez, Quentin Colombet, Alain Darte, Christophe Guillon, and Fabrice Rastello. Parallel Copy Motion. In 13th International Workshop on Software & Compilers for Embedded Systems (SCOPES'10), St. Goar, Germany, pages 1-10, June 2010. ACM Press.



2. Florent Bouchez, Alain Darte, and Fabrice Rastello. Advanced Conservative and Optimistic Register Coalescing. In International Conference on Compilers, Architectures and Synthesis for Embedded Systems (CASES'08), Atlanta, GA, USA, pages 147-156, October 2008. ACM Press.



3. Florent Bouchez, Alain Darte, and Fabrice Rastello. On the Complexity of Register Coalescing. In International Symposium on Code Generation and Optimization (CGO'07), pages 102-114, March 2007. IEEE Computer Society Press. Note: Best paper award.



4. Florent Bouchez, Alain Darte, and Fabrice Rastello. On the Complexity of Spill Everywhere under SSA Form. In ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES'07), volume 42, San Diego, USA, pages 103-112, June 2007. ACM Press.



5. Florent Bouchez, Alain Darte, Christophe Guillon, and Fabrice Rastello. Register Allocation: What does the NP-Completeness Proof of Chaitin et al. Really Prove?. In Annual Workshop in Duplicating, Deconstructing, and Debunking (WDDD'06), held in conjunction with the International Symposium on Computer Architecture (ISCA'33), Boston, MA, USA, July 2006.



6. Florent Bouchez, Alain Darte, Christophe Guillon, and Fabrice Rastello. Register Allocation: What does the NP-Completeness Proof of Chaitin et al. Really Prove? Or Revisiting Register Allocation: Why and How. In International Workshop on Languages and Compilers for Parallel Computing (LCPC'06), New Orleans, FL, USA, November 2006. Springer Verlag.



7. Christophe Guillon, Fabrice Rastello, Thierry Bidault, and Florent Bouchez. Procedure Placement using Temporal-Ordering Information: Dealing with Code Size Expansion. In International Conference on Compilers, Architecture, and Synthesis for Embedded Systems (CASES'04), pages 268-279, 2004. ACM Press.

1. Florent Bouchez, Alain Darte, and Fabrice Rastello. Improvements to Conservative and Optimistic Register Coalescing. Technical report RR2007-41, LIP, ENS-Lyon, France, March 2007. [WWW]



2. Florent Bouchez, Alain Darte, and Fabrice Rastello. On the Complexity of Spill Everywhere under SSA Form. Technical report RR2007-42, LIP, ENS-Lyon, France, March 2007. [WWW]



3. Florent Bouchez, Alain Darte, and Fabrice Rastello. On the Complexity of Register Coalescing. Technical report RR2006-15, LIP, ENS-Lyon, France, March 2006. [WWW]



4. Florent Bouchez, Alain Darte, and Fabrice Rastello. Register Allocation: What does Chaitin's NP-Completeness Proof Really Prove?. Technical report RR2006-13, LIP, ENS-Lyon, France, March 2006. [WWW]



5. Florent Bouchez, Alain Darte, Christophe Guillon, and Fabrice Rastello. Register Allocation and Spill Complexity under SSA. Technical report RR2005-33, LIP, ENS Lyon, France, August 2005. [WWW]



6. Thierry Bidault, Christophe Guillon, Florent Bouchez, and Fabrice Rastello. Procedure Placement using Temporal-Ordering Information: Dealing with Code Size Expansion. Technical report RR-04-16, LIP, ENS Lyon, France, April 2004. [WWW]

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.

This document was translated from BibT_EX by bibtex2html