Show simple item record

Verified integrity properties for safe approximate program transformations

dc.contributor.authorKim, Deokhwan
dc.contributor.authorMisailovic, Sasa
dc.contributor.authorRinard, Martin C.
dc.contributor.authorCarbin, Michael James
dc.date.accessioned2014-10-08T14:21:24Z
dc.date.available2014-10-08T14:21:24Z
dc.date.issued2013-01
dc.identifier.isbn9781450318426
dc.identifier.urihttp://hdl.handle.net/1721.1/90624
dc.description.abstractApproximate 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.en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CCF-0811397)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CCF-0905244)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CCF-1036241)en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant IIS-0835652)en_US
dc.description.sponsorshipUnited States. Defense Advanced Research Projects Agency (Grant FA8650-11-C-7192)en_US
dc.description.sponsorshipUnited States. Defense Advanced Research Projects Agency (Grant FA8750-12-2-0110)en_US
dc.description.sponsorshipUnited States. Dept. of Energy (Grant DE-SC0005288)en_US
dc.language.isoen_US
dc.publisherAssociation for Computing Machinery (ACM)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1145/2426890.2426901en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourceMIT web domainen_US
dc.titleVerified integrity properties for safe approximate program transformationsen_US
dc.typeArticleen_US
dc.identifier.citationMichael 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.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.mitauthorCarbin, Michael Jamesen_US
dc.contributor.mitauthorKim, Deokhwanen_US
dc.contributor.mitauthorMisailovic, Sasaen_US
dc.contributor.mitauthorRinard, Martin C.en_US
dc.relation.journalProceedings of the ACM SIGPLAN 2013 workshop on Partial evaluation and program manipulation (PEPM '13)en_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dspace.orderedauthorsCarbin, Michael; Kim, Deokhwan; Misailovic, Sasa; Rinard, Martin C.en_US
dc.identifier.orcidhttps://orcid.org/0000-0001-8195-4145
dc.identifier.orcidhttps://orcid.org/0000-0003-0313-9270
dc.identifier.orcidhttps://orcid.org/0000-0001-8095-8523
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail
Name:
Rinard_Verified integrity.pdf
Size:
178.4Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record