Cristiano Calcagno. Semantic and Logical Properties of Stateful Programmming. Ph. D. dissertation, Universita di Genova, Genova, Italy, 2002. Home/Search Document Details and Download
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)
....piece of structure, and would be falsified if the disconnected piece were reclaimed by a garbage collector. In this case, the assertions are all intuitionistic, and indeed it is hard to concoct a reasonable program logic that would prohibit such a derivation. Calcagno, O Hearn, and Bornat [7, 6, 5, 4] have explored ways of avoiding this problem by defining the existential quantifier in a nonstandard way, and have defined a rich variety of logics that are insensitive to garbage collection. Unfortunately, there is no brief way of relating these logics to those discussed in this paper. 11. ....
C. Calcagno. Semantic and Logical Properties of Stateful Programmming. Ph. D. dissertation, Universita di Genova, Genova, Italy, 2002.
Program Logic and Equivalence in the - Presence Of Garbage Self-citation (Calcagno) (Correct)
No context found.
C. Calcagno. Semantic and Logical Properties of Stateful Programming. Ph.D. thesis, Univ of Genova, 2002.
Program Logic and Equivalence in the Presence of Garbage.. - Calcagno, O'Hearn, Bornat (2001) (3 citations) Self-citation (Calcagno) (Correct)
....this paper: partial states are important because the operation of partitioning a heap into disjoint parts often results in a partial state, even when the beginning state is total. A detailed account of the interaction between garbage insensitivity and separation logic proof rules may be found in [2]. We began the paper by noting a logical conundrum, and then provided an analysis of assertions that provides a technical resolution to it. The price to pay for this resolution is an unusual and unfamiliar semantics, certainly in the total states form, but even in the partial states form (the ....
....prover) It may be that the price is too high to justify a separate assertion language for practical purposes. However, the garbage insensitive assertions can be seen as special cases of the standard (intuitionistic and classical) semantics of separation logic, using : and modal embeddings; see [2]. So a less radical reaction to the conundrum would be to work with a standard semantics, and simply keep an eye out for propositions that are garbage insensitive. From this perspective the results here can be viewed as showing some of the structure that these propositions possess. Incidentally, ....
C. Calcagno. Semantic and Logical Properties of Stateful Programming. Ph.D. thesis, Univ of Genova, 2002.
Expressions, Commands, and Assertions - Reynolds (2002) (Correct)
No context found.
Cristiano Calcagno. Semantic and Logical Properties of Stateful Programmming. Ph. D. dissertation, Universita di Genova, Genova, Italy, 2002.
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