Verified integrity properties for safe approximate program transformations
Name
Rinard_Verified integrity.pdf
Size
178.44 KB
Format
Adobe PDF
Checksum (MD5)
28cd5b5656126251b3d63122a3478675
Author(s) • • •
Kim, Deokhwan
Misailovic, Sasa
Rinard, Martin C.
Carbin, Michael James
Date Issued
January 2013
Journal
Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation (PEPM '13)
Publisher
Association for Computing Machinery (ACM)
Citation
Michael Carbin, Deokhwan Kim, Sasa Misailovic, and Martin C. Rinard. 2013. Verified integrity properties for safe approximate program transformations. In Proceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation (PEPM '13). ACM, New York, NY, USA, 63-66.
Version
Author's final manuscript
Abstract
Approximate computations (for example, video, audio, and image processing, machine learning, and many scientific computations) have the freedom to generate a range of acceptable results. Approximate program transformations (for example, task skipping and loop perforation) exploit this freedom to produce computations that can execute at a variety of points in an underlying accuracy versus performance trade-off space. One potential concern is that these transformations may change the semantics of the program and therefore cause the program to crash, perform an illegal operation, or otherwise violate its integrity.
We investigate how verifying integrity properties -- key correctness properties that the transformed computation must respect -- can enable the safe application of approximate program transformations. We present experimental results from a compiler that verifies integrity properties of perforated loops to enable the safe application of loop perforation.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/2426890.2426901