10 citations · 15 across the 9 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2019★ 1 cited
A Stricter Heap Separating Points-To Logic
René Haberland, Kirill Krinkin
Dynamic memory issues are hard to locate and may cost much of a development project's efforts and was repeatedly reported similarly afterwards independently by different persons. V…
cs.LO2019★ 2 cited
Abstract Predicate Entailment over Points-To Heaplets is Syntax Recognition
René Haberland, Kirill Krinkin, Sergey Ivanovskiy
Abstract predicates are considered in this paper as abstraction technique for heap-separated configurations, and as genuine Prolog predicates which are translated straight into a c…
cs.LO2019★ 1 cited
A Non-repetitive Logic for Verification of Dynamic Memory with Explicit Heap Conjunction and Disjunction
René Haberland, Kirill Krinkin
In this paper, we review existing points-to Separation Logics for dynamic memory reasoning and we find that different usages of heap separation tend to be an obstacle. Hence, two t…