תמונות העטיפה

Searching for points-to analysis

שמור ב:
הוצא לאור ב:IEEE Transactions on Software Engineering vol. 29, no. 10 (Oct 2003), p. 883
מחבר ראשי: Bruns, Glenn
מחברים אחרים: Chandra, Satish
יצא לאור:
IEEE Computer Society
נושאים:
Studies
Algorithms
Systems analysis
Models
Computer programming
Logic programming
Approximation
Software engineering
Graph representations
Laboratories
גישה מקוונת:Citation/Abstract
Full Text - PDF
תגים: הוספת תג
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
Resumen:The points-to analysis problem is to find the pointer relationships that could arise during program execution. Many points-to analysis algorithms exist, each making a particular trade off between cost of the analysis and precision of the results. In this paper, we show how points-to analysis algorithms can be defined as transformed versions of an exact algorithm. We present a set of program transformations over a general program model and use them to define some existing points-to analysis algorithms. Doing so makes explicit the approximations involved in these algorithms. We also show how the transformations can be used to define new points-to analysis algorithms. Our transformations are generic and may be useful in the design of other program analysis algorithms. [PUBLICATION ABSTRACT]
ISSN:0098-5589
1939-3520
DOI:10.1109/TSE.2003.1237170
Fuente:ABI/INFORM Global