Xingyuan Zhang, Malcolm Munro, Mark Harman, Lin Hu  Home/Search
Context Related
| brunel.ac.uk/~csstmmh2/tphols.ps dcs.kcl.ac.uk/staff/mark/tphols.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: brunel.ac.uk/~csstmmh2/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is a deep embedding using the computational power intrinsic to type theory. Since Coq accepts only structural recursive functions, the computational embedding of general recursive programs is non-trivial. To justify the embedding, an operational semantics is defined and the equivalence between wp and the operational semantics is... (Update)
Context of citations to this paper: More
.... [42, 44] the approach to criterion guidance [39] and the approach to formalisation and correctness proof of the transformations used [80, 81]. The purpose of this section is to provide a context for the description of the Dependence Reduction Transformation (DRT) step, which...
.... giving its operational semantics (see, for example, Win93] Operational semantics has been developed in type theory in [BCB02] and [ZMHH02] However, relations do not have any computational content in type theory. The real challenge consists in representing general...
Cited by: More
Pigs from Sausages? Reengineering from Assembler to C via FermaT.. - Ward (2004) (Correct)
Modelling General Recursion in Type Theory - Bove, Capretta (2002) (Correct)
Syntax-Directed Amorphous Slicing - Danicic, Harman, Munro, Binkley.. (Correct)
Active bibliography (related documents): More All
3.3: Weakest Precondition for General Recursive Programs.. - Zhang, Munro, Harman, Hu (2002) (Correct)
0.3: A Method of Program Refinement - Grundy (1993) (Correct)
0.3: PVS Bibliography - Rushby (1998) (Correct)
Similar documents based on text: More All
0.7: GUSTT: An Amorphous Slicing System which Combines Slicing.. - Harman, Munro, Zhang (2001) (Correct)
0.7: Side-Effect Removal Transformation - Harman, Munro, Hu, Zhang (2001) (Correct)
0.7: Source Code Analysis and Manipulation - Harman, Munro, Hu, Zhang (Correct)
Related documents from co-citation: More All
2: Information and Computation (context) - Coquand, Huet - 1988
2: Amorphous program slicing - Harman, Danicic - 1997
2: Do Program Transformations Help Reverse Engineering - Bennett - 1998
BibTeX entry: (Update)
Xingyuan Zhang, Malcolm Munro, Mark Harman, and Lin Hu. Weakest precondition for general recursive programs formalized in Coq. In 15 International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2002. http://citeseer.ist.psu.edu/article/zhang02weakest.html More
@misc{ zhang02weakest,
author = "X. Zhang and M. Munro and M. Harman and L. Hu",
title = "Weakest precondition for general recursive programs formalized in Coq",
text = "Xingyuan Zhang, Malcolm Munro, Mark Harman, and Lin Hu. Weakest precondition
for general recursive programs formalized in Coq. In 15 International Conference
on Theorem Proving in Higher Order Logics (TPHOLs 2002.",
year = "2002",
url = "citeseer.ist.psu.edu/article/zhang02weakest.html" }
Citations (may not include all citations):652 A Discipline of Programming (context) - Dijkstra - 1976
266 Information and Computation (context) - Coquand, Huet et al. - 1988
195 ACM Transactions on Programming Languages and Systems (context) - Morgan, statement - 1988
135 A theoretical basis for stepwise refinement and the programm.. (context) - Morris - 1987
114 A calculus of refinements for program derivations (context) - Back - 1988
109 Programming in Martin-Lof's Type Theory (context) - Nordstrom, Peterson et al. - 1990
84 Computation and Reasoning: A Type Theory for Computer Scienc.. (context) - Luo - 1994
42 The Coq Proof Assistant Reference Manual -- Version V (context) - Barras, Boutin et al. - 1997
31 right: Towards a mechanized semantics textbook (context) - Nipkow, almost - 1996
14 Hoare Logic and VDM: Machine-Checked Soundness and Completen.. - Kleymann - 1998
12 Refinement concepts formalized in higherorder logic - Back, von Wright - 1989
6 Software Verification Research Centre (context) - Carrington, Hayes et al. - 1994
4 Proof of Imperative Programs in Type Theory (context) - Filliatre - 1998
3 A PVS based tool for developing programs in the refinement c.. - Knappmann - 1996
3 Program transformations and refinements in HOL (context) - von Wright, Sere - 1992
2 A formalization of Dijkstra's predicate transformer wp in Ma.. (context) - Lindqvist - 1997
2 A Mechanised Theory of Refinement (context) - Staples - 1998
2 Program transformations and refinements in HOL (context) - Staples - 1999
2 Functional procedures in higher-order logic - Laibinis, von Wright - 1999
Documents on the same site (http://www.brunel.ac.uk/~csstmmh2/papers.html): More
Side-Effect Removal Transformation - Harman, Munro, Hu, Zhang (2001) (Correct)
ConSIT: A Conditioned Program Slicer - Danicic, Harman (2000) (Correct)
The Relationship Between Program Dependence and Mutation.. - Harman, Danicic, Hierons (2000) (Correct)
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