#### Filter Results:

- Full text PDF available (8)

#### Publication Year

1984

1996

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Ron Cytron, Jeanne Ferrante, Barry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck
- ACM Trans. Program. Lang. Syst.
- 1991

In optimizing compilers, data structure choices directly influence the power and efficiency of practical program optimization. A poor choice of data structure can inhibit optimization or slow compilation to the point that advanced optimization features become undesirable. Recently, static single assignment form and the control dependence graph have been… (More)

- Bowen Alpern, Mark N. Wegman, F. Kenneth Zadeck
- POPL
- 1988

paper presents an algorithm for detecting when two computations produce equivalent values. The equivalence of programs, and hence the equivalence of values, is in general undecidable. Thus, the best one can hope to do is to give an efficient algorithm that detects a large subclass of all the possible equivalences in a program. Two variables are said to be… (More)

- David R. Chase, Mark N. Wegman, F. Kenneth Zadeck
- PLDI
- 1990

High-level languages could be optimized significantly if compilers could determine automatically how pointers and heap allocated structures are used. Setter knowledge of aliasing can improve classical optimizations applied to scalars (common sub-expression elimination, loop-invariant code motion, reduction in st.rength, constant propagation) by permitting… (More)

- Mark N. Wegman, F. Kenneth Zadeck
- POPL
- 1985

Constant propagation is a well-known global flow analysis problem. The goal of constant propagation is to discover values that are constant on all possible executions of a program and to propagate these constant values as far foward through the program as possible. Expressions whose operands are all constants can be evaluated at compile time and the results… (More)

In optimizing compilers, data structure choices directly in.fluence the power and efficiency of practical program optimization. A poor choice of data structure can inhibit optimization or slow compilation to the point where advanced optimization features become undesirable. Recently, static single assignment form [AWZSS, RWZSS] and the control dependence… (More)

The incremental circuit value problem arises in diverse interactive computational problems, including the semantic checking done by structure-based editors and such tasks as timing analysis performed by computeraided design systems. An efficient incremental algorithm for updating the values of gates in a circuit (after a change in circuit parameters and/or… (More)

- Barry K. Rosen, Mark N. Wegman, F. Kenneth Zadeck
- POPL
- 1988

Most previous redundancy elilmination algorithms have been of two kinds. The lexical algorithms deal with the entire program, but they can only detect redundancy among computations of lexicatlly identical expressions, where expressions are lexically identical if they apply exactly the same operator to exactly the same operands. The value numbering… (More)

Elimination of partial redundancies is a powerful optimization that has been implemented in at least three important production compilers and has inspired several simdar optimization. The global data ffow analysis that supports this family of optimization includes some bidirectional probJems. (A bidirectional problem is one in which the global inform ation… (More)

- F. Kenneth Zadeck
- SIGPLAN Symposium on Compiler Construction
- 1984

For many years, the generally accepted methods for solving global data flow analysis problems (GDFAPs) have relied on the <i>bit vector paradigm</i> [Alle 70] [Kenn 81]. In these algorithms, the information for each variable is represented as a position in a bit vector. These vectors are propagated from node to node during the analysis of the program.This… (More)

- Ron Cytron, Andy Lowry, F. Kenneth Zadeck
- POPL
- 1986

One trend among programmers is the increased use of abstractions. Through encapsulation techniques, abstractions extend the repertory of data structures and their concomitant operations that are processed directly by a compiler. For example, a compiler might not offer sets or set operations in its base language, but abstractions allow a programmer to define… (More)