Transitive Separation Logic
نویسندگان
چکیده
Separation logic (SL) is an extension of Hoare logic by operations and formulas that not only talk about program variables, but also about heap portions. Its general purpose is to enable more flexible reasoning about linked object/record structures. In the present paper we give an algebraic extension of SL at the data structure level. We define operations that additionally to heap separation make assumptions about the linking structure. Phenomena to be treated comprise reachability analysis, (absence of) sharing, cycle detection, preservation of substructures under destructive assignments. We demonstrate the practicality of this approach with the examples of in-place list-reversal and tree rotation.
منابع مشابه
A Decidable Fragment of Separation Logic
We present a fragment of separation logic oriented to linked lists, and study decision procedures for validity of entailments. The restrictions in the fragment are motivated by the stylized form of reasoning done in example program proofs. The fragment includes a predicate for describing linked list segments (a kind of reachability or transitive closure). Decidability is first proved by semanti...
متن کاملA Note about Stable Transitivity of Noncompact Extensions of Hyperbolic Systems
Let f : X → X be the restriction to a hyperbolic basic set of a smooth diffeomorphism. If G is the special Euclidean group SE(2) we show that in the set of C2 G-extensions of f there exists an open and dense subset of stably transitive transformations. If G = K × Rn, where K is a compact connected Lie group, we show that an open and dense set of C2 G-extensions satisfying a certain separation c...
متن کاملExtended transitive separation logic
Separation logic (SL) is an extension of Hoare logic by operators and formulas for reasoning more flexibly about heap portions or linked object/record structures. In the present paper we give an algebraic extension of SL at the data structure level. At the same time we step beyond standard SL by studying not only domain disjointness of heap portions but also disjointness along transitive links....
متن کاملLao separation verbs and the logic of linguistic event categorization
While there are infinite conceivable events of material separation, those actually encoded in the conventions of a given language’s verb semantics number only a few. Furthermore, there appear to be crosslinguistic parallels in the native verbal analysis of this conceptual domain. What are the operative distinctions, and why these? This article analyses a key subset of the bivalent (transitive) ...
متن کاملCanonical Formulas for Wk4
We generalize the theory of canonical formulas for K4 (the logic of transitive frames) to wK4 (the logic of weakly transitive frames). Our main result establishes that each logic over wK4 is axiomatizable by canonical formulas, thus generalizing Zakharyaschev’s theorem for logics over K4. The key new ingredients include the concepts of transitive and strongly cofinal subframes of weakly transit...
متن کامل