Generating optimal code using answer set programming

Tom Crick; Martin Brain; Marina De Vos; John Fitch

doi:10.1007/978-3-642-04238-6_57

Generating optimal code using answer set programming

Tom Crick^*, Martin Brain, Marina De Vos, John Fitch

^*Corresponding author for this work

School of Education

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

2 Citations (Scopus)

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.

Original language	English
Title of host publication	Logic Programming and Nonmonotonic Reasoning - 10th International Conference, LPNMR 2009, Proceedings
Pages	554-559
Number of pages	6
DOIs	https://doi.org/10.1007/978-3-642-04238-6_57
Publication status	Published - 2009
Event	10th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2009 - Potsdam, Germany Duration: 14 Sept 2009 → 18 Sept 2009

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5753 LNAI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	10th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2009
Country/Territory	Germany
City	Potsdam
Period	14/09/09 → 18/09/09

Access to Document

10.1007/978-3-642-04238-6_57

Handle.net

Persistent link

Cite this

Crick, T., Brain, M., De Vos, M., & Fitch, J. (2009). Generating optimal code using answer set programming. In Logic Programming and Nonmonotonic Reasoning - 10th International Conference, LPNMR 2009, Proceedings (pp. 554-559). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5753 LNAI). https://doi.org/10.1007/978-3-642-04238-6_57

@inproceedings{907ba9645fab4a03b4b45100ed4b328a,

title = "Generating optimal code using answer set programming",

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

author = "Tom Crick and Martin Brain and \{De Vos\}, Marina and John Fitch",

year = "2009",

doi = "10.1007/978-3-642-04238-6\_57",

language = "English",

isbn = "3642042376",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "554--559",

booktitle = "Logic Programming and Nonmonotonic Reasoning - 10th International Conference, LPNMR 2009, Proceedings",

note = "10th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2009 ; Conference date: 14-09-2009 Through 18-09-2009",

}

Crick, T, Brain, M, De Vos, M & Fitch, J 2009, Generating optimal code using answer set programming. in Logic Programming and Nonmonotonic Reasoning - 10th International Conference, LPNMR 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5753 LNAI, pp. 554-559, 10th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2009, Potsdam, Germany, 14/09/09. https://doi.org/10.1007/978-3-642-04238-6_57

Generating optimal code using answer set programming. / Crick, Tom; Brain, Martin; De Vos, Marina et al.
Logic Programming and Nonmonotonic Reasoning - 10th International Conference, LPNMR 2009, Proceedings. 2009. p. 554-559 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5753 LNAI).

Research output: Chapter in Book/Report/Conference proceeding › Conference Contribution (Conference Proceeding)

TY - GEN

T1 - Generating optimal code using answer set programming

AU - Crick, Tom

AU - Brain, Martin

AU - De Vos, Marina

AU - Fitch, John

PY - 2009

Y1 - 2009

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

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

UR - https://www.scopus.com/pages/publications/70349852766

U2 - 10.1007/978-3-642-04238-6_57

DO - 10.1007/978-3-642-04238-6_57

M3 - Conference Contribution (Conference Proceeding)

AN - SCOPUS:70349852766

SN - 3642042376

SN - 9783642042379

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 554

EP - 559

BT - Logic Programming and Nonmonotonic Reasoning - 10th International Conference, LPNMR 2009, Proceedings

T2 - 10th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2009

Y2 - 14 September 2009 through 18 September 2009

ER -

Crick T, Brain M, De Vos M, Fitch J. Generating optimal code using answer set programming. In Logic Programming and Nonmonotonic Reasoning - 10th International Conference, LPNMR 2009, Proceedings. 2009. p. 554-559. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-04238-6_57

Generating optimal code using answer set programming

Abstract

Publication series

Conference

Access to Document

Handle.net

Other files and links

Fingerprint

Cite this