S.A. Cook and D. Oppen. An assertion language for data structures. In: POPL, pp. 160--166. ACM Press, 1975.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... is a revised draft of a paper to appear in Millennial Perspectives in Computer Science , the proceedings of the Oxford Microsoft Symposium in Honour of Sir Tony Hoare, held September 13 15, 1999) to be published by Palgrave. It supercedes the version (dated August 12, 1999) that was distributed at the meeting, which contained a serious error. Intuitionistic Reasoning about Shared Mutable Data Structure John C. Reynolds Department of Computer Science Carnegie Mellon ....

....there has been surprisingly little research on reasoning about such programs. In 1972, Burstall [1] gave correctness proofs for imperative programs that alter data structures, by using a novel kind of assertion that he called a distinct nonrepeating tree system ; this approach was extended by Kowaltowski [2] In 1975, Cook and Oppen [3, 4] devised an more general approach by extending Hoare logic with extremely complicated inference rules. Then, in 1981, J. M. Morris [5] extended weakest precondition logic by generalizing the notion of substitution. In the late 80 s Mason and Talcott [6, 7, 8] investigated ....

[Article contains additional citation context not shown here]

Stephen A. Cook and Derek C. Oppen. An assertion language for data structures. In Conference Record of the Second ACM Symposium on Principles of Programming Languages, pages 160--166, New York, 1975. ACM.

.... builds upon foundational work by other groups on syntactic control of interference [31] linear logic [13] and linear type systems in functional programming languages [20, 42, 1, 15, 3, 8, 40] Our research also has much in common with e orts to de ne program logics for reasoning about aliasing [6, 9, 26, 32, 17]. In particular, if we view propositions as types, there are striking similarities with recent work by Reynolds [32] who builds on earlier research by Burstall [6] Reynolds logic employs a spatial conjunction, which, like our operator, joins two operands that depend upon disjoint portions of ....

Stephen Cook and Derek Oppen. An assertion language for data structures. In Second ACM Symposium on Principles of Programming Languages, pages 160-166, New York, 1975. ACM Press.

....number of examples dealing with a variety of data structures. In all cases, we check for memory errors and possible violations of the data structure invariants: Singly linked lists with the operations reverse, search, zip, delete, insert, and rotate. These examples have been scrutinized before [8, 24, 32]. We also include the concat operation on lists with tail pointers from Section 1. We have tried bubblesort as in [31] but with various degrees of abstraction of the data: In bubblesort simple, the record values are abstracted away so only null pointer dereferences are checked for; in bubblesort ....

Stephen A. Cook and Derek C. Oppen. An assertion language for data structures. In Principles of Programming Languages, POPL'75, pages 160--166, 1975.

.... : ds 0 , DH; q; ds 0 ; s 1 ; s 0 1 ) q = q e ) 9ds 1 : W t2 Trans(ds 0 ; ds 1 ; t) Notice the local nature of Next ; they only mention each step as opposed to a whole sequence of computation, which is usually the case in the encodings with a list data type or a graph data type in [2, 3]. We need one more formula which says that all e 6 variables t, f, q 0 , q e , DH, DS1, DS2 denote distinct values: Disjoint = v;w2ft;f;q 0 ; q e ;DH;DS1;DS2g;v6 w (v 6= w) where we use to mean that two variables are the same as symbols. Lemma 2. Let (q 0 ; 0 ; 0 ) be ....

S. A. Cook and D.C. Oppen. An assertion language for data structures. In Principles of Programming Languages, pages 160-166. ACM, 1975.

.... builds upon foundational work by other groups on syntactic control of interference [31] linear logic [13] and linear type systems in functional programming languages [20, 42, 1, 15, 3, 8, 40] Our research also has much in common with efforts to define program logics for reasoning about aliasing [6, 9, 26, 32, 17]. In particular, if we view propositions as types, there are striking similarities with recent work by Reynolds [32] who builds on earlier research by Burstall [6] Reynolds logic employs a spatial conjunction, which, like our Omega operator, joins two operands that depend upon disjoint ....

Stephen Cook and Derek Oppen. An assertion language for data structures. In Second ACM Symposium on Principles of Programming Languages, pages 160--166, New York, 1975. ACM Press.

....number of examples dealing with a variety of data structures. In all cases, we check for memory errors and possible violations of the data structure invariants: Singly linked lists with the operations reverse, search, zip, delete, insert, and rotate. These examples have been scrutinized before [8, 25, 32]. We also include the concat operation on lists with tail pointers from Section 1. We have tried bubblesort as in [31] but with various degrees of abstraction of the data: In bubblesort simple, the record values are abstracted away so only null pointer dereferences are checked for; in bubblesort ....

Stephen A. Cook and Derek C. Oppen. An assertion language for data structures. In 2nd ACM Symposium on Principles of Programming Languages, pages 160{ 166, 1975. 9

....number of examples dealing with a variety of data structures. In all cases, we check for memory errors and possible violations of the data structure invariants: Singly linked lists with the operations reverse, search, zip, delete, insert, and rotate. These examples have been scrutinized before [8, 25, 32]. We also include the concat operation on lists with tail pointers from Section 1. We have tried bubblesort as in [31] but with various degrees of abstraction of the data: In bubblesort simple, the record values are abstracted away so only null pointer dereferences are checked for; in bubblesort ....

Stephen A. Cook and Derek C. Oppen. An assertion language for data structures. In 2nd ACM Symposium on Principles of Programming Languages, pages 160-- 166, 1975. 9

.... fOE gxf g fOEg : xf g (viii) OE OE 0 fOE 0 gxf 0 g 0 fOEgxf g An equivalent characterization is: 8s (F; s j= 9s 0 2 jF j (F; s 0 j= OE F j= s 0 P Gamma s) We say that F is strongly expressive if all strongest postconditions can be expressed in P (cf. Cook and Oppen 1975). In this case the strongest postcondition of OE and P is denoted as sp(OE; P ) In Table 10 we give a simple proof system for deriving partial correctness assertions, assuming expressibility of strongest postconditions of actions. Soundness follows straightforward. Furthermore, in case a frame ....

Cook, S.A., and D.C. Oppen. 1975. An Assertion Language for Data Structures. In Conference Record of the 2 nd ACM Symposium on Principles of Programming Languages, 160--166.

No context found.

S.A. Cook and D. Oppen. An assertion language for data structures. In: POPL, pp. 160--166. ACM Press, 1975.

No context found.

S.A. Cook and D. Oppen. An assertion language for data structures. In: POPL, pp. 160--166. ACM Press, 1975.

No context found.

Stephen A. Cook and Derek C. Oppen. An assertion language for data structures. In Conference Record of the Second ACM Symposium on Principles of Programming Languages, pages 160-166, New York, 1975. ACM.

No context found.

S. A. COOK AND D. C. OPPEN, An assertion language for data structures, in Proc. 2nd ACM Symposium on Principles of Programming Languages, POPL '75, January 1975.

No context found.

Stephen A. Cook and Derek C. Oppen. An assertion language for data structures. In Conference Record of the Second ACM Symposium on Principles of Programming Languages, pages 160-166, New York, 1975. ACM.

No context found.

Stephen A. Cook and Derek C. Oppen. An assertion language for data structures. In Conference Record of the Second ACM Symposium on Principles of Programming Languages, pages 160--166, New York, 1975. ACM.

No context found.

Cook, S. A., and Oppen, D. C. An assertion language for data structures. In Conference Record of the Second ACM Symposium on Principles of Programming Languages (1975), pp. 160-166

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