default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam F. Ogden
Person information
- affiliation: Ohio State University, Columbus, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[c11]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:
A Language for Building Verified Software Components. ICSR 2013: 308-314- 2012
- [c10]Gregory Kulczycki, Hampton Smith, Heather K. Harton, Murali Sitaraman, William F. Ogden, Joseph E. Hollingsworth:
The Location Linking Concept: A Basis for Verification of Code Using Pointers. VSTTE 2012: 34-49
2000 – 2009
- 2006
- [c9]Joan Krone, William F. Ogden, Murali Sitaraman:
Performance analysis based upon complete profiles. SAVCBS@FSE 2006: 3-10 - 2001
- [c8]Murali Sitaraman, Gregory Kulczycki, Joan Krone, William F. Ogden, A. L. Narasimha Reddy:
Performance specification of software components. SSR 2001: 3-10
1990 – 1999
- 1998
- [c7]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
- [j12]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) - 1996
- [c6]Bruce W. Weide, Stephen H. Edwards, Wayne D. Heym, Timothy J. Long, William F. Ogden:
Characterizing observability and controllability of software components. ICSR 1996: 62-71 - 1994
- [j11]William F. Ogden, Murali Sitaraman, Bruce W. Weide, Stuart H. Zweben:
Part I: the RESOLVE framework and discipline: a research synopsis. ACM SIGSOFT Softw. Eng. Notes 19(4): 23-28 (1994) - [j10]Bruce W. Weide, William F. Ogden, Murali Sitaraman:
Recasting Algorithms to Encourage Reuse. IEEE Softw. 11(5): 80-88 (1994) - [j9]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
- [j8]Bruce W. Weide, William F. Ogden, Stuart H. Zweben:
Reusable Software Components. Adv. Comput. 33: 1-65 (1991) - [j7]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)
1980 – 1989
- 1985
- [j6]William F. Ogden, Rockford J. Ross, Karl Winklmann:
An "Interchange Lemma" for Context-Free Languages. SIAM J. Comput. 14(2): 410-415 (1985) - 1982
- [j5]George W. Ernst, Jainendra K. Navlakha, William F. Ogden:
Verification of Programs with Procedure-Type Parameter. Acta Informatica 18: 149-169 (1982) - 1980
- [j4]Franklyn T. Bradshaw, George W. Ernst, Raymond J. Hookway, William F. Ogden:
Procedure semantics and language definition. ACM SIGPLAN Notices 15(6): 28-33 (1980) - [j3]George W. Ernst, William F. Ogden:
Specification of Abstract Data Types in Modula. ACM Trans. Program. Lang. Syst. 2(4): 522-543 (1980)
1970 – 1979
- 1978
- [c5]William F. Ogden, William E. Riddle, William C. Rounds:
Complexity of Expressions Allowing Concurrency. POPL 1978: 185-194 - 1975
- [j2]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) - [c4]Mehdi Jazayeri, William F. Ogden, William C. Rounds:
On the Complexity of the Circularity Test for Attribute Grammars. POPL 1975: 119-129 - [c3]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:
Structured specification of a Security Kernel. Reliable Software 1975: 285-293 - 1972
- [c2]William F. Ogden, William C. Rounds:
Compositions of n Tree Transducers. STOC 1972: 198-206
1960 – 1969
- 1969
- [c1]William F. Ogden:
Intercalation Theorems for Stack Languages. STOC 1969: 31-42 - 1968
- [j1]William F. Ogden:
A Helpful Result for Proving Inherent Ambiguity. Math. Syst. Theory 2(3): 191-194 (1968)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
