A Theorem Prover for Verifying Iterative Programs Over Integers

Authors:
D. Sarkar;S. C. De Sarkar
Affiliations:
-;-
Venue:
IEEE Transactions on Software Engineering
Year:
1989

Citing 10
Cited 0

Some Inference Rules for Integer Arithmetic for Verification of Flowchart Programs on Integers

IEEE Transactions on Software Engineering
A Set of Inference Rules for Quantified Formula Handling and Array Handling in Verification of Programs Over Integers

IEEE Transactions on Software Engineering
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets

Journal of the ACM (JACM)
Experiment with an automatic theorem-prover having partial ordering inference rules

Communications of the ACM
Introduction to Mathematical Theory of Computation

Introduction to Mathematical Theory of Computation
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
Stanford Pascal Verifier user manual

Stanford Pascal Verifier user manual
Toward a man-machine system for proving program correctness

Toward a man-machine system for proving program correctness
A program verifier

A program verifier

Quantified Score

Hi-index	0.00

Visualization

Abstract

An implementation of a rule-based theorem prover for verifying iterative programs over integers is presented. The authors emphasize the overall proof construction strategy of the prover which has been able to construct the correctness proofs of all iterative programs taken from the literature. Two performance measures for the prover are proposed, and its proof construction for an array-sorting program is evaluated using these measuress.