论文信息 - Formal Correctness Proofs of Functional Programs: Dijkstra’s Algorithm, a Case Study

Formal Correctness Proofs of Functional Programs: Dijkstra’s Algorithm, a Case Study

One can argue that writing proofs might be better than writing programs, for the following simple reason: There is no algorithm that can check whether a program meets its specification, but it is easy to check whether a given proof is correct.

Helmut Schwichtenberg | Holger Benl

[1] Ulrich Berger,et al. The Greatest Common Divisor: A Case Study for Program Extraction from Classical Proofs , 1995, TYPES.

[2] Robert L. Constable,et al. Proofs as programs , 1985, TOPL.

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

[4] S. Kawasaki,et al. Springer Verlag, Berlin, Heidelberg, New York (1995) , 1996 .

[5] C. Goad. Computational uses of the manipulation of formal proofs , 1980 .