Book chapter 856 views 238 downloads
Generating Optimal Code Using Answer Set Programming
Tom Crick 
,
Martin Brain,
Marina De Vos,
John Fitch
,
Martin Brain,
Marina De Vos,
John Fitch
Logic Programming and Nonmonotonic Reasoning, Volume: 5753, Pages: 554 - 559
Swansea University Author:
Tom Crick
-
PDF | Accepted Manuscript
Download (123.67KB)
DOI (Published version): 10.1007/978-3-642-04238-6_57
Abstract
This paper presents the Total Optimisation using Answer Set Technology (TOAST) system, which can be used to generate optimal code sequences for machine architectures via a technique known as superoptimisation. Answer set programming (ASP) is utilised as the modelling and computational framework for...
| Published in: | Logic Programming and Nonmonotonic Reasoning |
|---|---|
| ISBN: | 978-3-642-04237-9 978-3-642-04238-6 |
| ISSN: | 0302-9743 1611-3349 |
| Published: |
Potsdam, Germany
Springer
2009
|
| Online Access: |
Check full text
|
| URI: | https://cronfa.swan.ac.uk/Record/cronfa43399 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract: |
This paper presents the Total Optimisation using Answer Set Technology (TOAST) system, which can be used to generate optimal code sequences for machine architectures via a technique known as superoptimisation. Answer set programming (ASP) is utilised as the modelling and computational framework for searching over the large, complex search spaces and for proving the functional equivalence of two code sequences. Experimental results are given showing the progress made in solver performance over the previous few years, along with an outline of future developments to the system and applications within compiler toolchains. |
|---|---|
| Item Description: |
10th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2009) |
| College: |
Faculty of Humanities and Social Sciences |
| Start Page: |
554 |
| End Page: |
559 |