Generating optimal code using answer set programming

T Crick, M Brain, M De Vos, J Fitch

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)


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.
Original languageEnglish
Title of host publicationLogic Programming and Nonmonotonic Reasoning
EditorsE Erdem, L Fangzhen, T Schaub
Place of PublicationBerlin, Germany
Number of pages6
ISBN (Print)978-3-642-04237-9
Publication statusPublished - 2009
Event10th International Conference on Logic Programming and Nonmonotonic Reasoning - Potsdam, Germany
Duration: 14 Sep 200918 Sep 2009

Publication series

NameLecture Notes in Computer Science


Conference10th International Conference on Logic Programming and Nonmonotonic Reasoning
Abbreviated titleLPNMR (2009)

Fingerprint Dive into the research topics of 'Generating optimal code using answer set programming'. Together they form a unique fingerprint.

Cite this