Kalvala, Sara, Warburton, Richard and Lacey, David (2009) Program transformations using temporal logic side conditions. ACM Transactions on Programming Languages and Systems, Volume 31 (Number 4). Article number 14. doi:10.1145/1516507.1516509

Preview

PDF WRAP_Kalvala_cs-rr-439.pdf - Accepted Version - Requires a PDF viewer. Download (595Kb) | Preview

Request Changes to record.

Abstract

This paper describes an approach to program optimisation based on transformations, where temporal logic is used to specify side conditions, and strategies are created which expand the repertoire of transformations and provide a suitable level of abstraction. We demonstrate the power of this approach by developing a set of optimisations using our transformation language and showing how the transformations can be converted into a form which makes it easier to apply them, while maintaining trust in the resulting optimising steps. The approach is illustrated through a transformational case study where we apply several optimisations to a small program.

Item Type:	Journal Article
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Divisions:	Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH):	Optimizing compilers
Journal or Publication Title:	ACM Transactions on Programming Languages and Systems
Publisher:	Association for Computing Machinery
ISSN:	0164-0925
Official Date:	May 2009
Dates:	Date Event May 2009 Published
Volume:	Volume 31
Number:	Number 4
Number of Pages:	55
Article Number:	Article number 14
DOI:	10.1145/1516507.1516509
Status:	Peer Reviewed
Publication Status:	Published
Access rights to Published version:	Restricted or Subscription Access
Funder:	Engineering and Physical Sciences Research Council (EPSRC)
Grant number:	EP/DO32466/1 (EPSRC)

Data sourced from Thomson Reuters' Web of Knowledge

Request changes or add full text files to a record

Repository staff actions (login required)

View Item

Downloads