Probabilistically Accurate Program Transformations

  • Sasa Misailovic
  • Daniel M. Roy
  • Martin C. Rinard
Conference paper

DOI: 10.1007/978-3-642-23702-7_24

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6887)
Cite this paper as:
Misailovic S., Roy D.M., Rinard M.C. (2011) Probabilistically Accurate Program Transformations. In: Yahav E. (eds) Static Analysis. SAS 2011. Lecture Notes in Computer Science, vol 6887. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Sasa Misailovic
    • 1
  • Daniel M. Roy
    • 1
  • Martin C. Rinard
    • 1
  1. 1.MIT CSAILUSA

Personalised recommendations