Generating Optimal Code Using Answer Set Programming

Authors:
Tom Crick;Martin Brain;Marina Vos;John Fitch
Affiliations:
Department of Computer Science, University of Bath, Bath, UK BA2 7AY;Department of Computer Science, University of Bath, Bath, UK BA2 7AY;Department of Computer Science, University of Bath, Bath, UK BA2 7AY;Department of Computer Science, University of Bath, Bath, UK BA2 7AY
Venue:
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Year:
2009

Citing 9
Cited 0

Superoptimizer: a look at the smallest program

ASPLOS II Proceedings of the second international conference on Architectual support for programming languages and operating systems
The SPARC architecture manual: version 8

The SPARC architecture manual: version 8
Eliminating branches using a superoptimizer and the GNU C compiler

PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
Denali: a goal-directed superoptimizer

PLDI '02 Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation
Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
Automatic generation of peephole superoptimizers

Proceedings of the 12th international conference on Architectural support for programming languages and operating systems
Compilers: Principles, Techniques, and Tools (2nd Edition)

Compilers: Principles, Techniques, and Tools (2nd Edition)
Compiler research: the next 50 years

Communications of the ACM - Inspiring Women in Computing
TOAST: applying answer set programming to superoptimisation

ICLP'06 Proceedings of the 22nd international conference on Logic Programming

Quantified Score

Hi-index	0.00

Visualization

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 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.