164 search results - page 5 / 33 » A Decidable Fragment of Separation Logic |
CONCUR
2011
Springer
12 years 7 months ago
2011
Springer
Abstract. In 2004, Berdine, Calcagno and O’Hearn introduced a fragment of separation logic that allows for reasoning about programs with pointers and linked lists. They showed th...
LFCS
2007
Springer
14 years 1 months ago
2007
Springer
Interval-based temporal logics are an important research area in computer science and artificial intelligence. In this paper we investigate decidability and expressiveness issues ...
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
Standard analysis on recursive data structures restrict their attention to shape properties (for instance, a program that manipulates a list returns a list), excluding properties t...
ESOP
2006
Springer
13 years 11 months ago
2006
Springer
This paper presents a new program logic designed for facilitating automated reasoning about pointer programs. The program logic is directly inspired by previous work by O'Hea...
DLOG
2008
13 years 10 months ago
2008
We show that reasoning in the temporal conceptual model ERV T , a fragment of ERV T that only allows timestamping is complete for 2-ExpTime. The membership result is based on an em...