| 1983 |
|---|
| 15 | EE | Derek C. Oppen,
Yogen K. Dalal:
The Clearinghouse: A Decentralized Agent for Locating Named Objects in a Distributed Environment.
ACM Trans. Inf. Syst. 1(3): 230-253 (1983) |
| 1981 |
|---|
| 14 | | Robert Cartwright,
Derek C. Oppen:
The Logic of Aliasing.
Acta Inf. 15: 365-384 (1981) |
| 1980 |
|---|
| 13 | EE | Derek C. Oppen:
Prettyprinting.
ACM Trans. Program. Lang. Syst. 2(4): 465-483 (1980) |
| 12 | EE | Greg Nelson,
Derek C. Oppen:
Fast Decision Procedures Based on Congruence Closure.
J. ACM 27(2): 356-364 (1980) |
| 11 | EE | Derek C. Oppen:
Reasoning About Recursively Defined Data Structures.
J. ACM 27(3): 403-411 (1980) |
| 10 | | Derek C. Oppen:
Complexity, Convexity and Combinations of Theories.
Theor. Comput. Sci. 12: 291-302 (1980) |
| 1979 |
|---|
| 9 | EE | Greg Nelson,
Derek C. Oppen:
Simplification by Cooperating Decision Procedures.
ACM Trans. Program. Lang. Syst. 1(2): 245-257 (1979) |
| 1978 |
|---|
| 8 | | Robert Cartwright,
Derek C. Oppen:
Unrestricted Procedure Calls in Hoare's Logic.
POPL 1978: 131-140 |
| 7 | | Charles G. Nelson,
Derek C. Oppen:
A Simplifier Based on Efficient Decision Algorithms.
POPL 1978: 141-150 |
| 6 | | Derek C. Oppen:
Reasoning about Recursively Defined Data Structures.
POPL 1978: 151-157 |
| 5 | | Derek C. Oppen:
A 2^2^2^pn Upper Bound on the Complexity of Presburger Arithmetic.
J. Comput. Syst. Sci. 16(3): 323-332 (1978) |
| 1977 |
|---|
| 4 | | Greg Nelson,
Derek C. Oppen:
Fast Decision Algorithms Based on Union and Find
FOCS 1977: 114-119 |
| 1975 |
|---|
| 3 | | Stephen A. Cook,
Derek C. Oppen:
An Assertion Language for Data Structures.
POPL 1975: 160-166 |
| 2 | | Derek C. Oppen,
Stephen A. Cook:
Proving Assertions about Programs that Manipulate Data Structures
STOC 1975: 107-116 |
| 1973 |
|---|
| 1 | | Derek C. Oppen:
Elementary Bounds for Presburger Arithmetic
STOC 1973: 34-37 |
