The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

William F. Ogden: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002