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

Authors:
D. Sarkar;S. C. De Sarkar
Affiliations:
Indian Institute of Technology, Kharagpur, India;Indian Institute of Technology, Kharagpur, India
Venue:
IEEE Transactions on Software Engineering
Year:
1989

Citing 13
Cited 6

A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving

Journal of the ACM (JACM)
Automatic Theorem Proving With Renamable and Semantic Resolution

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
Deduction with Relation Matching

Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
Abstraction Mappings in Mechanical Theorem Proving

Proceedings of the 5th Conference on Automated Deduction
Locking: A Restriction of Resolution (Dissertation), also ATP-05

Locking: A Restriction of Resolution (Dissertation), also ATP-05
Toward a man-machine system for proving program correctness

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

A program verifier
Automatic theorem proving: new results on goal trees and presburger arithmetic.

Automatic theorem proving: new results on goal trees and presburger arithmetic.

A Theorem Prover for Verifying Iterative Programs Over 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 Formal Verification Method of Scheduling in High-level Synthesis

ISQED '06 Proceedings of the 7th International Symposium on Quality Electronic Design
Hand-in-hand verification of high-level synthesis

Proceedings of the 17th ACM Great Lakes symposium on VLSI
Verification of datapath and controller generation phase in high-level synthesis of digital circuits

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Experimentation with SMT solvers and theorem provers for verification of loop and arithmetic transformations

Proceedings of the 5th IBM Collaborative Academia Research Exchange Workshop

Quantified Score

Hi-index	0.00

Visualization

Abstract

Significant modifications of the first-order rules have been developed so that they can be applied directly to algebraic expressions. The importance and implication of normalization of formulas in any theorem prover are discussed. It is shown how the properties of the domain of discourse have been taken care of either by the normalizer or by the inference rules proposed. Using a nontrivial example, the following capabilities of the verifier that would use these inference rules are highlighted: (1) closeness of the proof construction process to the human thought process; and (2) efficient handling of user provided axioms. Such capabilities make interfacing with humans easy.