论文信息 - Constructive Methods in Automatic Analysis of Correctness Proofs

Constructive Methods in Automatic Analysis of Correctness Proofs

We show in this contribution that an instrument from Constructive Proof Theory, the Collection Method, can be used in practice to extract information from a correctness proof. In particular, we used such a method to automatically label the source code of a program with assertions that state the minimal pre- and postconditions (wrt the correctness proof) which ensure the validity of the specification.

[1] Pierangelo Miglioli,et al. Semi-Constructive Formal Systems and Axiomatization of Abstract Data Types , 1989, TAPSOFT, Vol.1.

[2] Pierangelo Miglioli,et al. Constructive Theories with Abstract Data Types for Program Synthesis , 1987 .

[3] Ulrich Berger,et al. Program Extraction from Classical Proofs , 1994, LCC.

[4] S. Shelah,et al. Annals of Pure and Applied Logic , 1991 .

[5] A. Troelstra. Metamathematical investigation of intuitionistic arithmetic and analysis , 1973 .

[6] Pierangelo Miglioli,et al. A logically justified model of computation I , 1981, Fundam. Informaticae.

[7] A. Troelstra,et al. Constructivism in Mathematics: An Introduction , 1988 .

[8] Lawrence Charles Paulson,et al. Isabelle: A Generic Theorem Prover , 1994 .