# William F. Ogden

According to our database

^{1}, William F. Ogden## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2013

A Language for Building Verified Software Components.

Proceedings of the Safe and Secure Software Reuse, 2013

2012

The Location Linking Concept: A Basis for Verification of Code Using Pointers.

Proceedings of the Verified Software: Theories, Tools, Experiments, 2012

2001

Performance specification of software components.

SSR, 2001

1998

A Data Abstraction Alternative to Data Structure/Algorithm Modularization.

Proceedings of the Generic Programming, 1998

1997

On the Practical Need for Abstraction Relations to Verify Abstract Data Type Representations.

IEEE Trans. Software Eng., 1997

1996

Characterizing observability and controllability of software components.

Proceedings of Fourth IEEE International Conference on Software Reuse, 1996

1994

Modular Verification of Data Abstractions with Shared Realizations.

IEEE Trans. Software Eng., 1994

Recasting Algorithms to Encourage Reuse.

IEEE Software, 1994

1991

Modular Verification of Ada Generics.

Comput. Lang., 1991

Reusable Software Components.

Advances in Computers, 1991

1985

An "Interchange Lemma" for Context-Free Languages.

SIAM J. Comput., 1985

1982

Verification of Programs with Procedure-Type Parameter.

Acta Inf., 1982

1980

Specification of Abstract Data Types in Modula.

ACM Trans. Program. Lang. Syst., 1980

1978

Complexity of Expressions Allowing Concurrency.

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

1975

The Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars.

Commun. ACM, 1975

On the Complexity of the Circularity Test for Attribute Grammars.

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

1972

Compositions of n Tree Transducers

Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

1969

Intercalation Theorems for Stack Languages

Proceedings of the 1st Annual ACM Symposium on Theory of Computing, 1969

1968

A Helpful Result for Proving Inherent Ambiguity.

Mathematical Systems Theory, 1968