Probabilistic Accuracy Bounds for Perforated Programs: A New Foundation for Program Analysis and Transformation
Name
Rinard_Probabilistic accuracy.pdf
Size
129.74 KB
Format
Adobe PDF
Checksum (MD5)
ec3f1af1342e57db23a842e7f52db235
Author(s)
Rinard, Martin C.
Date Issued
January 2011
Journal
Proceedings of the 20th ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation (PEPM '11)
Publisher
Association for Computing Machinery (ACM)
Citation
Martin Rinard. 2011. Probabilistic accuracy bounds for perforated programs: a new foundation for program analysis and transformation. In Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation (PEPM '11). ACM, New York, NY, USA, 79-80.
Version
Author's final manuscript
Abstract
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 faster encoding and smaller encoded videos [10]. Machine learning algorithms usually work with probabilistic models that capture some, but not all, aspects of phenomena that are difficult (if not impossible) to model with complete accuracy [2]. Monte-Carlo computations use random simulation to deliver inherently approximate solutions to complex systems of equations that are, in many cases, computationally infeasible to solve exactly [5].
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 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/1929501.1929517
