Probabilistic data flow analysis: a linear equational approach
Speculative optimisation relies on the estimation of the probabilities that certain properties of the control flow are fulfilled. Concrete or estimated branch probabilities can be used for searching and constructing advantageous speculative and bookkeeping transformations. We present a probabilistic...
Saved in:
Published in | Electronic proceedings in theoretical computer science Vol. 119; no. Proc. GandALF 2013; pp. 150 - 165 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Open Publishing Association
16.07.2013
|
Online Access | Get full text |
Cover
Loading…
Summary: | Speculative optimisation relies on the estimation of the probabilities that certain properties of the control flow are fulfilled. Concrete or estimated branch probabilities can be used for searching and constructing advantageous speculative and bookkeeping transformations. We present a probabilistic extension of the classical equational approach to data-flow analysis that can be used to this purpose. More precisely, we show how the probabilistic information introduced in a control flow graph by branch prediction can be used to extract a system of linear equations from a program and present a method for calculating correct (numerical) solutions. |
---|---|
ISSN: | 2075-2180 2075-2180 |
DOI: | 10.4204/EPTCS.119.14 |