Ana Milanova, Atanas Rountev, and Barbara G. Ryder, \Precise Call Graph Construction in the Presence of Function Pointers," in Proceedings of the 2nd International Workshop on Source Code Analysis and Manipulation, Montreal, Canada, Oct. 2002, IEEE Computer Society Press. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Locating Features in Source Code - Eisenbarth, Koschke, Simon (2003) (2 citations) (Correct)
....vary in precision and costs. Interestingly enough, Milanova and others have recently 4 presented empirical data indicating that less expensive and theoretically less precise techniques to resolve function pointers reach the precision of more expensive and theoretically more precise techniques [19] due to the common way of using function pointers (as opposed to pointers to stack and heap objects) III. Formal Concept Analysis This section presents the necessary background information on formal concept analysis. Readers already familiar with concept analysis can skip to the next section. ....
Ana Milanova, Atanas Rountev, and Barbara G. Ryder, \Precise Call Graph Construction in the Presence of Function Pointers," in Proceedings of the 2nd International Workshop on Source Code Analysis and Manipulation, Montreal, Canada, Oct. 2002, IEEE Computer Society Press.
Secure Execution Environment via Program Shepherding - Kiriansky (2003) (Correct)
....analysis to disambiguate between the potential values of the used function pointers. Current research on pointer analyses [1, 58, 59, 15, 34] o ers di erent tradeo s between accuracy and scalability. Previous points to analyses for C have also been speci cally applied to call graph construction [33, 41]. 7.1 Points to Analysis We have employed a context insensitive, ow insensitive Andersen s [1] style points to analysis using projection merging [59] and cycle elimination [23] It is implemented using the Banshee [4] analysis toolkit to build a customized constraint resolution engine. The C ....
....eld names are ignored and only the base object is looked at. Therefore, the analysis may produce larger than the actual points53 to sets. According to the notion in [34] it is eld independent similar to the works in [59, 15, 58] However, eld based analyses that ignore the base are suggested [33, 41] to be more accurate for call graph construction. We further plan to use the intersection of result sets of both types of analysis to provide even more accurate points to sets. In this thesis we will discuss only the performance of the eld independent instance of our analysis. 7.1.1 Dynamic ....
[Article contains additional citation context not shown here]
A. Milanova, A. Rountev, and B. G. Ryder. Precise call graph construction in the presence of function pointers. In Proceedings of the Second IEEE International Workshop on Source Code Analysis and Manipulation, October 2002. (SCAM'02).
Precise Call Graph Construction in the Presence of.. - Milanova, Rountev, Ryder (2001) (2 citations) Self-citation (Milanova Rountev Ryder) (Correct)
....define the notion of a most precise pointer solution. Any analysis that fits in this model computes a solution that is either the same as, or an over approximation of the most precise solution. To simplify the presentation, we omit the formal description of our model (the details can be found in [12]) and we only describe the major points of the model and the corresponding most precise solution. We consider analyses that represent the program using an interprocedural control flow graph (ICFG) G = N, E, n 0 ) which contains control flow graphs for all procedures in the program. The set of ....
A. Milanova, A. Rountev, and B.G. Ryder. Precise call graph construction in the presence of function pointers. Technical Report DCS-TR-442, Rutgers University, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC