# Derek C. Oppen

According to our database

Collaborative distances:

^{1}, Derek C. Oppen authored at least 14 papers between 1973 and 1983.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

1983

The Clearinghouse: A Decentralized Agent for Locating Named Objects in a Distributed Environment.

ACM Trans. Inf. Syst., 1983

1981

The Logic of Aliasing.

Acta Inf., 1981

1980

Prettyprinting.

ACM Trans. Program. Lang. Syst., 1980

Complexity, Convexity and Combinations of Theories.

Theor. Comput. Sci., 1980

Fast Decision Procedures Based on Congruence Closure.

J. ACM, 1980

1979

Simplification by Cooperating Decision Procedures.

ACM Trans. Program. Lang. Syst., 1979

1978

A 2^2^2^pn Upper Bound on the Complexity of Presburger Arithmetic.

J. Comput. Syst. Sci., 1978

Reasoning about Recursively Defined Data Structures.

Proceedings of the Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, 1978

A Simplifier Based on Efficient Decision Algorithms.

Proceedings of the Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, 1978

Unrestricted Procedure Calls in Hoare's Logic.

Proceedings of the Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, 1978

1977

Fast Decision Algorithms Based on Union and Find

Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977

1975

Proving Assertions about Programs that Manipulate Data Structures

Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

An Assertion Language for Data Structures.

Proceedings of the Conference Record of the Second ACM Symposium on Principles of Programming Languages, 1975

1973

Elementary Bounds for Presburger Arithmetic

Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30, 1973