Probabilistically Accurate Program Transformations
Name
Rinard_Probabilistically accurate.pdf
Size
254.86 KB
Format
Adobe PDF
Checksum (MD5)
c8acbf87ae00f36d8370085d1a1be437
Author(s)
Misailovic, Sasa
Roy, Daniel
Rinard, Martin C.
Date Issued
September 2011
Journal
Static Analysis
Publisher
Springer Berlin / Heidelberg
Citation
Misailovic, Sasa, Daniel M. Roy, and Martin C. Rinard. “Probabilistically Accurate Program Transformations.” Static Analysis. Ed. Eran Yahav. LNCS Vol. 6887. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. 316–333.
Version
Author's final manuscript
Abstract
The standard approach to program transformation involves the use of discrete logical reasoning to prove that the transformation does not change the observable semantics of the program. We propose a new approach that, in contrast, uses probabilistic reasoning to justify the application of transformations that may change, within probabilistic accuracy bounds, the result that the program produces.
Our new approach produces probabilistic guarantees of the form ℙ(|D| ≥ B) ≤ ε, ε ∈ (0, 1), where D is the difference between the results that the transformed and original programs produce, B is an acceptability bound on the absolute value of D, and ε is the maximum acceptable probability of observing large |D|. We show how to use our approach to justify the application of loop perforation (which transforms loops to execute fewer iterations) to a set of computational patterns.
Description
18th International Symposium, SAS 2011, Venice, Italy, September 14-16, 2011. Proceedings
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.1007/978-3-642-23702-7_24
