50 search results - page 2 / 10 » Assertions for Dynamic Shape Analysis of List Data Structure... |
144
Voted
VMCAI
2010
Springer
16 years 19 days ago
2010
Springer
Abstract. Device drivers often keep data in multiple data structures simultaneously while embedding list or tree related records into the records containing the actual data; this r...
109
Voted
SAS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Developer-supplied data structure specifications are important to shape analyses, as they tell the analysis what information should be tracked in order to obtain the des...
135
click to vote
TGC
2010
Springer
15 years 1 months ago
2010
Springer
Recent work in resource analysis has translated the idea of amortised resource analysis to imperative languages using a program logic that allows mixing of assertions about heap sh...
120
click to vote
ATVA
2009
Springer
15 years 10 months ago
2009
Springer
We present a new approach for automatic verification of data-dependent programs manipulating dynamic heaps. A heap is encoded by a graph where the nodes represent the cells, and t...
139
Voted
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...