论文信息 - Cocktail : a tool for deriving correct programs

Cocktail : a tool for deriving correct programs

Cocktail is a tool for deriving correct programs from their specifications. The present version is powerful enough for educational purposes. The tool yields support for many sorted first order predicate logic, formulated in a pure type system with parametric constants (CPTS), as the specification language, a simple While- language, a Hoare logic represented in the same CPTS for deriving programs from their specifications and a simple tableau based automated theorem prover for verifying proof obligations.

M. Franssen

[1] Edsger W. Dijkstra,et al. A Discipline of Programming , 1976 .

[2] David Gries,et al. The Science of Programming , 1981, Text and Monographs in Computer Science.

[3] Edsger W. Dijkstra,et al. A method of programming , 1988 .

[4] Christine Paulin-Mohring,et al. Extracting ω's programs from proofs in the calculus of constructions , 1989, POPL '89.

[5] Anne Kaldewaij,et al. Programming - the derivation of algorithms , 1990, Prentice Hall international series in computer science.

[6] Flemming Nielson,et al. Semantics with applications - a formal introduction , 1992, Wiley professional computing.

[7] James McKinna,et al. Checking Algorithms for Pure Type Systems , 1994, TYPES.

[8] Equational Proofs in Tableaux en Logic Programming , 1995 .

[9] Twan Laan. The evolution of type theory in logic and mathematics , 1997 .

[10] Michael Franssen. Embedding First-Order Tableaux into a Pure Type System , 1998, Electron. Notes Theor. Comput. Sci..

[11] W. Bibel,et al. Automated deduction : a basis for applications , 1998 .

[12] J Jan Zwanenburg,et al. Object-oriented concepts and proof rules : formalization in type theory and implementation in Yarrow , 1999 .

[13] Richard Bornat,et al. Proving Pointer Programs in Hoare Logic , 2000, MPC.

[14] Twan Laan,et al. Embedding First-order Logic in a Pure Type System with Parameters , 2001, J. Log. Comput..