William F. Ogden - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 23 from 23

2013

2012

The Location Linking Concept: A Basis for Verification of Code Using PointersGregory Kulczycki, Hampton Smith, Heather K. Harton, Murali Sitaraman, William F. Ogden, Joseph E. Hollingsworth. vstte 2012: 34-49 [doi]

2006

Performance analysis based upon complete profilesJoan Krone, William F. Ogden, Murali Sitaraman. FSE 2006: 3-10 [doi]

2001

Performance specification of software componentsMurali Sitaraman, Gregory Kulczycki, Joan Krone, William F. Ogden, A. L. Narasimha Reddy. ssr 2001: 3-10 [doi]

1998

A Data Abstraction Alternative to Data Structure/Algorithm ModularizationMurali Sitaraman, Bruce W. Weide, Timothy J. Long, William F. Ogden. Dagstuhl 2000: 102-113 [doi]

1997

On the Practical Need for Abstraction Relations to Verify Abstract Data Type RepresentationsMurali Sitaraman, Bruce W. Weide, William F. Ogden. TSE, 23(3):157-170, 1997. [doi]

1996

Characterizing observability and controllability of software componentsBruce W. Weide, Stephen H. Edwards, Wayne D. Heym, Timothy J. Long, William F. Ogden. icsr 1996: 62-71 [doi]

1994

Modular Verification of Data Abstractions with Shared RealizationsGeorge W. Ernst, Raymond J. Hookway, William F. Ogden. TSE, 20(4):288-307, 1994. [doi]

Part I: the RESOLVE framework and discipline: a research synopsisWilliam F. Ogden, Murali Sitaraman, Bruce W. Weide, Stuart H. Zweben. sigsoft, 19(4):23-28, 1994. [doi]

Recasting Algorithms to Encourage ReuseBruce W. Weide, William F. Ogden, Murali Sitaraman. IEEE Software, 11(5):80-88, 1994. [doi]

1991

Modular Verification of Ada GenericsGeorge W. Ernst, Raymond J. Hookway, James A. Menegay, William F. Ogden. Comp. Lang., Syst. \& Struct., 16(3/4):259-280, 1991.

Reusable Software ComponentsBruce W. Weide, William F. Ogden, Stuart H. Zweben. ac, 33:1-65, 1991.

1985

An Interchange Lemma for Context-Free LanguagesWilliam F. Ogden, Rockford J. Ross, Karl Winklmann. SICOMP, 14(2):410-415, 1985.

1982

Verification of Programs with Procedure-Type ParameterGeorge W. Ernst, Jainendra K. Navlakha, William F. Ogden. ACTA, 18:149-169, 1982.

1980

Procedure semantics and language definitionFranklyn T. Bradshaw, George W. Ernst, Raymond J. Hookway, William F. Ogden. SIGPLAN, 15(6):28-33, 1980. [doi]

Specification of Abstract Data Types in ModulaGeorge W. Ernst, William F. Ogden. TOPLAS, 2(4):522-543, 1980. [doi]

1978

Complexity of Expressions Allowing ConcurrencyWilliam F. Ogden, William E. Riddle, William C. Rounds. POPL 1978: 185-194

1975

1972

Compositions of n Tree TransducersWilliam F. Ogden, William C. Rounds. stoc 1972: 198-206

1969

Intercalation Theorems for Stack LanguagesWilliam F. Ogden. stoc 1969: 31-42

1968

A Helpful Result for Proving Inherent AmbiguityWilliam F. Ogden. mst, 2(3):191-194, 1968.

Sign in or sign up to see more results.

runs on WebDSL