A practical loop invariant generation approach based on random testing, constraint solving and verification

Authors:
Mengjun Li
Affiliations:
School of Computer, National University of Defense Technology, Changsha, China
Venue:
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Year:
2012

Citing 14
Cited 0

Dynamically Discovering Likely Program Invariants to Support Program Evolution

IEEE Transactions on Software Engineering - Special issue on 1999 international conference on software engineering
Automatic discovery of linear restraints among variables of a program

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Non-linear loop invariant generation using Gröbner bases

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Precise interprocedural analysis through linear algebra

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient incremental algorithms for dynamic detection of likely invariants

Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering
Computing polynomial program invariants

Information Processing Letters
The octagon abstract domain

Higher-Order and Symbolic Computation
Generating all polynomial invariants in simple loops

Journal of Symbolic Computation
DySy: dynamic symbolic execution for invariant inference

Proceedings of the 30th international conference on Software engineering
Program analysis as constraint solving

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Aligator: A Mathematica Package for Invariant Generation (System Description)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
A comparative study of programmer-written and automatically inferred contracts

Proceedings of the eighteenth international symposium on Software testing and analysis
Generating polynomial invariants with DISCOVERER and QEPCAD

Formal methods and hybrid real-time systems
Interprocedurally analyzing polynomial identities

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Loop invariants play a major role in software verification. Based on random testing, constraint solving and verification, this paper presents a practical approach for generating equality loop invariants. More importantly, we present a practical verification approach of loop invariant based on finite difference technique. This approach is efficient since the constraint system is linear equational system. The effectiveness of the approach is demonstrated on examples.