Social processes and proofs of theorems and programs
Communications of the ACM
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
A simplifier based on efficient decision algorithms
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A program verifier
ACM SIGART Bulletin - Special issue on implemented knowledge representation and reasoning systems
Taxonomic syntax for first order inference
Journal of the ACM (JACM)
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Program logic without binding is decidable
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
The goal of automatic program verification is to prove programs correct formally. We argue that the existing notions of formal proof are too syntactic and as such too intimately bound up with details of low-level computation. We propose a more semantic notion of formal proof which nevertheless pays due respect to the problem of effectiveness in proof checking. Such a notion supplies a more practical basis for the specification of verifiers than do extant approaches. In particular the problem of constructing verifiers according to our approach is reduced entirely to routine development and implementation of decision methods, while permitting shorter proofs and yet remaining easy to develop proofs with.