Search Results

As an alternative to reasoning about references explicitly and ACM SIGSOFT Software Engineering Notes Page 18 July 2018 Volume 43 Number 3 routinely as needed for Java-like programs, this paper summarizes the RESOLVE approach in reasoning via reference-...

We argue that synthesizing operations on recursive linked data structures is not as hard as it appears and is, in fact, within reach of current SAT-based synthesis techniques - with the addition of a simple approach that we describe to decompose the ...

While the use of pointers can be minimized by language mechanisms for data abstraction, alias avoidance and control, and disciplined software development techniques, ultimately, any verifying compiler effort must be able to verify code that makes use of ...

The memory subsystem is one of the major performance bottlenecks in modern computer systems. While much effort is spent on the optimization of codes which access data regularly, not all codes will do so. Programs using pointer linked data structures are ...

Prefetching is often used to overlap memory latency with computation for array-based applications. However, prefetching for pointer-intensive applications remains a challenge because of the irregular memory access pattern and pointer-chasing problem. In ...

Orientation-based representations (OBR's) have many advantages. Three orientation-based differential geometric representations in computer vision literature are critically examined. The three representations are the extended Gaussian image (EGI), the ...

Two linked data structures utilizing virtual backpointers, the virtual double-linked list (VDLL) and the B-tree with virtual backpointers (VBT), are described. Four experiments that provide example measurements of the capabilities (behavior under ...