Probabilistic Accuracy Bounds for Perforated Programs: A New Foundation for Program Analysis and Transformation
Traditional program transformations operate under the onerous constraint that they must preserve the exact behavior of the transformed program. But many programs are designed to produce approximate results. Lossy video encoders, for example, are designed to give up perfect fidelity in return for fas...
Main Author: | Rinard, Martin C. (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM),
2012-08-29T20:20:03Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Probabilistically Accurate Program Transformations
by: Misailovic, Sasa, et al.
Published: (2012) -
Randomized accuracy-aware program transformations for efficient approximate computations
by: Misailovic, Sasa, et al.
Published: (2012) -
Probabilistic programming with programmable inference
by: Mansinghka, Vikash K., et al.
Published: (2021) -
SPPL: probabilistic programming with fast exact symbolic inference
by: Saad, Feras A, et al.
Published: (2022) -
Parallelizing Sequential Programs with Statistical Accuracy Tests
by: Misailovic, Sasa, et al.
Published: (2015)