Constraint-based code generation

Authors:
Roberto Castañeda Lozano;Gabriel Hjort Blindell;Mats Carlsson;Frej Drejhammar;Christian Schulte
Affiliations:
SICS (Swedish Institute of Computer Science), Sweden;KTH (School of ICT, KTH, Royal Institute of Technology), Sweden;SICS, Sweden;SICS, Sweden;KTH and SICS, Sweden
Venue:
Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems
Year:
2013

Citing 4
Cited 0

Pattern Matching in Trees

Journal of the ACM (JACM)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)

Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Register allocation by puzzle solving

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Constraint-Based register allocation and instruction scheduling

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

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.