J. Grundy. A Method of Program Refinement. PhD thesis, University of Cambridge, 1993. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Doing High School Mathematics Carefully - Back, von Wright (1997) (Correct)
.... and Schneider as a vehicle for teaching logic as a tool rather than as an object of study [5, 6] Our derivation style also builds on the idea of contextual rewriting described by Staples and Robinson [10] This idea has been developed further by Grundy who also implemented a window inference tool [7, 9] for the HOL theorem proving system [4] The ideas of contextually dependent transformations is also important in program refinement and Back [1] has developed a graphical representation which in many ways corresponds to window inference. In this paper, we concentrate on describing how structured ....
J. Grundy. A Method of Program Refinement. PhD thesis, University of Cambridge, Cambridge, England, 1993.
An Interactive Metatool for Exploring Program Algebras - von Wright (1999) (Correct)
....system of HOL is a sequent formulation of natural deduction, so the system supports forward proof. However, the traditional mode of proof with HOL is goaldirected, using a special subgoal package that is implemented in SML, the meta language of the HOL system. Grundy s tool for window inference [8] makes it possible to do window inference proofs in HOL. The tool handles a derivation using a stack of windows in the SML metalanguage. When a stack is created, a focus E, a relation R and a set Gamma of assumptions are given and entered into the first window in the stack. The window can be ....
J. Grundy. A Method of Program Refinement. PhD thesis, University of Cambridge Computer Laboratory, Cambridge, England, 1993. Tech. Rpt. 318.
Flexible Interactive Transformational Reasoning - Staples (1996) (Correct)
....for the methodological development of correct programs from specifications. However, the use of refinement for the development of large programs has been limited, partly because of a lack of suitable tools. Recently, various tools supporting program refinement have been developed; one by Grundy [8], another at the Programming Methods Group of Abo Akademi [3] and another at the Software Verification Research Centre of the University of Queensland [4] These tools utilise a hierarchical transformational style of reasoning called window inference [15, 7, 9] as the main method of user ....
J. Grundy. A Method of Program Refinement. PhD thesis, Computer Laboratory, University of Cambridge, 1993. Also available as TR318.
Window Inference in Isabelle - Staples (1995) (3 citations) (Correct)
....inference tool for Isabelle. The window inference style of reasoning is similar to the standard presentation of program refinement [2, 11, 10] proofs. Because of this, window inference is gaining popularity as a basis for the construction of refinement tools in theorem provers refinement tools [8, 17, 3, 4] constructed with the Hol and Ergo theorem provers are based on their window inference facilities. The author s intention for a window inference tool in Isabelle is to use it as the basis of a program refinement tool. Hence in Section 4, the relevant setting of refinement as window inference is ....
....Currently, the presentation of constructed opening rules is sorted by the the number of base opening rules used to construct them, so that rules which open deeper are presented first. This heuristic for sorting is a simplified version of the heuristic for rule selection used in Grundy s tool. [8] As many different opening rules may be applied throughout backtracking, this implementation of window inference partially addresses the issue of tree structured proofs mentioned in [15, p53] However, the multiple branches of backtracking here are independent of each other, so these trees are ....
[Article contains additional citation context not shown here]
J. Grundy. A Method of Program Refinement. PhD thesis, Computer Laboratory, University of Cambridge, 1993. Also available as TR318.
Doing High School Mathematics Carefully - Back, von Wright (1997) (Correct)
.... and Schneider as a vehicle for teaching logic as a tool rather than as an object of study [5, 6] Our derivation style also builds on the idea of contextual rewriting described by Staples and Robinson [10] This idea has been developed further by Grundy who also implemented a window inference tool [7, 9] for the HOL theorem proving system [4] The ideas of contextually dependent transformations is also important in program refinement and Back [1] has developed a graphical representation which in many ways corresponds to window inference. In this paper, we concentrate on describing how structured ....
J. Grundy. A Method of Program Refinement. PhD thesis, University of Cambridge, Cambridge, England, 1993.
Operation Refinement and Monotonicity in the Schema Calculus - Deutsch, Henson, Reeves (2003) (Correct)
No context found.
J. Grundy. A Method of Program Refinement. PhD thesis, University of Cambridge, 1993.
An Analysis of Forward Simulation Data Refinement - Deutsch, Henson (2003) (Correct)
No context found.
J. Grundy. A Method of Program Refinement. PhD thesis, University of Cambridge, 1993.
Modular reasoning in Z: scrutinising monotonicity and.. - Deutsch, Henson, Reeves (2004) (Correct)
No context found.
J. Grundy. A Method of Program Refinement. PhD thesis, University of Cambridge, 1993.
A Framework for Generic and Reusable Tactics - Autexier (1999) (Correct)
No context found.
Grundy, J.: A Method of Program Refinement, PhD Thesis, University of Cambridge, England, 1993.
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