[Zurück]

K. Hoder, L. Kovacs, A. Voronkov:
"Case Studies on Invariant Generation Using a Saturation Theorem Prover";
Vortrag: 10th Mexican International Conference on Artificial Intelligence (MICAI), Puebla, Mexico; 26.11.2011 - 04.12.2011; in: "Advances in Artificial Intelligence - 10th Mexican International Conference on Artificial Intelligence (MICAI)", I. Batyrshin, G. Sidorov (Hrg.); Springer, LNAI 7094 (2011), ISBN: 978-3-642-25323-2; S. 1 - 15.

Automatic understanding of the intended meaning of computer programs is a very hard problem, requiring intelligence and reasoning.
In this paper we evaluate a program analysis method, called symbol elimination, that uses first-order theorem proving techniques to automatically discover non-trivial program properties. We discuss implementation details of the method, present experimental results, and discuss the relation of the program properties obtained by our implementation and the intended meaning of the programs used in the experiments.

Automatic understanding of the intended meaning of computer programs is a very hard problem, requiring intelligence and reasoning.
In this paper we evaluate a program analysis method, called symbol elimination, that uses first-order theorem proving techniques to automatically discover non-trivial program properties. We discuss implementation details of the method, present experimental results, and discuss the relation of the program properties obtained by our implementation and the intended meaning of the programs used in the experiments.

program verification, loop invariants, theorem proving

http://publik.tuwien.ac.at/files/PubDat_205742.pdf