Journal article
Program transformations using temporal logic side conditions
ACM Transactions on Programming Languages and Systems, Vol.31(4)
2009
Abstract
This article describes an approach to program optimization 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 optimizations 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 optimizing steps. The approach is illustrated through a transformational case study where we apply several optimizations to a small program.
Details
- Title
- Program transformations using temporal logic side conditions
- Authors
- S Kalvala (Author) - University of Warwick, United KingdomR Warburton (Author) - University of Warwick, United KingdomDavid Lacey (Author) - XMOS Semiconductor, United Kingdom
- Publication details
- ACM Transactions on Programming Languages and Systems, Vol.31(4); 48
- Publisher
- A C M Special Interest Group
- Date published
- 2009
- DOI
- 10.1145/1516507.1516509
- ISSN
- 0164-0925
- Copyright note
- Copyright © ACM, 2009. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACM Transactions on Programming Languages and Systems, {VOL 31, ISS 4, (2009)} http://doi.acm.org/10.1145/1516507.1516509
- Organisation Unit
- Cyber Institute; University of the Sunshine Coast, Queensland
- Language
- English
- Record Identifier
- 99449245402621
- Output Type
- Journal article
Metrics
21 File views/ downloads
515 Record Views
InCites Highlights
These are selected metrics from InCites Benchmarking & Analytics tool, related to this output
- Web Of Science research areas
- Computer Science, Software Engineering