A Technique for Invariant Generation
Lists
Only you see this
Abstract
Most of the properties established during verification are either invariants or depend crucially on invariants. The effectiveness of automated formal verification is therefore sensitive to the ease with which invariants, even trivial ones, can be automatically deduced. While the strongest invariant can be defined as the least fixed point of the strongest post-condition of a transition system starting with the set of initial states, this symbolic computation rarely converges. We present a method for invariant generation and strengthening that relies on the simultaneous construction of least and greatest fixed points, restricted widening and narrowing, and quantifier elimination. The effectiveness of the method is demonstrated on a number of examples.
BibTeX
@inproceedings{tiwari2001technique,
author = {Ashish Tiwari and Harald Rueß and Hassen Saïdi and Natarajan Shankar},
title = {{A Technique for Invariant Generation}},
booktitle = {TACAS},
year = {2001},
url = {https://openreview.net/forum?id=t1QpWal4jb},
}Loading related content...