基于约束的代码生成

M-SCOPES Pub Date : 2013-06-19 DOI:10.1145/2463596.2486155

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

{"title":"基于约束的代码生成","authors":"Roberto Castañeda Lozano, Gabriel Hjort Blindell, M. Carlsson, Frej Drejhammar, Christian Schulte","doi":"10.1145/2463596.2486155","DOIUrl":null,"url":null,"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.","PeriodicalId":344517,"journal":{"name":"M-SCOPES","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Constraint-based code generation\",\"authors\":\"Roberto Castañeda Lozano, Gabriel Hjort Blindell, M. Carlsson, Frej Drejhammar, Christian Schulte\",\"doi\":\"10.1145/2463596.2486155\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":344517,\"journal\":{\"name\":\"M-SCOPES\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"M-SCOPES\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2463596.2486155\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"M-SCOPES","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2463596.2486155","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

编译器后端通过解决三个主要任务来生成汇编代码:指令选择、寄存器分配和指令调度。我们为这些代码生成任务引入了约束模型和求解技术，并描述了如何将这些模型组合起来以一致地生成代码。约束编程是一种建模和解决组合问题的技术，它的使用使代码生成变得简单、灵活、健壮并且可能是最优的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Constraint-based code generation

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

M-SCOPES

自引率

0.00%

发文量