Static Analysis of Recursive Data Structures
. The static analysis of imperative languages is made difficult by the unrestricted pointer structures which makes their analysis imprecise. A static analysis approach is proposed for a class of graph structures, where the regularity is described by the programmer via a Markov algorithm. The method...
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Text |
Language: | English |
Published: |
Springer-Verlag
1998
|
Subjects: | |
Online Access: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.489 http://www.dcs.ed.ac.uk/~tl/lcpc97/doc.ps |
id |
ftciteseerx:oai:CiteSeerX.psu:10.1.1.27.489 |
---|---|
record_format |
openpolar |
spelling |
ftciteseerx:oai:CiteSeerX.psu:10.1.1.27.489 2023-05-15T18:32:40+02:00 Static Analysis of Recursive Data Structures Arvind And Lewis D. K. Arvind T. A. Lewis The Pennsylvania State University CiteSeerX Archives 1998 application/postscript http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.489 http://www.dcs.ed.ac.uk/~tl/lcpc97/doc.ps en eng Springer-Verlag http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.489 http://www.dcs.ed.ac.uk/~tl/lcpc97/doc.ps Metadata may be used without restrictions as long as the oai identifier remains attached to it. http://www.dcs.ed.ac.uk/~tl/lcpc97/doc.ps text 1998 ftciteseerx 2016-01-07T20:34:57Z . The static analysis of imperative languages is made difficult by the unrestricted pointer structures which makes their analysis imprecise. A static analysis approach is proposed for a class of graph structures, where the regularity is described by the programmer via a Markov algorithm. The method is illustrated with an example. 1 Motivation The static analysis of programs involving arrays with a view towards their automatic parallelisation has been studied in [2]. In contrast, the static analysis of pointer-based data structures is relatively more complicated. These structures can be viewed as a graph of values, with no restrictions placed on which values the pointers point to. In practice, they may often resemble trees or lists, but there is no requirement for them to conform to these structures. Consequently, any analysis cannot make such assumptions, unless the properties of the structures can be derived during the analysis of the code. The approach adopted here is for the p. Text The Pointers Unknown |
institution |
Open Polar |
collection |
Unknown |
op_collection_id |
ftciteseerx |
language |
English |
description |
. The static analysis of imperative languages is made difficult by the unrestricted pointer structures which makes their analysis imprecise. A static analysis approach is proposed for a class of graph structures, where the regularity is described by the programmer via a Markov algorithm. The method is illustrated with an example. 1 Motivation The static analysis of programs involving arrays with a view towards their automatic parallelisation has been studied in [2]. In contrast, the static analysis of pointer-based data structures is relatively more complicated. These structures can be viewed as a graph of values, with no restrictions placed on which values the pointers point to. In practice, they may often resemble trees or lists, but there is no requirement for them to conform to these structures. Consequently, any analysis cannot make such assumptions, unless the properties of the structures can be derived during the analysis of the code. The approach adopted here is for the p. |
author2 |
The Pennsylvania State University CiteSeerX Archives |
format |
Text |
author |
Arvind And Lewis D. K. Arvind T. A. Lewis |
spellingShingle |
Arvind And Lewis D. K. Arvind T. A. Lewis Static Analysis of Recursive Data Structures |
author_facet |
Arvind And Lewis D. K. Arvind T. A. Lewis |
author_sort |
Arvind And Lewis |
title |
Static Analysis of Recursive Data Structures |
title_short |
Static Analysis of Recursive Data Structures |
title_full |
Static Analysis of Recursive Data Structures |
title_fullStr |
Static Analysis of Recursive Data Structures |
title_full_unstemmed |
Static Analysis of Recursive Data Structures |
title_sort |
static analysis of recursive data structures |
publisher |
Springer-Verlag |
publishDate |
1998 |
url |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.489 http://www.dcs.ed.ac.uk/~tl/lcpc97/doc.ps |
genre |
The Pointers |
genre_facet |
The Pointers |
op_source |
http://www.dcs.ed.ac.uk/~tl/lcpc97/doc.ps |
op_relation |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.27.489 http://www.dcs.ed.ac.uk/~tl/lcpc97/doc.ps |
op_rights |
Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
_version_ |
1766216865884930048 |