A Helpful Result for Proving Inherent Ambiguity. - William F. Ogden (Math. Syst. Theory, 1968)

Intercalation Theorems for Stack Languages - William F. Ogden (STOC, 1969)

Compositions of n Tree Transducers - William F. Ogden; William C. Rounds (STOC, 1972)

On the Complexity of the Circularity Test for Attribute Grammars. - Mehdi Jazayeri; William F. Ogden; William C. Rounds (POPL, 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 (Reliable Software, 1975)

The Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars. - Mehdi Jazayeri; William F. Ogden; William C. Rounds (Commun. ACM, 1975)

Complexity of Expressions Allowing Concurrency. - William F. Ogden; William E. Riddle; William C. Rounds (POPL, 1978)

Procedure semantics and language definition. - Franklyn T. Bradshaw; George W. Ernst; Raymond J. Hookway; William F. Ogden (ACM SIGPLAN Notices, 1980)

Specification of Abstract Data Types in Modula. - George W. Ernst; William F. Ogden (ACM Trans. Program. Lang. Syst., 1980)

Verification of Programs with Procedure-Type Parameter. - George W. Ernst; Jainendra K. Navlakha; William F. Ogden (Acta Informatica, 1982)

An "Interchange Lemma" for Context-Free Languages. - William F. Ogden; Rockford J. Ross; Karl Winklmann (SIAM J. Comput., 1985)

Reusable Software Components. - Bruce W. Weide; William F. Ogden; Stuart H. Zweben (Adv. Comput., 1991)

Modular Verification of Ada Generics. - George W. Ernst; Raymond J. Hookway; James A. Menegay; William F. Ogden (Comput. Lang., 1991)

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)

Recasting Algorithms to Encourage Reuse. - Bruce W. Weide; William F. Ogden; Murali Sitaraman (IEEE Softw., 1994)

Modular Verification of Data Abstractions with Shared Realizations. - George W. Ernst; Raymond J. Hookway; William F. Ogden (IEEE Trans. Software Eng., 1994)

Characterizing observability and controllability of software components. - Bruce W. Weide; Stephen H. Edwards; Wayne D. Heym; Timothy J. Long; William F. Ogden (ICSR, 1996)

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)

A Data Abstraction Alternative to Data Structure/Algorithm Modularization. - Murali Sitaraman; Bruce W. Weide; Timothy J. Long; William F. Ogden (Generic Programming, 1998)

Performance specification of software components. - Murali Sitaraman; Gregory Kulczycki; Joan Krone; William F. Ogden; A. L. Narasimha Reddy (SSR, 2001)

Performance analysis based upon complete profiles. - Joan Krone; William F. Ogden; Murali Sitaraman (SAVCBS@FSE, 2006)

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 (VSTTE, 2012)

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; et al. (ICSR, 2013)