In this paper a model of a program, in which loops are graph cycles, is given. From that model, a particular estimate of the number of loops passing through any program statement is derived. The method of obtaining a graph, whose paths are equivalent to program loops, is described. In the final section, the places at which the program should be divided into sections are given
Abstract:- Program slicing is the task of finding all statements in a program that directly, or indi...
AbstractThe “profitability” of code optimizations is defined in terms of a Markov model of program f...
In this paper we present an intermediate program representation, called the program dependence graph...
In this paper a model of a program, in which loops are graph cycles, is given. From that model, a pa...
It has been shown that the cycle picture of the directed graph of a computer program can be used to ...
A graph-theoretic model for the description of flowcharts and programs is defined. It is shown that ...
This paper presents some basic techniques for representation and analysis of software. We use the te...
An algebraic method is presented for assessing the numbers of paths through loop-free portions of co...
This thesis describes a symbolic execution system, PAN, that is able to symbolically execute loops. ...
Loop distribution is an integral part of transforming a sequential program into a parallel one. It i...
Program dependence graphs were introduced by Kuck as an intermediate program representation well sui...
AbstractAny directed graph, even a flow graph representing “spaghetti code”, is shown here to have a...
Abstract. Loop identification is an essential step of control flow analysis in decompilation. The Cl...
This paper describes a method for deriving logic programs from observations that can be made of the ...
Although there are many algorithms to draw hierarchical structures such as directed graphs and trees...
Abstract:- Program slicing is the task of finding all statements in a program that directly, or indi...
AbstractThe “profitability” of code optimizations is defined in terms of a Markov model of program f...
In this paper we present an intermediate program representation, called the program dependence graph...
In this paper a model of a program, in which loops are graph cycles, is given. From that model, a pa...
It has been shown that the cycle picture of the directed graph of a computer program can be used to ...
A graph-theoretic model for the description of flowcharts and programs is defined. It is shown that ...
This paper presents some basic techniques for representation and analysis of software. We use the te...
An algebraic method is presented for assessing the numbers of paths through loop-free portions of co...
This thesis describes a symbolic execution system, PAN, that is able to symbolically execute loops. ...
Loop distribution is an integral part of transforming a sequential program into a parallel one. It i...
Program dependence graphs were introduced by Kuck as an intermediate program representation well sui...
AbstractAny directed graph, even a flow graph representing “spaghetti code”, is shown here to have a...
Abstract. Loop identification is an essential step of control flow analysis in decompilation. The Cl...
This paper describes a method for deriving logic programs from observations that can be made of the ...
Although there are many algorithms to draw hierarchical structures such as directed graphs and trees...
Abstract:- Program slicing is the task of finding all statements in a program that directly, or indi...
AbstractThe “profitability” of code optimizations is defined in terms of a Markov model of program f...
In this paper we present an intermediate program representation, called the program dependence graph...
DOI
Add to ORKG