Finding Invariant assertions for proving programs

Authors:
Michel Caplain
Affiliations:
ENSLMAG - Universlté de Grenoble and Commissariat àl'Energie Atomique, Saclay
Venue:
Proceedings of the international conference on Reliable software
Year:
1975

Citing 1
Cited 13

A program verifier

A program verifier

On the mechanical derivation of loop invariants

Journal of Symbolic Computation - Special issue on automatic programming
Automatic Generation of Invariants

Formal Methods in System Design - Special issue on The First Federated Logic Conference (FLOC'96), part II
Logical analysis of programs

Communications of the ACM
Proof planning for strategy development

Annals of Mathematics and Artificial Intelligence
Inference rules for program annotation

ICSE '78 Proceedings of the 3rd international conference on Software engineering
An approach to efficient, fault tolerant programming

ACM SIGPLAN Notices
PR-Miner: automatically extracting implicit programming rules and detecting violations in large software code

Proceedings of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering
A Method for Computing the Number of Iterations in Data Dependent Loops

Real-Time Systems
An Integrated Approach to High Integrity Software Verification

Journal of Automated Reasoning
Finding positively invariant sets of a class of nonlinear loops via curve fitting

Proceedings of the 2009 conference on Symbolic numeric computation
Scalable specification mining for verification and diagnosis

Proceedings of the 47th Design Automation Conference
Polynomial invariants for linear loops

Cybernetics and Systems Analysis
Mechanical inference of invariants for FOR-loops

Journal of Symbolic Computation

Quantified Score

Hi-index	0.02

Visualization

Abstract

We attempt to extract from any program loop its “Most General Invariant” in order to either prove its correctness, including termination, or disprove it and propose corrections.