Xingyuan Zhang, Malcolm Munro, Mark Harman & Lin Hu, Weakest Precondition for General Recursive Programs Formalized in Coq, Lect. Notes in Comp. Sci., Springer-Verlag, New York--Heidelberg--Berlin, 2002, Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics (TPHOLs). Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Modelling General Recursion in Type Theory - Bove, Capretta (2002) (3 citations) (Correct)
....One can adopt a set theoretic approach and see functions as relations. Specifically, the behaviour of a recursive function can be described by an inductive relation 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 recursive programs as elements of some functional type. Using classical logic it is possible to extend every partial function to a total one. This fact is used by Finn, ....
Xingyuan Zhang, Malcolm Munro, Mark Harman, and Lin Hu. Weakest precondition for general recursive programs formalized in Coq. In Carreno et al. [CMT02], pages 332-347. 34
Syntax-Directed Amorphous Slicing - Danicic, Harman, Munro, Binkley.. Self-citation (Zhang Munro Harman Hu) (Correct)
....of a number of components, some of these have been described in detail elsewhere and are only summarised here. These phases are the side e ect removal phase [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 is at the heart of the slicer and which is described in more detail in the next section. 5 a = x x; undefined b = x, x) b = x 2; x = x 2; c = x ....
....components of the system. The semantic basis of WSL is Weakest Precondition (WP) and program transformation. In order to automate proofs about slicing and transformation algorithms in WSL the WP semantics of WSL have been formalised within the Coq type theoretic proof checking assistant [81]. An operational semantics for WSL has also been constructed and an equivalence between the operation and weakest pre condition semantics has been established [80] The advantages of using Coq, is that proof of program transformation can be constructed within the Coq system (by hand) and checked ....
[Article contains additional citation context not shown here]
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.
Pigs from Sausages? Reengineering from Assembler to C via FermaT.. - Ward (2004) (Correct)
No context found.
Xingyuan Zhang, Malcolm Munro, Mark Harman & Lin Hu, Weakest Precondition for General Recursive Programs Formalized in Coq, Lect. Notes in Comp. Sci., Springer-Verlag, New York--Heidelberg--Berlin, 2002, Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics (TPHOLs).
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