193 search results - page 4 / 39 » Decidable logics combining heap structures and data |
81
Voted
ENTCS
2007
14 years 9 months ago
2007
We present local Hoare reasoning about data update, using Context Logic for analysing structured data. We apply our reasoning to tree update, heap update which is analogous to loc...
VMCAI
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...
ESOP
2010
Springer
15 years 6 months ago
2010
Springer
Type-based amortised resource analysis following Hofmann and Jost--where resources are associated with individual elements of data structures and doled out to the programmer under ...
111
Voted
CADE
2007
Springer
15 years 9 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
120
click to vote
AMAST
2006
Springer
15 years 1 months ago
2006
Springer
This paper proposes a modal extension of Separation Logic [8, 11] for reasoning about data-parallel programs that manipulate heap allocated linked data structures. Separation Logi...