Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
Probabilistically Accurate Program Transformations
verfasst von : Sasa Misailovic, Daniel M. Roy, Martin C. Rinard
Erschienen in: Static Analysis
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.