AbstractThe “profitability” of code optimizations is defined in terms of a Markov model of program flow. A system of linear equations for the expected frequency of execution of blocks of a program is derived. A solution method which uses “Cocke-Allen interval” analysis is presented and extensions of this method to other global flow analysis problems are described
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...
Program analysis and optimization can be speeded up through the use of the dependence flow graph (DF...
. This paper describes a general purpose program analysis that computes global control-flow and data...
Quantitative program analysis involves computing numerical quantities about individual or col-lectio...
B Reconstructs a control flow graph from the binary. B Determines invariants for the values in regis...
AbstractSreedhar et al. [V.C. Sreedhar, G.R. Gao, Y.-F. Lee, A new framework for elimination-based d...
While software developers make every effort to develop correct, easily maintainable and efficient pr...
We focus on the halting probability and the number of instructions executed by programs that halt fo...
This paper presents the description of a possible way to build the universal linearized control flow...
In this paper we present an intermediate program representation, called the program dependence graph...
Many problems in program optimization have been solved by applying a technique called interval analy...
this report is to investigate the representation of algorithms as data flow graphs and the lineariza...
The iterative algorithm is widely used to solve instances of data-flow analysis problems. The algori...
Partial redundancy elimination is a common program optimization that attempts to improve execution t...
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...
Program analysis and optimization can be speeded up through the use of the dependence flow graph (DF...
. This paper describes a general purpose program analysis that computes global control-flow and data...
Quantitative program analysis involves computing numerical quantities about individual or col-lectio...
B Reconstructs a control flow graph from the binary. B Determines invariants for the values in regis...
AbstractSreedhar et al. [V.C. Sreedhar, G.R. Gao, Y.-F. Lee, A new framework for elimination-based d...
While software developers make every effort to develop correct, easily maintainable and efficient pr...
We focus on the halting probability and the number of instructions executed by programs that halt fo...
This paper presents the description of a possible way to build the universal linearized control flow...
In this paper we present an intermediate program representation, called the program dependence graph...
Many problems in program optimization have been solved by applying a technique called interval analy...
this report is to investigate the representation of algorithms as data flow graphs and the lineariza...
The iterative algorithm is widely used to solve instances of data-flow analysis problems. The algori...
Partial redundancy elimination is a common program optimization that attempts to improve execution t...
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...
Program analysis and optimization can be speeded up through the use of the dependence flow graph (DF...
DOI
Add to ORKG