论文信息 - Formalising General Correctness

Formalising General Correctness

Abstract We consider the abstract command language of Dunne, and his account of general correctness. We provide an operational interpretation of his abstract commands, and use the automated theorem proving system Isabelle to prove that this operational interpretation leads to Dunne's semantics. We consider the difficulties in precisely formalising some formulae found in the literature.

Jeremy E. Dawson

[1] Steve Dunne. Abstract Commands: a Uniform Notation for Specification and Implementation , 2001, Electron. Notes Theor. Comput. Sci..

[2] Michael J. C. Gordon,et al. Mechanizing programming logics in higher order logic , 1989 .

[3] Gordon D. Plotkin,et al. A Powerdomain Construction , 1976, SIAM J. Comput..

[4] Philip Wadler,et al. The essence of functional programming , 1992, POPL '92.

[5] David Gries,et al. General correctness: A unification of partial and total correctness , 2004, Acta Informatica.

[6] Simon L. Peyton Jones,et al. Imperative functional programming , 1993, POPL '93.

[7] Graham Birtwistle,et al. Current Trends in Hardware Verification and Automated Theorem Proving , 1989, Springer New York.

[8] John Harrison,et al. Formalizing Dijkstra , 1998, TPHOLs.

[9] Paul Hudak,et al. Monad transformers and modular interpreters , 1995, POPL '95.

[10] Colin J. Fidge,et al. Formal Semantics for Program Paths , 2003, CATS.

[11] Greg Nelson,et al. A generalization of Dijkstra's calculus , 1989, ACM Trans. Program. Lang. Syst..