Australia. A discipline for loop construction is presented which is based on the concept of a well-formed postcondition. A well-formed postcondition is seen to have an implicit logical structure which is made explicit by appropriate. variable binding. This variable binding identifies the loop invariant and a determinate. Loops are then constructed by first identify-ing the weakest iterative mechanism capable of establishing the postcondition. Subsequent development proceeds by way of inOuct,ve stepwise refinement. This discipline for loop construction leads naturally to a sCheme for classifying loop mechanisms. It also leads to a proposal for a weak loop grammar (not in principle unlike Chomsky's phrase structure grammar) which helps t...
AbstractThis paper explains how a declarative method language, based upon the formal notations of Z ...
I am indebted to Prof. Edsgar Dijkstra for introducing me to weakest preconditions, Prof. J Moore fo...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/18...
One of the obstacles in automatic program proving is to obtain suit-able loop invariants. The invari...
Many groups around the world conduct research on formal methods for software development, and in mos...
Any non-trivial program contains loop control structures such as while, for and do statements. A for...
Invariants are a standard concept for reasoning about unbounded loops since Floyd-Hoare logic in the...
Loops with multiple-exits and flags detract from the quality of imperative programs. They tend to ma...
AbstractA by-now-standard strategy for developing a loop invariant and loop was developed in [1] and...
The by-now-standard strategy for developing a loop invariant and loop was developed in [1] and expl...
Abstract. Loop leaping is the colloquial name given to a form of program analysis in which summaries...
We extend Meyer and Ritchie’s Loop language with higher-order procedures and procedural variables an...
Technical Report of the LACLWe extend Meyer and Ritchie's Loop language with higher-order procedures...
We present a concrete proposal for enhancing Prolog and Prolog based Constraint Logic Programming l...
This chapter describes a framework, 'Naive Iteration", which accounts for the conceptualizations und...
AbstractThis paper explains how a declarative method language, based upon the formal notations of Z ...
I am indebted to Prof. Edsgar Dijkstra for introducing me to weakest preconditions, Prof. J Moore fo...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/18...
One of the obstacles in automatic program proving is to obtain suit-able loop invariants. The invari...
Many groups around the world conduct research on formal methods for software development, and in mos...
Any non-trivial program contains loop control structures such as while, for and do statements. A for...
Invariants are a standard concept for reasoning about unbounded loops since Floyd-Hoare logic in the...
Loops with multiple-exits and flags detract from the quality of imperative programs. They tend to ma...
AbstractA by-now-standard strategy for developing a loop invariant and loop was developed in [1] and...
The by-now-standard strategy for developing a loop invariant and loop was developed in [1] and expl...
Abstract. Loop leaping is the colloquial name given to a form of program analysis in which summaries...
We extend Meyer and Ritchie’s Loop language with higher-order procedures and procedural variables an...
Technical Report of the LACLWe extend Meyer and Ritchie's Loop language with higher-order procedures...
We present a concrete proposal for enhancing Prolog and Prolog based Constraint Logic Programming l...
This chapter describes a framework, 'Naive Iteration", which accounts for the conceptualizations und...
AbstractThis paper explains how a declarative method language, based upon the formal notations of Z ...
I am indebted to Prof. Edsgar Dijkstra for introducing me to weakest preconditions, Prof. J Moore fo...
This work was also published as a Rice University thesis/dissertation: http://hdl.handle.net/1911/18...