 | 2011 |
| 13 |  | Benoit Boissinot,
Florian Brandner,
Alain Darte,
Benoît Dupont de Dinechin,
Fabrice Rastello:
A Non-iterative Data-Flow Algorithm for Computing Liveness Sets in Strict SSA Programs.
APLAS 2011: 137-154 |
| 12 |  | Quentin Colombet,
Florian Brandner,
Alain Darte:
Studying optimal spilling in the light of SSA.
CASES 2011: 25-34 |
| 11 |  | Martin Schoeberl,
Pascal Schleuniger,
Wolfgang Puffitsch,
Florian Brandner,
Christian W. Probst:
Towards a Time-predictable Dual-Issue Microprocessor: The Patmos Approach.
PPES 2011: 11-21 |
| 2010 |
| 10 |  | Florian Brandner:
Completeness of automatically generated instruction selectors.
ASAP 2010: 175-182 |
| 9 |  | Michael Bebenita,
Florian Brandner,
Manuel Fähndrich,
Francesco Logozzo,
Wolfram Schulte,
Nikolai Tillmann,
Herman Venter:
SPUR: a trace-based JIT compiler for CIL.
OOPSLA 2010: 708-725 |
| 8 |  | Martin Schoeberl,
Florian Brandner,
Jan Vitek:
RTTM: real-time transactional memory.
SAC 2010: 326-333 |
| 2009 |
| 7 |  | Florian Brandner,
Tommy Thorn,
Martin Schoeberl:
Embedded JIT Compilation with CACAO on YARI.
ISORC 2009: 63-70 |
| 6 |  | Peter Molnar,
Andreas Krall,
Florian Brandner:
Stack allocation of objects in the CACAO virtual machine.
PPPJ 2009: 153-161 |
| 5 |  | Florian Brandner:
Precise simulation of interrupts using a rollback mechanism.
SCOPES 2009: 71-80 |
| 2008 |
| 4 |  | Dietmar Ebner,
Florian Brandner,
Bernhard Scholz,
Andreas Krall,
Peter Wiedermann,
Albrecht Kadlec:
Generalized instruction selection using SSA-graphs.
LCTES 2008: 31-40 |
| 2007 |
| 3 |  | Florian Brandner,
Dietmar Ebner,
Andreas Krall:
Compiler generation from structural architecture descriptions.
CASES 2007: 13-22 |
| 2 |  | Dietmar Ebner,
Florian Brandner,
Andreas Krall:
Leveraging Predicated Execution for Multimedia Processing.
ESTImedia 2007: 85-90 |
| 2006 |
| 1 |  | Stefan Farfeleder,
Andreas Krall,
Edwin Steiner,
Florian Brandner:
Effective compiler generation by architecture description.
LCTES 2006: 145-152 |