Ralph L. London

According to our database, Ralph L. London authored at least 23 papers between 1964 and 1989.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

1989

Specifying reusable components using Z: realistic sets and dictionaries.

Ralph L. London, Kathleen Milsted

Proceedings of the 5th International Workshop on Software Specification and Design, 1989

1985

Exploiting workstations and displays in verification systems.

S. Kamal Abdali, Ralph L. London

ACM SIGSOFT Softw. Eng. Notes, 1985

Animating Programs Using Smalltalk.

Ralph L. London, Robert Duisberg

Computer, 1985

1980

An Overview of AFFIRM: A Specification and Verification System.

Susan L. Gerhart, David R. Musser, David H. Thompson, D. A. Baker, R. L. Bates, Roddy W. Erickson, Ralph L. London, D. G. Taylor, David S. Wile

Proceedings of the Information Processing, Proceedings of the 8th IFIP Congress 1980, Tokyo, Japan - October 6-9, 1980 and Melbourne, Australia, 1980

1978

Proof Rules for the Programming Language Euclid.

Ralph L. London, John V. Guttag, James J. Horning, Butler W. Lampson, James G. Mitchell, Gerald J. Popek

Acta Informatica, 1978

Validating The Utility Of Abstraction Techniques.

Mary Shaw, Gary Feldman, Robert Fitzgerald, Paul N. Hilfinger, Izumi Kimura, Ralph L. London, Jonathan Rosenberg, William A. Wulf

Proceedings of the Proceedings 1978 ACM Annual Conference, 1978

1977

Report on the programming language Euclid.

Butler W. Lampson, James J. Horning, Ralph L. London, James G. Mitchell, Gerald J. Popek

ACM SIGPLAN Notices, 1977

Abstraction and Verification in Alphard: Defining and Specifying Iteration and Generators.

Mary Shaw, William A. Wulf, Ralph L. London

Commun. ACM, 1977

Notes on the Design of Euclid.

Gerald J. Popek, James J. Horning, Butler W. Lampson, James G. Mitchell, Ralph L. London

Proceedings of an ACM Conference on Language Design for Reliable Software (LDRS), 1977

A Proof Rule for Euclid Procedures.

John V. Guttag, James J. Horning, Ralph L. London

Proceedings of the Formal Description of Programming Concepts: Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts, 1977

1976

An Introduction to the Construction and Verification of Alphard Programs.

William A. Wulf, Ralph L. London, Mary Shaw

IEEE Trans. Software Eng., 1976

Remarks on the impact of program verification on language design.

Ralph L. London

Proceedings of the Design and Implementation of Programming Languages, Proceeding of a DoD Sponsored Workshop, Ithaca, NY, USA, September 30, 1976

An Introduction to the Construction and Verification of Alphard Programs (Abstract).

William A. Wulf, Ralph L. London, Mary Shaw

Proceedings of the 2nd International Conference on Software Engineering, 1976

1975

An Interactive Program Verification System.

Donald I. Good, Ralph L. London, W. W. Bledsoe

IEEE Trans. Software Eng., 1975

A view of program verification.

Ralph L. London

Proceedings of the International Conference on Reliable Software 1975, 1975

1974

Automatic Program Verification I: A Logical Basis and its Implementation.

Shigeru Igarashi, Ralph L. London, David C. Luckham

Acta Informatica, 1974

The application of a symbolic mathematical system to program verification.

Ralph L. London, David R. Musser

Proceedings of the 1974 ACM Annual Conference, 1974

1972

Correctness of a compiler for a Lisp subset.

Ralph L. London

Proceedings of ACM Conference on Proving Assertions About Programs, 1972

The current state of proving programs correct.

Ralph L. London

Proceedings of the ACM annual conference, 1972

1971

Experience with inductive assertions for proving programs correct.

Ralph L. London

Proceedings of the Symposium on Semantics of Algorithmic Languages, 1971

1970

Computer Interval Arithmetic: Definition and Proof of Correct Implementation.

Donald I. Good, Ralph L. London

J. ACM, 1970

Certification of algorithm 245 [M1]: treesort 3: proof of algorithms - a new kind of certification.

Ralph L. London

Commun. ACM, 1970

1964

A computer program for discovering and proving recognition rules for Backus Normal Form grammars.

Ralph L. London

Proceedings of the 19th ACM national conference, 1964