A summary of progress toward proving program correctness

Authors:
T. A. Linden
Affiliations:
National Security Agency, Ft. George G. Meade, Maryland
Venue:
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
Year:
1972

Citing 22
Cited 3

Formalization of Properties of Functional Programs

Journal of the ACM (JACM)
Computer Interval Arithmetic: Definition and Proof of Correct Implementation

Journal of the ACM (JACM)
The Vienna Definition Language

ACM Computing Surveys (CSUR)
An Assessment of Techniques for Proving Program Correctness

ACM Computing Surveys (CSUR)
A technique for software module specification with examples

Communications of the ACM
Proof of a program: FIND

Communications of the ACM
Toward automatic program synthesis

Communications of the ACM
Another recursion induction principle

Communications of the ACM
The structure of the “THE”-multiprogramming system

Communications of the ACM
An axiomatic basis for computer programming

Communications of the ACM
Algorithm 65: find

Communications of the ACM
The current state of proving programs correct

ACM '72 Proceedings of the ACM annual conference - Volume 1
Implementation and applications of Scott's logic for computable functions

Proceedings of ACM conference on Proving assertions about programs
Derivation of axiomatic definitions of programming languages from algorithmic definitions

Proceedings of ACM conference on Proving assertions about programs
Inductive methods for proving properties of programs

Proceedings of ACM conference on Proving assertions about programs
Program correctness methods and language definition

Proceedings of ACM conference on Proving assertions about programs
Correctness of a compiler for a Lisp subset

Proceedings of ACM conference on Proving assertions about programs
Formal development of correct algorithms: An example based on earley's recogniser

Proceedings of ACM conference on Proving assertions about programs
A program verifier

A program verifier
The application of theorem proving to question-answering systems

The application of theorem proving to question-answering systems
Introduction to mathematical theory of computation

Introduction to mathematical theory of computation
Mathematical concepts in programming language semantics

AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference

Survey of existing programming aids

ACM SIGPLAN Notices
Operating system penetration

AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
Security kernels

AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition

Quantified Score

Hi-index	0.00

Visualization

Abstract

Interest in proving the correctness of programs has grown explosively within the last two or three years. There are now over a hundred people pursuing research on this general topic; most of them are relative newcomers to the field. At least three reasons can be cited for this rapid growth: (1) The inability to design and implement software systems which can be guaranteed correct is severely restricting computer applications in many important areas. (2) Debugging and maintaining large computer programs is now well recognized as one of the most serious and costly problems facing the computer industry. (3) A large number of mathematicians, especially logicians, are interested in applications where their talents can be used.