Ralph L. London - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

1989

Specifying reusable components using Z: realistic sets and dictionariesRalph L. London, Kathleen Milsted. iwssd 1989: 120-127 [doi]

1985

Exploiting workstations and displays in verification systemsS. Kamal Abdali, Ralph L. London. sigsoft, 10(4):35-36, 1985. [doi]

Animating Programs Using SmalltalkRalph L. London, Robert Duisberg. Computer, 18(8):61-71, 1985.

1978

1977

1976

Remarks on the impact of program verification on language designRalph L. London. sigada 1977: 313-320

An Introduction to the Construction and Verification of Alphard ProgramsWilliam A. Wulf, Ralph L. London, Mary Shaw. TSE, 2(4):253-265, 1976.

An Introduction to the Construction and Verification of Alphard Programs (Abstract)William A. Wulf, Ralph L. London, Mary Shaw. ICSE 1976: 390

1975

An Interactive Program Verification SystemDonald I. Good, Ralph L. London, W. W. Bledsoe. TSE, 1(1):59-67, 1975.

An interactive program verification systemDonald I. Good, Ralph L. London, W. W. Bledsoe. relsoft 1975: 482-492 [doi]

A view of program verificationRalph L. London. relsoft 1975: 534-545 [doi]

1974

Automatic Program Verification I: A Logical Basis and its ImplementationShigeru Igarashi, Ralph L. London, David C. Luckham. ACTA, 4:145-182, 1974.

The application of a symbolic mathematical system to program verificationRalph L. London, David R. Musser. acm 1974: 265-273 [doi]

1972

The current state of proving programs correctRalph L. London. acm 1972: 39-46 [doi]

Correctness of a compiler for a Lisp subsetRalph L. London. praapr 1972: 121-127 [doi]

1971

Experience with inductive assertions for proving programs correctRalph L. London. In Erwin Engeler, editor, Symposium on Semantics of Algorithmic Languages. Volume 188 of Lecture Notes in Mathematics, pages 236-251, Springer, 1971. [doi]

1970

Computer Interval Arithmetic: Definition and Proof of Correct ImplementationDonald I. Good, Ralph L. London. JACM, 17(4):603-612, 1970. [doi]

Certification of algorithm 245 [M1]: treesort 3: proof of algorithms - a new kind of certificationRalph L. London. CACM, 13(6):371-373, 1970. [doi]

1964

A computer program for discovering and proving recognition rules for Backus Normal Form grammarsRalph L. London. acm 1964: 11 [doi]

Sign in or sign up to see more results.

runs on WebDSL