Research

Generating optimal code using answer set programming


Reference:

Crick, T., Brain, M., De Vos, M. and Fitch, J., 2009. Generating optimal code using answer set programming. In: Erdem, E., Fangzhen, L. and Schaub, T., eds. Logic Programming and Nonmonotonic Reasoning. Vol. 5753. Berlin, Germany: Springer, pp. 554-559. (Lecture Notes in Computer Science)

Related documents:

This repository does not currently have the full-text of this item.
You may be able to access a copy if URLs are provided below.

Official URL:

http://dx.doi.org/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 if 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 toolchanis.

Details

Item Type Book Sections
CreatorsCrick, T., Brain, M., De Vos, M. and Fitch, J.
EditorsErdem, E., Fangzhen, L. and Schaub, T.
DOI10.1007/978-3-642-04238-6_57
DepartmentsFaculty of Science > Computer Science
StatusPublished
ID Code16523

Export

Actions (login required)

View Item