Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Ralph L. London

dblp:71/5810 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
0since 2021 · last 1978
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 3Theory of computation · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
4 papers
Program verification · 51% Programming languages and type systems · 44% Requirements engineering and software design · 4%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 7 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Programming languages and type systems
language design
0.021976
An Introduction to the Construction and Verification of Alphard Programs · IEEE Trans. Software Eng. 1976
An Introduction to the Construction and Verification of Alphard Programs (Abstract) · ICSE 1976
Programming languages and type systems › language design
abstraction mechanisms
0.011976
An Introduction to the Construction and Verification of Alphard Programs · IEEE Trans. Software Eng. 1976
Program verification › invariant generation
inductive assertions
0.011975
An Interactive Program Verification System · IEEE Trans. Software Eng. 1975
Program verification › mechanized verification
interactive verification
0.011975
An Interactive Program Verification System · IEEE Trans. Software Eng. 1975
Mathematical optimization › numerical analysis
interval arithmetic
0.011970
Computer Interval Arithmetic: Definition and Proof of Correct Implementation · J. ACM 1970
Mathematical optimization
numerical computation
0.011970
Computer Interval Arithmetic: Definition and Proof of Correct Implementation · J. ACM 1970
Program verification › deductive verification
verification condition generation
0.011975
An Interactive Program Verification System · IEEE Trans. Software Eng. 1975

Methods — techniques the papers use, named apart from their topics

theorem proving · 0.0inductive assertion method · 0.0formal program verification · 0.0floating-point arithmetic · 0.0ALGOL · 0.0
YearPublicationVenuePosition
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 Informatica1
1976 An Introduction to the Construction and Verification of Alphard Programs (Abstract)
William A. Wulf, Ralph L. London, Mary Shaw
ICSE2
1976 An Introduction to the Construction and Verification of Alphard Programs
abstract
The programming language Alphard is designed to provide support for both the methodologies of "well-structured" programming and the techniques of formal program verification. Language constructs allow a programmer to isolate an abstraction, specifying its behavior publicly while localizing knowledge about its implementation. The verification of such an abstraction consists of showing that its implementation behaves in accordance with its public specifications; the abstraction can then be used with confidence in constructing other programs, and the verification of that use employs only the public specifications.
William A. Wulf, Ralph L. London, Mary Shaw
IEEE Trans. Software Eng.2
1975 An Interactive Program Verification System
abstract
This paper is an initial progress report on the development of an interactive system for verifying that computer programs meet given formal specifications. The system is based on the conventional inductive assertion method: given a program and its specifications, the object is to generate the verification conditions, simplify them, and prove what remains. The important feature of the system is that the human user has the opportunity and obligation to help actively in the simplifying and proving. A general description is given of the overall design philosophy, structure, and functional components of the system, and a simple sorting program is used to illustrate both the behavior of major system components and the type of user interaction the system provides.
Donald I. Good, Ralph L. London, W. W. Bledsoe
IEEE Trans. Software Eng.2
1974 Automatic Program Verification I: A Logical Basis and its Implementation
Shigeru Igarashi, Ralph L. London, David C. Luckham
Acta Informatica2
1970 Computer Interval Arithmetic: Definition and Proof of Correct Implementation
abstract
A definition is given of computer interval arithmetic suitable for implementation on a digital computer. Some computational properties and simplifications are derived. An ALGOL code segment is proved to be a correct implementation of the definition on a specified machine environment.
Donald I. Good, Ralph L. London
J. ACM2