William F. Ogden

According to our database, William F. Ogden authored at least 23 papers between 1968 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

A Language for Building Verified Software Components.

Gregory Kulczycki, Murali Sitaraman, Joan Krone, Joseph E. Hollingsworth, William F. Ogden, Bruce W. Weide, Paolo Bucci, Charles T. Cook, Svetlana Drachova-Strang, Blair Durkee, Heather K. Harton, Wayne D. Heym, Dustin Hoffman, Hampton Smith, Yu-Shan Sun, Aditi Tagore, Nighat Yasmin, Diego Zaccai

Proceedings of the Safe and Secure Software Reuse, 2013

2012

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

Gregory Kulczycki, Hampton Smith, Heather K. Harton, Murali Sitaraman, William F. Ogden, Joseph E. Hollingsworth

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

2006

Performance analysis based upon complete profiles.

Joan Krone, William F. Ogden, Murali Sitaraman

Proceedings of the 2006 Conference on Specification and Verification of Component-Based Systems, 2006

2001

Performance specification of software components.

Murali Sitaraman, Gregory Kulczycki, Joan Krone, William F. Ogden, A. L. Narasimha Reddy

Proceedings of the ACM SIGSOFT Symposium on Software Reusability: Putting Software Reuse in Context, 2001

1998

A Data Abstraction Alternative to Data Structure/Algorithm Modularization.

Murali Sitaraman, Bruce W. Weide, Timothy J. Long, William F. Ogden

Proceedings of the Generic Programming, 1998

1997

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

Murali Sitaraman, Bruce W. Weide, William F. Ogden

IEEE Trans. Software Eng., 1997

1996

Characterizing observability and controllability of software components.

Bruce W. Weide, Stephen H. Edwards, Wayne D. Heym, Timothy J. Long, William F. Ogden

Proceedings of Fourth IEEE International Conference on Software Reuse, 1996

1994

Modular Verification of Data Abstractions with Shared Realizations.

George W. Ernst, Raymond J. Hookway, William F. Ogden

IEEE Trans. Software Eng., 1994

Recasting Algorithms to Encourage Reuse.

Bruce W. Weide, William F. Ogden, Murali Sitaraman

IEEE Softw., 1994

Part I: the RESOLVE framework and discipline: a research synopsis.

William F. Ogden, Murali Sitaraman, Bruce W. Weide, Stuart H. Zweben

ACM SIGSOFT Softw. Eng. Notes, 1994

1991

Modular Verification of Ada Generics.

George W. Ernst, Raymond J. Hookway, James A. Menegay, William F. Ogden

Comput. Lang., 1991

Reusable Software Components.

Bruce W. Weide, William F. Ogden, Stuart H. Zweben

Adv. Comput., 1991

1985

An "Interchange Lemma" for Context-Free Languages.

William F. Ogden, Rockford J. Ross, Karl Winklmann

SIAM J. Comput., 1985

1982

Verification of Programs with Procedure-Type Parameter.

George W. Ernst, Jainendra K. Navlakha, William F. Ogden

Acta Informatica, 1982

1980

Specification of Abstract Data Types in Modula.

George W. Ernst, William F. Ogden

ACM Trans. Program. Lang. Syst., 1980

Procedure semantics and language definition.

Franklyn T. Bradshaw, George W. Ernst, Raymond J. Hookway, William F. Ogden

ACM SIGPLAN Notices, 1980

1978

Complexity of Expressions Allowing Concurrency.

William F. Ogden, William E. Riddle, William C. Rounds

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.

Mehdi Jazayeri, William F. Ogden, William C. Rounds

Commun. ACM, 1975

Structured specification of a Security Kernel.

Kenneth G. Walter, Samuel I. Schaen, William F. Ogden, William C. Rounds, D. G. Shumway, D. D. Schaeffer, K. J. Biba, Franklyn T. Bradshaw, S. R. Ames, J. M. Gilligan

Proceedings of the International Conference on Reliable Software 1975, 1975

On the Complexity of the Circularity Test for Attribute Grammars.

Mehdi Jazayeri, William F. Ogden, William C. Rounds

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

1972

Compositions of n Tree Transducers

William F. Ogden, William C. Rounds

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

1969

Intercalation Theorems for Stack Languages

William F. Ogden

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

1968

A Helpful Result for Proving Inherent Ambiguity.

William F. Ogden

Math. Syst. Theory, 1968