Morris, J.: Assignment and linked data structures. In: Theoretical Foundations of Programming Methodology. D. Reidel Publishing Co. (1982)  Home/Search   Document Not in Database   Summary   Related Articles   Check

....analyzes the list reversal example fully automatically, in contrast to our use of user supplied approximation hints. However, we believe that it is possible to automate the heuristics we have used for identifying approximations, so that programs such as this are handled fully automatically. In [25, 27], wp for reachability is calculated, but no other shape predicates are considered. Predicate abstraction, combined with model checking, has been used in analyses of some heap properties: points to analysis [1] correctness of concurrent garbage collectors [10, 9] and loop invariants [13] These ....

J. Morris. (1) A general axiom of assignment (2) Assignment and linked data structures. In M. Broy and G. Schmidt, editors, Theoretical Foundations of Programming Methodology, 1981.

....clear to us whether L r (or a decidable extension of L r ) can be used to amplify the results obtained via the techniques described in the present paper. Morris studied the use of a reachability predicate x v j K for establishing properties of programs that manipulate linked lists and trees [Morris 1982]. The predicate x v j K means v is a node reachable from variable x via a path that avoids nodes pointed to by variables in set K . Morris discussed techniques that, given a statement and a post condition, generate a formula that captures the weakest precondition. It is not clear to us how this ....

Morris, J. 1982. Assignment and linked data structures. In Theoretical Foundations of Programming Methodology, M. Broy and G. Schmidt, Eds. D. Reidel Publishing Co., Boston, MA, 35-41.

....; next ; i Gamma 1) if i 1 r 2 dom col Note that this function is undefined when an object s next value is not a reference into col . Morris uses a connectivity relation (x s Gamma y) that is similar to (9i 0 ffl deref (col ; x ; s ; i) y) to reason about linked data structures [Mor82a] LinkQueue b = Queue # 0 B B B B B B B B B B B B self:col 2 Coll self:hd 2 Ref self :s = self:hd = Nil self:hd 6= Nil ) self :hd 2 dom self:col deref (self:col ; self:hd ; next ; #self:s) next = Nil 0 B 8i 2 dom self :s ffl deref (self:col ; self:hd ; next ; ....

J. M. Morris. Assignment and linked data structures. In Manfred Broy and Gunther Schmidt, editors, Theoretical Foundations of Programming Methodology, pages 35--41. D. Reidel Publishing Company, 1982. NATO advanced study institutes series, Series C, Vol 91. Ref. on page 133.

....an assertion that a recursive call returns a sorted list. Our emphasis to date has been on purely automatic analyses, where the only user supplied assertion required is one that characterizes the input to the procedure. that has always been considered quite di#cult in the verification community [21]. A surprising fact about our work is that it shows that, in some cases, the problem can be addressed by means of static program analysis. Our work also addresses pointer indirections and aliases, which are especially di#cult to handle when heap allocated elements are considered. Model checking ....

J.M. Morris. Assignment and linked data structures. In M. Broy and G. Schmidt, editors, Theoretical Foundations of Programming Methodology, pages 35--41. D. Reidel Publishing Co., Boston, MA, 1982.

....object. 73 Correctness formulas are often called correctness assertions, in connection with more traditional Hoare style proof systems, but assertion is a name that becomes inadequate in the presence of the result value. 74 See e.g. dB80, Gri81, LS87, AO91, Fra92] 75 See e.g. OC75, Kow79, Mor82] 22 Issues in the design of the specification language A basic characteristic of Hoare style proof systems is the fact that the meaning of assertions is a predicate of one state (i.e. the initial state in the precondition and the final state in the postcondition) 76 This leads to the use ....

J.M. Morris. Assignment and Linked Data Structures. In M. Broy and G. Schmidt, editors, Theoretical Foundations of Programming Methodology, pages 35--41. D. Reidel Publishing Company, 1982.

No context found.

Morris, J.: Assignment and linked data structures. In: Theoretical Foundations of Programming Methodology. D. Reidel Publishing Co. (1982)

No context found.

J. Morris. Assignment and linked data structures. In: Th.Found.ofProgr.Meth., pp. 25--34. Reidel, 1981.

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