2001 |
16 | EE | Murali Sitaraman,
Gregory Kulczycki,
Joan Krone,
William F. Ogden,
A. L. Narasimha Reddy:
Performance specification of software components.
SSR 2001: 3-10 |
1998 |
15 | EE | Murali Sitaraman,
Bruce W. Weide,
Timothy J. Long,
William F. Ogden:
A Data Abstraction Alternative to Data Structure/Algorithm Modularization.
Generic Programming 1998: 102-113 |
1997 |
14 | EE | Murali Sitaraman,
Bruce W. Weide,
William F. Ogden:
On the Practical Need for Abstraction Relations to Verify Abstract Data Type Representations.
IEEE Trans. Software Eng. 23(3): 157-170 (1997) |
1994 |
13 | EE | Bruce W. Weide,
William F. Ogden,
Murali Sitaraman:
Recasting Algorithms to Encourage Reuse.
IEEE Software 11(5): 80-88 (1994) |
12 | EE | George W. Ernst,
Raymond J. Hookway,
William F. Ogden:
Modular Verification of Data Abstractions with Shared Realizations.
IEEE Trans. Software Eng. 20(4): 288-307 (1994) |
1991 |
11 | | Bruce W. Weide,
William F. Ogden,
Stuart H. Zweben:
Reusable Software Components.
Advances in Computers 33: 1-65 (1991) |
10 | | George W. Ernst,
Raymond J. Hookway,
James A. Menegay,
William F. Ogden:
Modular Verification of Ada Generics.
Comput. Lang. 16(3/4): 259-280 (1991) |
1985 |
9 | | William F. Ogden,
Rockford J. Ross,
Karl Winklmann:
An ``Interchange Lemma'' for Context-Free Languages.
SIAM J. Comput. 14(2): 410-415 (1985) |
1982 |
8 | | George W. Ernst,
Jainendra K. Navlakha,
William F. Ogden:
Verification of Programs with Procedure-Type Parameter.
Acta Inf. 18: 149-169 (1982) |
1980 |
7 | EE | George W. Ernst,
William F. Ogden:
Specification of Abstract Data Types in Modula.
ACM Trans. Program. Lang. Syst. 2(4): 522-543 (1980) |
1978 |
6 | | William F. Ogden,
William E. Riddle,
William C. Rounds:
Complexity of Expressions Allowing Concurrency.
POPL 1978: 185-194 |
1975 |
5 | | Mehdi Jazayeri,
William F. Ogden,
William C. Rounds:
On the Complexity of the Circularity Test for Attribute Grammars.
POPL 1975: 119-129 |
4 | | Mehdi Jazayeri,
William F. Ogden,
William C. Rounds:
The Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars.
Commun. ACM 18(12): 697-706 (1975) |
1972 |
3 | | William F. Ogden,
William C. Rounds:
Compositions of n Tree Transducers
STOC 1972: 198-206 |
1969 |
2 | | William F. Ogden:
Intercalation Theorems for Stack Languages
STOC 1969: 31-42 |
1968 |
1 | | William F. Ogden:
A Helpful Result for Proving Inherent Ambiguity.
Mathematical Systems Theory 2(3): 191-194 (1968) |