Verified integrity properties for safe approximate program transformations
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 pro...
Main Authors: | Kim, Deokhwan, Misailovic, Sasa, Rinard, Martin C., Carbin, Michael James |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Association for Computing Machinery (ACM)
2014
|
Online Access: | http://hdl.handle.net/1721.1/90624 https://orcid.org/0000-0001-8195-4145 https://orcid.org/0000-0003-0313-9270 https://orcid.org/0000-0001-8095-8523 |
Similar Items
-
Proving acceptability properties of relaxed nondeterministic approximate programs
by: Carbin, Michael James, et al.
Published: (2012) -
Verifying Quantitative Reliability of Programs That Execute on Unreliable Hardware
by: Carbin, Michael, et al.
Published: (2013) -
Verifying quantitative reliability for programs that execute on unreliable hardware
by: Misailovic, Sasa, et al.
Published: (2015) -
Reasoning about Relaxed Programs
by: Carbin, Michael, et al.
Published: (2011) -
Parallelizing Sequential Programs With Statistical Accuracy Tests
by: Misailovic, Sasa, et al.
Published: (2010)