Interprocedural type propagation for object-oriented languages (Q1330437): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0167-6423(94)00006-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1521096140 / rank | |||
Normal rank |
Latest revision as of 03:26, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Interprocedural type propagation for object-oriented languages |
scientific article |
Statements
Interprocedural type propagation for object-oriented languages (English)
0 references
21 July 1994
0 references
This paper proposes an efficient method for interprocedural object- oriented type propagation which supports recursion, side-effects and aliasing. It is based on the solution of standard bit-vector data flow problems and a novel form of symbolic interpretation. The general idea consists in building a set of edges for each function, representing these edges as reduction rules that replace a variable occurrence by the join of its reaching definitions, and removing circularities from the resulting system, so that a symbolic expression for any variable occurrence can be obtained by deriving a normal form in a finite number of step. The analysis of the interprocedural propagation algorithm is carried out on symbolic interpretation, on fixed-point computation of graphs for type methods. Author discuss side-effects and aliasing, applicability to type- checking, complexity, applications of the symbolic scheme to other optimization and data flow analysis problems, and comparison with related works.
0 references
object-oriented languages
0 references
graph of type
0 references
interprocedural object-oriented type propagation
0 references
optimization
0 references
data flow analysis
0 references