Constraint-Based Code Generation

Roberto Castañeda Lozano, Gabriel Hjort Blindell, Mats Carlsson, Frej Drejhammar, Christian Schulte

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Compiler back-ends generate assembly code by solving three main tasks: instruction selection, register allocation and instruction scheduling. We introduce constraint models and solving techniques for these code generation tasks and describe how the models can be composed to generate code in unison. The use of constraint programming, a technique to model and solve combinatorial problems, makes code generation simple, flexible, robust and potentially optimal.
Original languageEnglish
Title of host publicationProceedings of the 16th International Workshop on Software and Compilers for Embedded Systems
Place of PublicationNew York, NY, USA
PublisherAssociation for Computing Machinery, Inc
Pages93–95
Number of pages3
ISBN (Print)9781450321426
DOIs
Publication statusPublished - 19 Jun 2013
Event16th International Workshop on Software and Compilers for Embedded Systems - Schloss Rheinfels, St. Goar, Germany
Duration: 19 Jun 201321 Jun 2013
Conference number: 16
https://www.scopesconf.org/scopes-13/

Workshop

Workshop16th International Workshop on Software and Compilers for Embedded Systems
Abbreviated titleM-SCOPES 2013
Country/TerritoryGermany
CitySt. Goar
Period19/06/1321/06/13
Internet address

Keywords

  • instruction scheduling
  • register allocation
  • constraint programming
  • instruction selection

Fingerprint

Dive into the research topics of 'Constraint-Based Code Generation'. Together they form a unique fingerprint.

Cite this