Thesis

2009

[1] Florent Bouchez.
A Study of Spilling and Coalescing in Register Allocation as Two Separate Phases
apr
See also this page.
Get BibTex info Portable Document File version (.pdf) Talk slides (.pdf)

Journals

2005

[2] Christophe Guillon, Fabrice Rastello, Thierry Bidault, Florent Bouchez.
Procedure placement using temporal-ordering information: dealing with code size expansion
Journal of Embedded Computing

Improved version of 11
Get BibTex info Portable Document File version (.pdf)

Conferences and workshops

2012

[3] Artun Pietrek, Florent Bouchez, Benoît Dinechin.
A Tirex-based SSA Interpreter
DCE ’12: International Workshop on Dynamic Compilation Everywhere
Paris, France
jan
Get BibTex info Portable Document File version (.pdf)

2011

[4] Artun Pietrek, Florent Bouchez, Benoît Dinechin.
Tirex: A Textual Target-Level Intermediate Representation for Compiler Exchange
WIR '11: International Workshop on Intermediate Representations
Chamonix, France
apr
Get BibTex info Portable Document File version (.pdf)

2010

[5] Florent Bouchez, Quentin Colombet, Alain Darte, Fabrice Rastello, Christophe Guillon.
Parallel copy motion
{SCOPES}'10: Proceedings of the 13th International Workshop on Software \& Compilers for Embedded Systems
St. Goar, Germany
Get BibTex info Portable Document File version (.pdf)

2008

[6] Florent Bouchez, Alain Darte, Fabrice Rastello.
Advanced conservative and optimistic register coalescing
CASES '08: Proceedings of the 2008 international conference on Compilers, architectures and synthesis for embedded systems
Atlanta, GA, USA
Acceptance rate: 27 of 82 submissions, 33%
Get BibTex info Portable Document File version (.pdf) Talk slides (.pdf)

2007

[7] Florent Bouchez, Alain Darte, Fabrice Rastello.
On the complexity of register coalescing
CGO '07: Proceedings of the International Symposium on Code Generation and Optimization
San Jose, CA, USA
mar
Best paper award
Acceptance rate: 32%

Improved version of 13
Get BibTex info Portable Document File version (.pdf) Talk slides (.pdf)

[8] Florent Bouchez, Alain Darte, Fabrice Rastello.
On the complexity of spill everywhere under SSA form
LCTES '07: Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
San Diego, California, USA
jun
Acceptance rate: 21 of 76 submissions, 28%
Get BibTex info Compressed postcript version (.ps.gz) Portable Document File version (.pdf) Talk slides (.pdf) Poster for poster session (.pdf)

2006

[9] Florent Bouchez, Alain Darte, Christophe Guillon, Fabrice Rastello.
Register allocation: What does the NP-Completeness proof of Chaitin et al. really prove? or revisiting register allocation: why and how?
LPCP '06: Proceedings of the 19th international workshop on languages and compilers for parallel computing
New Orleans, LA, USA
nov

Improved version of 10
Get BibTex info Compressed postcript version (.ps.gz) Portable Document File version (.pdf) Talk slides (.pdf)

[10] Florent Bouchez, Alain Darte, Christophe Guillon, Fabrice Rastello.
Register allocation: What does the NP-Completeness proof of Chaitin et al. really prove?
5th annual workshop in duplicating, deconstructing, and debunking (wddd'06), held in conjunction with the 33rd international symposium on computer architecture (isca-33)
jul

Improved version of 14
Get BibTex info Compressed postcript version (.ps.gz) Portable Document File version (.pdf)

2004

[11] Christophe Guillon, Fabrice Rastello, Thierry Bidault, Florent Bouchez.
Procedure placement using temporal-ordering information: dealing with code size expansion
CASES '04: Proceedings of the 2004 international conference on Compilers, architecture, and synthesis for embedded systems
Washington DC, USA
Acceptance rate: 31 of 102 submissions, 30%

Improved version of 16
Get BibTex info Portable Document File version (.pdf)

Technical Reports

2010

[12] Florent Bouchez.
GPGPU and Matlab
Indian Institude of Science
jan
Get BibTex info Portable Document File version (.pdf)

2006

[13] Florent Bouchez, Alain Darte, Fabrice Rastello.
On the complexity of register coalescing
LIP
mar
http://www.ens-lyon.fr/LIP/Pub/rr2006.php
Get BibTex info

[14] Florent Bouchez, Alain Darte, Fabrice Rastello.
Register allocation: What does Chaitin's NP-completeness proof really prove?
LIP
mar
http://www.ens-lyon.fr/LIP/Pub/rr2006.php
Get BibTex info

2005

[15] Florent Bouchez, Alain Darte, Christophe Guillon, Fabrice Rastello.
Register allocation and spill complexity under SSA
Language: French
LIP
aug
http://www.ens-lyon.fr/LIP/Pub/rr2005.php
Get BibTex info Portable Document File version (.pdf)

2004

[16] Thierry Bidault, Christophe Guillon, Florent Bouchez, Fabrice Rastello.
Procedure placement using temporal-ordering information: dealing with code size expansion
LIP
apr
http://www.ens-lyon.fr/LIP/Pub/rr2004.php
Get BibTex info

Talks

2009

[17] Florent Bouchez.
SSA Destruction after Register Allocation
oct
Part 5 of the Register Allocation tutorial of LCPC '09.
http://dynopt.ece.udel.edu/lcpc09/tutorial.shtml
Get BibTex info Talk slides (.pdf)

2008

[18] Florent Bouchez.
Register Allocation: Complexity Overview and Practical Recommendations
aug
Presentation for a Post Doc at IBM Research India
Get BibTex info Talk slides (.pdf)