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
To attain peak efficiency, high performance processors must anticipate changes in the flow of contro...
Probabilistic databases are motivated by a large and diverse set of applications that need to query ...
We present a formal framework for syntax directed probabilistic program analysis. Our focus is on pr...
We present a semantics-based technique for analysing probabilistic properties of imperative programs...
AbstractWe present a semantics-based technique for analysing probabilistic properties of imperative ...
This paper provides a survey of recent work on adapting techniques for program analysis to compute p...
In this paper, we introduce a new branch predictor that predicts the outcome of branches by predicti...
In this paper we present a new approach to data analysis based on flow distribution study in a flow ...
In this paper we start by reviewing both classical and probabilistic/quantitative approaches to prog...
The increasing uncertainties grid operator have to face in their every-day work lead to the necessit...
Abstract. In this paper we introduce a new kind of flow networks, called flow graphs, different to t...
Of all software development activities, debugging---locating the defective source code statements th...
AbstractThe “profitability” of code optimizations is defined in terms of a Markov model of program f...
Abstract. We consider association of decision trees and flow graphs, resulting in a new method of de...
AbstractIn 1913 Jan Łukasiewicz proposed to use logic as mathematical foundations of probability. He...
To attain peak efficiency, high performance processors must anticipate changes in the flow of contro...
Probabilistic databases are motivated by a large and diverse set of applications that need to query ...
We present a formal framework for syntax directed probabilistic program analysis. Our focus is on pr...
We present a semantics-based technique for analysing probabilistic properties of imperative programs...
AbstractWe present a semantics-based technique for analysing probabilistic properties of imperative ...
This paper provides a survey of recent work on adapting techniques for program analysis to compute p...
In this paper, we introduce a new branch predictor that predicts the outcome of branches by predicti...
In this paper we present a new approach to data analysis based on flow distribution study in a flow ...
In this paper we start by reviewing both classical and probabilistic/quantitative approaches to prog...
The increasing uncertainties grid operator have to face in their every-day work lead to the necessit...
Abstract. In this paper we introduce a new kind of flow networks, called flow graphs, different to t...
Of all software development activities, debugging---locating the defective source code statements th...
AbstractThe “profitability” of code optimizations is defined in terms of a Markov model of program f...
Abstract. We consider association of decision trees and flow graphs, resulting in a new method of de...
AbstractIn 1913 Jan Łukasiewicz proposed to use logic as mathematical foundations of probability. He...
To attain peak efficiency, high performance processors must anticipate changes in the flow of contro...
Probabilistic databases are motivated by a large and diverse set of applications that need to query ...
We present a formal framework for syntax directed probabilistic program analysis. Our focus is on pr...