146 search results - page 8 / 30 » Local Reasoning about Programs that Alter Data Structures |
172
Voted
POPL
2005
ACM
15 years 10 months ago
2005
ACM
Spatial logics have been used to describe properties of treelike structures (Ambient Logic) and in a Hoare style to reason about dynamic updates of heap-like structures (Separatio...
FOSSACS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Separation logic is a recent extension of Hoare logic for reasoning about programs with references to shared mutable data structures. In this paper, we provide a new inte...
73
Voted
VMCAI
2009
Springer
15 years 4 months ago
2009
Springer
Vectors and bags are basic collection data structures, which are used frequently in programs and specifications. Reasoning about these data structures is supported by established ...
CC
2005
Springer
15 years 3 months ago
2005
Springer
In this paper, we present a formal description of data slicing, which is a type-directed program transformation technique that separates a program’s heap into several independent...
VALUETOOLS
2006
ACM
15 years 3 months ago
2006
ACM
Cache locality optimization is an efficient way for reducing the idle time of modern processors in waiting for needed data. This kind of optimization can be achieved either on the...