H. Yang. Local Reasoning for Stateful Programs. PhD thesis, Dept. of Computer Science, University of Illinois, Urbana-Champaign, June 2001. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Separation Logic: A Logic for Shared Mutable Data Structures - Reynolds (2002) (104 citations) (Correct)
....I generalized the logic to permit reasoning about unrestricted address arithmetic, by regarding addresses as integers which refer to individual fields [24, 30, 29] It is this form of the logic that will be described and used in most of the present paper. We will also describe O Hearn s frame rule [24, 35, 34, 19], which permits local reasoning about components of programs. Since these logics are based on the idea that the structure of an assertion can describe the separation of storage into disjoint components, we have come to use the term separation logics, both for the extension of predicate calculus ....
.... ) q = true (p ) q) q = true (p , q) then the assertions built from pure assertions and e , e , using these operations and , 8, 9, and form the image of Ishtiaq and O Hearn s modal translation from intuitionistic separation logic to the classical version [19] Yang [33, 34] has singled out the class of strictly exact assertions; an assertion q is strictly exact iff, for all s, h, and , q] sh and [ q] sh implies h = h . Syntactically, assertions built from expressions using 7 and are strictly exact. The utility of this concept is that (q true) ....
[Article contains additional citation context not shown here]
H. Yang. Local Reasoning for Stateful Programs. Ph. D. dissertation, University of Illinois, Urbana-Champaign, Illinois, July 2001.
Program Logic and Equivalence in the Presence of Garbage.. - Calcagno, O'Hearn, Bornat (2001) (3 citations) (Correct)
....s; h i P Q, hence s; h 0 g 0 i Q by Partial Shrinkage of Q. This proves Partial Shrinkage for . 14 Program Logic, II We now describe two ways in which the intuitionistic semantics can be used to obtain an improved program logic. The treatment here is just a sketch; we refer to [9, 14, 17] for more information on the low level viewpoint adopted in this section. The rst improvement is to use to express weakest preconditions for allocation and heap update [9] 28 9xy: E 7 x; y) E 7 E 0 ; y) P ) E:1 : E 0 P 8x 0 : x 0 7 E 1 ; E 2 ) P [x 0 =x] ....
....go wrong, and 29 if C; s; h ; s 0 ; h 0 then s 0 ; h 0 i Q. According to this interpretation, ftrueg if x = nil then skip else x:1 : 5 ftrueg is no longer a true triple, because the command goes wrong when applied to the state [x 7 p] for some pointer p. We refer to [14, 17] for more information on the low level interpretation of triples and the Frame Rule. 15 Final Remarks In this paper we have presented a number of semantic models, and two interpretations of Hoare triples. The reason for this variety is mainly presentational. The most satisfactory program logic, ....
H. Yang. Local Reasoning for Stateful Programs. Ph.D. thesis, Univ of Illinois at Urbana-Champaign, 2001. 32
A Semantic Basis for Local Reasoning - Hongseok Yang And (2002) (6 citations) Self-citation (Yang) (Correct)
No context found.
H. Yang. Local Reasoning for Stateful Programs. Ph.D. thesis, University of Illinois, Urbana-Champaign, Illinois, USA, 2001.
Correctness of Data Representations involving Heap Data Structures - Reddy, Yang (2003) (1 citation) Self-citation (Yang) (Correct)
....conditions in our de nitions. Where there is information leakage, our semantics explicates the breakdown of the data encapsulation, so that faulty conclusions are avoided. Our treatment bears a close relationship with the ongoing work on separation logic for local reasoning about heap storage [22, 11, 28]. In particular, our relations are local in the same sense as the assertions of separation logic. We use the ideas of partial heaps and heap splitting developed there to formulate the relations. We envisage that in future work, these connections with local reasoning will be further ....
....the two parts ( R) W W will be referred to as a relational correspondence. Such a correspondence determines a relation between state sets expressed as EQ R, where EQ means that the related locations have equal values (modulo ) and the connective, adapted from separation logic [22, 11, 28], means that the two parts of the relation access disjoint sets of locations. Now, a state transformation that preserves EQ R is allowed to look up and update related locations. It is also allowed to store pointers to related locations in other locations. However, it cannot store pointers ....
[Article contains additional citation context not shown here]
Yang, H. Local reasoning for stateful programs. Tech. Rep. UIUCDCS-R-
A Semantic Basis for Local Reasoning - Yang, O'Hearn (2002) (6 citations) Self-citation (Yang) (Correct)
....transformers, which satisfy a condition that ensures soundness of the Frame Rule, then to show the connection between this condition and the locality properties of the operational semantics discussed in Section 4, and nally to prove the completeness result. We refer the reader to Yang s thesis [10] for further results, omitted here for space reasons, on when a local predicate transformer corresponds to a relation on states, and on when the completeness result can be formulated in terms of relations rather than transformers. 5.1 Local Predicate Transformers In a predicate transformer ....
H. Yang. Local Reasoning for Stateful Programs. Ph.D. thesis, University of Illinois, Urbana-Champaign, Illinois, USA, 2001.
Local Reasoning about Programs that Alter Data Structures - O'Hearn, Reynolds, Yang (2001) (19 citations) Self-citation (Yang) (Correct)
.... 9 to form a let binder (where n 6 2 Free(E; P; x) fP [E=x]gx : EfPg f9n: true E 7 n) P [n=x]gx : E]fPg The formal derivations of these laws from the small axioms make heavy use of Variable Substitution and Auxiliary Variable Elimination; the details are contained in Yang s thesis [24]. Another useful derived law for x : E] is for the case when x 6 2 Free(E; R) y 6 2 Free(E) and when the precondition is of the form (E 7 y) R. Then, f(E 7 y) Rgx : E] f(E 7 x) R[x=y]g: 5 Beyond the Core In the next few sections we give some examples of the formalism at work. In ....
....to give a precise comparison with ideas from the AI literature [22] as well as with variations on Modi es clauses [1, 8] We hope to report further on these matters in particular on the ideas outlined in Section 8 in the future. Several relevant developments can be found in Yang s thesis [24]. There are several immediate directions for further work. First, the interaction between local and global reasoning is in general dicult, and we do not mean to imply that things always go as smoothly as in the example programs we chose. They t our formalism nicely because their data structures ....
H. Yang. Local Reasoning for Stateful Programs. Ph.D. thesis, University of Illinois, Urbana-Champaign, Illinois, USA, 2001 (expected).
Automated Verification of the Deutsch-Schorr-Waite - Tree-Traversal Algorithm Alexey (Correct)
No context found.
H. Yang. Local Reasoning for Stateful Programs. PhD thesis, Dept. of Computer Science, University of Illinois, Urbana-Champaign, June 2001.
Typed Stateful Programming - Zhu (2004) (Correct)
No context found.
H. Yang. Local Reasoning for Stateful Programs. PhD thesis, Univ of Illinois at Urbana-Champaign, July 2001.
Separation Logic and Abstraction - Parkinson, Bierman (2005) (2 citations) (Correct)
No context found.
H. Yang. Local reasoning for stateful programs. PhD thesis, University of Illinois, July 2001.
Using Separation Logic to go from Functional Specifications to .. - Rezk, Blanco (2003) (Correct)
No context found.
Yang H. Local Reasoning for Stateful Programs. Ph.D dissertation. University of Illinois. Urbana-Champaign. Illinois. 2001.
Elimination of Spatial Connectives in Static Spatial Logics - Lozes (2004) (Correct)
No context found.
Hongseok Yang. Local Reasoning for Stateful programs. PhD thesis, University of Illinois at Urbana Champaign, 2001. 29
Expressions, Commands, and Assertions - Reynolds (2002) (Correct)
No context found.
Hongseok Yang. Local Reasoning for Stateful Programs. Ph. D. dissertation, University of Illinois, UrbanaChampaign, Illinois, July 2001.
Local Reasoning, Separation and Aliasing - School (2004) (Correct)
No context found.
H. Yang. Local Reasoning for Stateful Programs. Ph.D. thesis, University of Illinois, Urbana-Champaign, Illinois, USA, 2001.
Proving Pointer Programs in Higher-Order Logic - Mehta, Nipkow (2003) (16 citations) (Correct)
No context found.
H. Yang. Local Reasoning for Stateful Programs. PhD thesis, University of Illinois, Urbana-Champaign, 2001.
Local Reasoning about a Copying Garbage Collector - Birkedal, Torp-Smith, Reynolds (2004) (7 citations) (Correct)
No context found.
H. Yang. Local Reasoning for Stateful Programs. PhD thesis, University of Illinois, Urbana-Champaign, 2001.
Comparing the expressive power of Separation logic and classical.. - Lozes (2004) (Correct)
No context found.
Hongseok Yang. Local Reasoning for Stateful programs. PhD thesis, University of Illinois at Urbana Champaign, 2001.
Semantic and Logical Properties of Stateful Programming - Calcagno (2002) (2 citations) (Correct)
No context found.
Hongseok Yang. Local Reasoning for Stateful Programs. Ph.D. thesis, Univ of Illinois at Urbana-Champaign, 2001.
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