Show simple item record

dc.contributor.authorCrick, Tom
dc.contributor.authorBrain, Martin
dc.contributor.authorDe Vos, Marina
dc.contributor.authorFitch, John
dc.date.accessioned2010-12-07T11:46:07Z
dc.date.available2010-12-07T11:46:07Z
dc.date.issued2009
dc.identifier.citationCrick, T., Brain, M., De Vos, M. and Fitch, J. (2009) 'Generating optimal code using answer set programming', Logic Programming and Nonmonotonic Reasoning: 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18. Proceedings. Berlin Heidelberg: Springer, pp. 554-559
dc.identifier.isbn9783642042379
dc.identifier.isbn9783642042386
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/10369/1008
dc.descriptionFull text not available from this repository.en_GB
dc.description.abstractThis 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.en_GB
dc.language.isoenen_GB
dc.publisherSpringeren_GB
dc.relation.ispartofseriesLecture Notes in Computer Science; 5753
dc.titleGenerating Optimal Code Using Answer Set Programmingen_GB
dc.typeConference proceedingsen_GB
dc.identifier.doihttp://dx.doi.org/10.1007/978-3-642-04238-6_57
dc.publisher.departmentCardiff School of Managementen_UK


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following collection(s)

Show simple item record