论文信息 - Finding Invariant assertions for proving programs

Finding Invariant assertions for proving programs

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.

Michel Caplain

[1] Robert W. Floyd. Toward Interactive Design of Correct Programs , 1971, IFIP Congress.

[2] Zohar Manna,et al. A Heuristic Approach to Program Verification , 1973, IJCAI.

[3] James C. King,et al. A Program Verifier , 1971, IFIP Congress.

[4] Ben Wegbreit,et al. Heuristic Methods for Mechanically Deriving Inductive Assertions , 1973, IJCAI.

[5] Edwin Bailey Elliott,et al. An Introduction to the algebra of quantics , 2008 .