Static Analysis of Accessed Regions in Recursive Data Structures

Chong, Stephen; Rugina, Radu

doi:10.1007/3-540-44898-5_26

Cited by 18 publications

(16 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our abstract domain is based on the storage shape graph [2,3] approach. LetL be a set of abstract storage offsets (variable names, field offsets, or special offsets for references stored in arrays/collections) which are related to the storage locations L by an abstraction function α offset : L →L.…”

Section: Abstract Graphsmentioning

confidence: 99%

Shape Analysis with Reference Set Relations

Marron

Majumdar

Stefanović³

et al. 2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Tracking subset relations between the contents containers on the heap is fundamental to modeling the semantics of many common programing idioms such as applying a function to a subset of objects and maintaining multiple views of the same set of objects. We introduce a relation, must reference sets, which subsumes the concept of must-aliasing and enables existing shape analysis techniques to efficiently and accurately model many types of containment properties without the use of explicit quantification or specialized logics for containers/sets. We extend an existing shape analysis to model the concept of reference sets. Reference sets allow the analysis to efficiently track a number of important relations (must-=, and must-⊆) between objects that are the targets of sets of references (variables or pointers). We show that shape analysis augmented with reference set information is able to precisely model sharing for a range of data structures in real programs that cannot be expressed using simple must-alias information. In contrast to more expressive proposals based on logic languages (e.g., extensions of first-order predicate logic with transitive closure or the use of a decision procedure for sets), reference sets can be efficiently tracked in a shape analyzer.

show abstract

Section: Abstract Graphsmentioning

confidence: 99%

Shape Analysis with Reference Set Relations

Marron

Majumdar

Stefanović³

et al. 2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Examples are the work of Chong and Rugina [7] and Rugina and Rinard [28], in which access pattern analysis is performed symbolically by the compiler to obtain bounds on memory access regions.…”

Section: Related Workmentioning

confidence: 99%

A Compile/Run-time Environment for the Automatic Transformation of Linked List Data Structures

Spek

Groot

Bakker

et al. 2008

Int J Parallel Prog

View full text Add to dashboard Cite

Irregular access patterns are a major problem for today's optimizing compilers. In this paper, a novel approach will be presented that enables transformations that were designed for regular loop structures to be applied to linked list data structures. This is achieved by linearizing access to a linked list, after which further data restructuring can be performed. Two subsequent optimization paths will be considered: annihilation and sublimation, which are driven by the occurring regular and irregular access patterns in the applications. These intermediate codes are amenable to traditional compiler optimizations targeting regular loops. In the case of sublimation, a run-time step is involved which takes the access pattern into account and thus generates a data instance specific optimized code. Both approaches are applied to a sparse matrix multiplication algorithm and an iterative solver: preconditioned conjugate gradient. The resulting transformed code is evaluated using the major compilers for the x86 platform, GCC and the Intel C compiler.

show abstract

“…For the special case of singly-linked lists, another approach for modular shape analysis is presented in [7] without an implementation. The main idea there is to record for every object both its current properties and the properties it had at that time the procedure was invoked.…”

Section: Related Workmentioning

confidence: 99%

Interprocedural Shape Analysis for Cutpoint-Free Programs

2005

View full text Add to dashboard Cite

We present a framework for interprocedural shape analysis, which is contextand flow-sensitive with the ability to perform destructive pointer updates. We limit our attention to cutpoint-free programs-programs in which reasoning on a procedure call only requires consideration of context reachable from the actual parameters. For such programs, we show that our framework is able to perform an efficient modular analysis. Technically, our analysis computes procedure summaries as transformers from inputs to outputs while ignoring parts of the heap not relevant to the procedure. This makes the analysis modular in the heap and thus allows reusing the effect of a procedure at different call-sites and even between different contexts occurring at the same call-site. We have implemented a prototype of our framework and used it to verify interesting properties of cutpoint-free programs, including partial correctness of a recursive quicksort implementation.

show abstract

Static Analysis of Accessed Regions in Recursive Data Structures

Cited by 18 publications

References 17 publications

Shape Analysis with Reference Set Relations

Shape Analysis with Reference Set Relations

A Compile/Run-time Environment for the Automatic Transformation of Linked List Data Structures

Interprocedural Shape Analysis for Cutpoint-Free Programs

Contact Info

Product

Resources

About