Safe Approximation of Data Dependencies in Pointer-Based Structures

Abstract

This paper describes a new approach to the analysis of dependencies in complex, pointer-based data structures. Structural information is provided by the programmer in the form of two-variable finite state automata (2FSA). Our method extracts data dependencies. For restricted forms of recursion, the data dependencies can be exact; however in general, we… (More)
DOI: 10.1007/3-540-45574-4_20

Topics

6 Figures and Tables

Cite this paper

@inproceedings{Arvind2000SafeAO, title={Safe Approximation of Data Dependencies in Pointer-Based Structures}, author={D. K. Arvind and T. A. Lewis}, booktitle={LCPC}, year={2000} }