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.
|Name||Lecture Notes in Computer Science|
|Conference||10th International Conference on Logic Programming and Nonmonotonic Reasoning|
|Abbreviated title||LPNMR (2009)|
|Period||14/09/09 → 18/09/09|