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. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Crick, T., Brain, M., De Vos, M., & Fitch, J. (2009). Generating optimal code using answer set programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5753 LNAI, pp. 554–559). https://doi.org/10.1007/978-3-642-04238-6_57
Mendeley helps you to discover research relevant for your work.