Heuristic methods for mechanically deriving inductive assertio

Authors:
Ben Hegbreitt
Affiliations:
Bolt Beranek and Newman Inc. and Harvard University, Cambridge, Massachusetts
Venue:
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Year:
1973

Citing 3
Cited 2

An Assessment of Techniques for Proving Program Correctness

ACM Computing Surveys (CSUR)
The current state of proving programs correct

ACM '72 Proceedings of the ACM annual conference - Volume 1
A program verifier

A program verifier

On the mechanical derivation of loop invariants

Journal of Symbolic Computation - Special issue on automatic programming
Invariant Discovery via Failed Proof Attempts

LOPSTR '98 Proceedings of the 8th International Workshop on Logic Programming Synthesis and Transformation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Current methods for mechanical program verification require a complete predicate specification on each loop. Because this is tedious and error-prone, producing a program with complete, correct predicates is reasonably difficult and would be facilitated by machine assistance. This paper discusses heuristic methods for mechanically deriving loop predicates from their boundary conditions and for mechanically completing partially specified loop predicates.