M. Staples. Program transformations and refinements in HOL. In Y. Bertot G. Dowek, C. Paulin, editor, TPHOLs: The 12th International Conference on Theorem Proving in Higher-Order Logics. LNCS, Springer-Verlag., 1999. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Weakest Precondition for General Recursive Programs.. - Zhang, Munro, Harman, Hu (2002) (2 citations) (Correct)
....wp, proposed by E. W. Dijkstra [5] proved to be useful in various areas of software development and has been investigated extensively [1, 13, 12] There have been a number of attempts to support wp and refinement calculus with computer assisted reasoning systems such as HOL [16, 19, 9] Isabelle [14, 17, 18], Ergo [3] PVS [8] and Alf [10] Unfortunately, among these works, only Laibinis and Wright [9] deals with general recursion. In this paper, an embedding of wp is given for general recursive programs using the intentional type theory supported by Coq [2] Since the computational mechanism ....
M. Staples. Program transformations and refinements in HOL. In Y. Bertot G. Dowek, C. Paulin, editor, TPHOLs: The 12th International Conference on Theorem Proving in Higher-Order Logics. LNCS, Springer-Verlag., 1999.
Weakest Precondition for General Recursive Programs.. - Zhang, Munro, Harman, Hu (2002) (2 citations) (Correct)
No context found.
M. Staples. Program transformations and refinements in HOL. In Y. Bertot G. Dowek, C. Paulin, editor, TPHOLs: The 12th International Conference on Theorem Proving in Higher-Order Logics. LNCS, Springer-Verlag., 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC