Constraint-based Code Generation
2013 (English)In: Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems, M-SCOPES 2013, Association for Computing Machinery (ACM), 2013, 93-95 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
Association for Computing Machinery (ACM), 2013. 93-95 p.
Constraint programming, Instruction scheduling, Instruction selection, Register allocation
IdentifiersURN: urn:nbn:se:kth:diva-125069DOI: 10.1145/2463596.2486155ScopusID: 2-s2.0-84893342426ISBN: 978-1-4503-2142-6OAI: oai:DiVA.org:kth-125069DiVA: diva2:639391
16th International Workshop on Software and Compilers for Embedded Systems, M-SCOPES 2013; St. Goar; Germany; 19 June 2013 through 21 June 2013
QC 201403172013-08-072013-08-072014-03-17Bibliographically approved