Burt M. Leavenworth - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 23 from 23

1992

Proxy: an interpreter for rapid prototypingBurt M. Leavenworth. SIGPLAN, 27(6):19-28, 1992. [doi]

1983

Abstract Design and Program Translator: New Tools for Software DesignJerry L. Archibald, Burt M. Leavenworth, Leigh R. Power. IBMSJ, 22(3):170-187, 1983.

1981

Database Views Using Data AbstractionBurt M. Leavenworth. er 1983: 509-528 [doi]

Database programming with data abstractionsBurt M. Leavenworth. afips 1981: 537-542 [doi]

1980

A Data Abstraction Approach to Database ModellingBurt M. Leavenworth. SIGMOD 1981: 147-149 [doi]

1977

Structured Debugging Using a Domain Specific LanguageBurt M. Leavenworth. SPE, 7(4):475-482, 1977.

Non-Procedural Data ProcessingBurt M. Leavenworth. cj, 20(1):6-9, 1977.

1976

Incremental program testing in a very high level languageBurt M. Leavenworth. acm 1976: 499-503 [doi]

SICSOFT (Paper Session)Burt M. Leavenworth, Raymond J. Hookway, George W. Ernst, Thomas A. Standish, Dennis F. Kibler, James M. Neighbors, J. C. Huang. acm 1976: 498 [doi]

1974

Non-Procedural ProgrammingBurt M. Leavenworth. ibm 1975: 362-386

An overview of nonprocedural languagesBurt M. Leavenworth, Jean E. Sammet. sigplan 1974: 1-12 [doi]

1972

1971

Transition functions: A method for semantic extensionsBurt M. Leavenworth. exla 1971: 96-103 [doi]

1966

Syntax macros and extended translationBurt M. Leavenworth. CACM, 9(11):790-793, 1966. [doi]

1964

FORTRAN IV as a syntax languageBurt M. Leavenworth. CACM, 7(2):72-80, 1964. [doi]

1961

Algorithm 40: critical path schedulingBurt M. Leavenworth. CACM, 4(3):152-153, 1961. [doi]

1960

Algorithm 24: solution of tri-diagonal linear equationsBurt M. Leavenworth. CACM, 3(11):602, 1960. [doi]

Algorithm 25: real zeros of an arbitrary functionBurt M. Leavenworth. CACM, 3(11):602, 1960. [doi]

Sign in or sign up to see more results.

runs on WebDSL