The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Communications of the ACM
Automatic program verification I: a logical basis and its implementation.
Automatic program verification I: a logical basis and its implementation.
A program verifier
LISP 1.5 Programmer's Manual
An interactive program verification system
Proceedings of the international conference on Reliable software
A view of program verification
Proceedings of the international conference on Reliable software
The application of a symbolic mathematical system to program verification
ACM '74 Proceedings of the 1974 annual conference - Volume 1
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
Hi-index | 0.00 |
This paper describes a theorem prover that embodies knowledge about programming constructs, such as numbers, arrays, lists, and expressions. The program can reason about these concepts and is used as part of a program verification system that uses the Floyd-Naur explication of program semantics. It is implemented in the QA4 language; the QA4 system allows many bits of strategic knowledge, each expressed as a small program, to be coordinated so that a program stands forward when it is relevant to the problem at hand. The language allows clear, concise representation of this sort of knowledge. The QA4 system also has special facilities for dealing with commutative functions, ordering relations, and equivalence relations; these features are heavily used in this deductive system. The program interrogates the user and asks his advice in the course of a proof. Verifications have been found for Hoare's FIND program, a real-number division algorithm, and some sort programs, as well as for many simpler algorithms. Additional theorems have been proved about a pattern matcher and a version of Robinson's unification algorithm.