Murphy, G., Notkin, D., Griswold, W., and Lan, E.: 1998, `An Empirical Study of Static Call Graph Extractors'. ACM Trans. on Software Engineering and Methodology 7(2), 158--191.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....computed by analysis X with the solution computed by analysis Y . Our work determines the absolute precision of the FA analysis, by comparing it with the fully precise analysis . We believe that such evaluations of absolute precision are more useful and informative. Work by Murphy et al. [15] studies several commercial tools for call graph extraction for C programs. This work focuses on the complex design and engineering aspects of tool development, and evaluates how design decisions affect the resulting call graphs. One observation presented in the paper is that the majority of ....

G. Murphy, D. Notkin, W. Griswold, and E. Lan. An empirical study of static call graph extractors. ACM Trans. on Software Engineering and Methodology, 7(2):158--191, April 1998.

....may have had an effect on the value of that variable [3, 4] A program slicer can be useful during debugging. As another example, a call graph extractor determines the calling relationships of the functions in the program, and presents a graphical view of which functions call which other functions [5, 6]. Such a view is useful in trying to anticipate how a change to one function may affect the rest of the system. Recent work has focused on the efficiency [7, 8, 9] and precision [10] of such tools. In order to compute correct information, an analysis tool often needs to analyze the entire ....

G. C. Murphy, D. Notkin, and E. S.-C. Lan. An empirical study of static call graph extractors. In Proceedings of the 18th International Conference on Software Engineering, pages 90--99, Berlin, Germany, March 1996.

....is a fundamental problem in reverse engineering, since all subsequent analysis is affected by the quantity and quality of facts produced. It is a surprisingly difficult problem, particularly for C , which has led to implementations that use different approaches with varying degrees of success [14]. Consequently, it can be very difficult for a user to select a fact extractor that meets their requirements. We created CppETS to address this need. The design and application of CppETS 1.0 is described in detail elsewhere [17] so we will only describe the salient components here. Motivating ....

Gail C. Murphy, David Notkin, William G. Griswold, and Erica S. Lan, "An Empirical Study of Static Call Graph Extractors," ACM Transactions on Software Engineering and Methodology, vol. 7, no. 2, pp. 158191, 1998.

.... to configure the interpretations or by a providing facilities for incremental generation of different concepts (as done, e.g. in IDEA) 5 Related Work Various empirical studies on comparisons of reverse engineering, program comprehension, and information extracting tools have been presented [2, 8, 1, 14]. Bellay and Gall presented a study in which they compared four reverse engineering tools by applying them to a commercial embedded software system, written in C [2] They aimed at pointing out the differences in capabilities and identifying their strengths and weaknesses, especially considering ....

....and applicability in architecture recovery [1] They considered information extraction, classification, and visualization. Armstrong and Trudeau found differences in the capabilities of the tools in extracting information, namely, in parsing C code. This is in line with the study by Murphy et al. [8], in which three source code parsers were compared with respect to their ca pabilities in call graph extraction. The classification facilities in the tools are implemented to support construction of high level models and at analyzing the constructed models in general. This is understood to be a ....

G. Murphy, D. Notkin, W. Griswold, and E. Lan. An empirical study of static call graph extractors. ACM Trans. Softw. Eng. Methodol., 7(2):158--191, 1998.

....process described in Figure 2.1. Gathering information and building the initial views are not straightforward either: an empirical study by Murphy et al. compares nine static call graph extractors and shows considerable differences among the results obtained from three C software systems [72]. The main reason for this was that the requirements for tools computing call graphs are typically more relaxed than those for compilers. In general, the information can be extracted and initial views of the software can be constructed automatically. However, manual processing is needed in most ....

Murphy G., Notkin D., Griswold W., and Lan E., An Empirical Study of Static Call Graph Extractors, ACM Trans. Softw. Eng. Methodol., 7, 2, 1998, pp. 158--191.

....The architecture of an application may not always be readily available. In such cases, it has to be extracted from the source code or the object code of the application. Techniques and tools for extraction of static architectural information can be either parser based or lexically based [39], while the system s dynamic behavior can be captured using profilers or test coverage tools. Recently, a workbench for architectural extraction, called Dali, that fuses different architectural views was developed [23] 24 Next a brief description of the tools that are currently used at Duke ....

G.Murphy, D.Notkin, E.Lan, An empirical study of static call graph extractors, in: Proc. 18th Int'l Conference on Software Engineering (ICSE 18), 1996, pp. 9099.

....to the actual referenced memory. Furthermore, function pointers may be employed to dynamically select the called function. In such a case the call graph produced by many commonly available tools contains highly inaccurate or even incorrect information, if function pointers are not properly handled [34]. For example, in the find program included in the GNU findutils version 4.1, the heavy use of function pointers makes the extracted call graph incomplete and not very useful, if points to results are not taken into account. Pointer analysis algorithms address these problems, providing the ....

....slicing, plan recognition and architecture recovery require both function pointers and variable locations resolution through the points to analysis. The call graph is one of the most popular, useful and well known structures extracted by software visualization and program understanding tools [34]. When pointers to functions are used, even this fundamental program representation may not be available or may result quite imprecise. In object oriented languages like C , the features of dynamic binding and polymorphism further complicate program understanding. The use of polymorphism impacts ....

G.C. Murphy, D. Notkin, Erica S.-C. Lan, "An Empirical Study of Static Call Graph Extractors", Proc. of the Int. Conf. on Software Engineering, pp. 90-99, 1996.

....referenced memory. Furthermore, function pointers may be employed to dynamically select the function to be called. When such kinds of language features are used in the program, even the call graph, one of the basic program understanding code views could be highly inaccurate or even incorrect [10]. Several software engineering tools extract the Call Graph (CG) providing this useful program view in order to help maintenance involved people to increase their understanding of the code [10] The CG should describe exactly which calls could be made from one program function to any other ....

.... graph, one of the basic program understanding code views could be highly inaccurate or even incorrect [10] Several software engineering tools extract the Call Graph (CG) providing this useful program view in order to help maintenance involved people to increase their understanding of the code [10]. The CG should describe exactly which calls could be made from one program function to any other function in the program in any possible program execution. Unfortunately, since computing call relation has been proven to be undecidable, each tool computes some sort of approximation of the exact ....

[Article contains additional citation context not shown here]

G. C. Murphy, D. Notkin, and E. S.-C. Lan. An empirical study of static call graph extractors. In International Conference on Software Engineering, pages 90--99, Berlin, Germany, March 1996. DRAFT

....philosophical approach. These differences and their relative strengths and weaknesses do not become apparent until the tools are seen side by side. Opportunities to see different tools perform the same tasks are highly illuminating. Some authors have compared tools independently or with colleagues. [8, 10, 17, 24] Chikofsky organized a Reverse Engineering Demonstration Project where researchers were invited to use their tools to analyze the WELTAB III Election System. 4] With this in mind, the authors of this paper designed a structured tool demonstration where tool builders were invited to demonstrate ....

G. C. Murphy, D. Notkin, W. G. Griswold, and E. S. Lan, "An Empirical Study of Static Call Graph Extractors," ACM Transactions on Software Engineering and Methodology, vol. 7, pp. 158-191, 1998.

No context found.

G.C. Murphy, D. Notkin, and E.S.-C. Lan, "An Empirical Study of Static Call Graph Extractors," Proc. 18th Int'l Conf. Software Eng., pp. 90--99, Mar. 1996.

No context found.

G.C. Murphy, D. Notkin, and E.S.-C. Lan, "An Empirical Study of Static Call Graph Extractors," Proc. 18th Int'l Conf. Software Eng., pp. 90--99, Mar. 1996.

....the multiple thread or distributed applications. Compilers generally need to compute conservative static call graphs to ensure the correctness of optimizations over all possible executions. Software engineering tools for program understanding impose a relaxed requirement on static call graphs [10]. For example, some false negatives (mistakenly omitted invocations) may be acceptable in static call graphs for some tasks. However, in some ways, software engineering tools place a different, stricter in some sense, requirement on dynamic call graph than compilers or profilers. To better ....

G. C. Murphy, D. Notkin, W. G. Griswold, and E. S.-C. Lan. An empirical study of static call graph extractors. ACM Transactions on Software Engineering and Methodology, 7(2):158--191, April 1998.

No context found.

Murphy, G., Notkin, D., Griswold, W., and Lan, E.: 1998, `An Empirical Study of Static Call Graph Extractors'. ACM Trans. on Software Engineering and Methodology 7(2), 158--191.

No context found.

G. C. Murphy, D. Notkin, W. G. Griswold, and E. S.-C. Lan. An empirical study of static call graph extractors. ACM Transactions on Software Engineering and Methodology, 7(2):158--191, 1998.

No context found.

G. C. Murphy, D. Notkin, W. G. Griswold, and E. S. Lan. An empirical study of static call graph extractors. ACM Transactions on Software Engineering and Methodology, 7(2):158--191, 1998.

No context found.

G. C. Murphy, D. Notkin, W. G. Griswold, and E. S.-C. Lan. An empirical study of static call graph extractors. ACM Transactions on Software Engineering and Methodology, 7(2):158--191, 1998.

No context found.

Gail C. Murphy, David Notkin, William G. Griswold, and Erica SC. Lan. An empirical study of static call graph extractors. ACM Transactions on Software Engineering and Methodology, 7(2):158-- 191, 1998.

No context found.

G. C. Murphy, D. Notkin, W. G. Griswold, and E. S. Lan. An empirical study of static call graph extractors. ACM Transactions on Software Engineering and Methodology, 7(2):158--191, 1998.

No context found.

G. C. Murphy, D. Notkin, and E. S.-C. Lan. An empirical study of static call graph extractors. In ICSE, pages 90--99, Mar. 1996.

No context found.

Gail C. Murphy, David Notkin, William G. Griswold, and Erica SC. Lan. An empirical study of static call graph extractors. ACM Transactions on Software Engineering and Methodology, 7(2):158-- 191, 1998.

No context found.

G. C. Murphy et al., An Empirical Study of Static Call Graph Extractors, ACM Transactions on Software Engineering and Methodology, 7(2) 9 (April 1998), 158--191.

No context found.

G. C. Murphy, D. Notkin, W. G. Griswold, and E. S. Lan. An empirical study of static call graph extractors. ACM Transactions on Software Engineering and Methodology, 7(2):158--191, 1998.

No context found.

G. C. Murphy, D. Notkin, and E. S.-C. Lan. An empirical study of static call graph extractors. In ICSE, pages 90--99, Mar. 1996.

No context found.

G. C. Murphy, D. Notkin, and E. S.- C. Lan. An empirical study of static call graph extractors. In 18th International Conference on Software Engineering, Berlin,Germany, Mar. 1996.

No context found.

G. C. Murphy, D. Notkin, and E. S.-C. Lan. An empirical study of static call graph extractors. In International Conference on Software Engineering, pages 90--99, Berlin, Germany, March 1996.

First 50 documents

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