A. Rountev, B.G. Ryder, and W. Landi. Data- ow analysis of program fragments. In Proceedings of ESEC/FSE '99, volume 1687 of LNCS, pages 235-252. SpringerVerlag, 1999. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Speculative Alias Analysis for Executable Code - Fernández, Espasa (2002) (Correct)
....application of the widening operation. Furthermore, the algorithm does not keep track of the contents of memory, which causes information to be lost when registers are saved restored. Typically, complexity of data ow analyses has been a compromise between cost and precision (see, for example, [1, 23, 6, 16, 29]) Thus, the higher the precision desired, the harder to keep the algorithm space and time feasible. For high level compilation, compiler writers have tended to use sophisticated analysis at the expense of increased resource usage. However, given that statically linked executable programs tend to ....
....they do not keep track of the contents of memory when registers are saved restored. Every one of these drawbacks have been addressed in this work. There is a considerably body of work on interprocedural data ow analyses design to analyze only part, but not all, of a program (see, for example, [3, 6, 16, 29]) although only some of them use pro le information to guide their decisions. This pro le information is, however, widely used when performing optimizations [26, 9, 12, 20] On the other hand, while speculation has been commonly used in the compiler world for optimizing programs [21, 17, 22, ....
A. Rountev, B. G. Ryder, and W. Landi. Data- ow analysis of program fragments. In ESEC/FSE '99, volume 1687 of Lecture Notes in Computer Science, pages 235-252. Springer-Verlag / ACM Press, 1999.
Modular Static Program Analysis - Cousot, Cousot (2002) (8 citations) (Correct)
....whole program P [P 1 , P n ] with a rough imprecise abstraction to collect some global information on the program in order to get information on the interface X n more precise than the unknown #. An example is the preliminary inexpensive whole program points to analysis made by [68] before their modular fragment analysis. 6 Separate Analysis with (User Provided) Interfaces The idea of interface based separate program analysis is to ask the user to provide information about the properties objects referenced in the program part P i while computing the local abstract ....
A. Rountev, B.G. Ryder, and W. Landi. Data-ow analysis of program fragments. In O. Nierstrasz and M. Lemoine (eds), Software Engineering - ESEC/FSE'99, 7th European Software Engineering Conference, LNCS 1687, 235252. Springer, 1999.
Towards Efficient and Accurate Program Analysis Using.. - Liang, Harrold (1999) (1 citation) (Correct)
....program information. Thus, our technique can improve the precision and performance of many program analyses on which Horwitz, Reps, and Binkley s technique cannot apply. There are many other techniques that can improve the performance of program analyses. For example, program fragment analysis [12] can analyze an arbitrary portion of a large system by using a less precise estimate about the whole system that can be obtained using a less expensive algorithm. Our light weight context recovery technique can be used with many of these approaches to improve further the performance of data ow ....
A. Rountev, B. G. Ryder, and W. Landi. Data- ow analysis of program fragments. In Joint 7th European Software Engineering Conference and 7th ACM SIGSOFT Symposium on the Foundations of Software Engineering, pages 235-252, September 1999.
A Model for Inter-module Analysis and Optimizing.. - Bueno, Banda.. (2000) (4 citations) (Correct)
No context found.
A. Rountev, B.G. Ryder, and W. Landi. Data- ow analysis of program fragments. In Proceedings of ESEC/FSE '99, volume 1687 of LNCS, pages 235-252. SpringerVerlag, 1999.
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