Marc Shapiro and Susan Horwitz. The eects of precision on pointer analysis. In Proceedings of the Fourth International Symposium on Static Analysis, SAS '97, pages 16-34, Paris, France, September 8-10, 1997.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....aliases within a program. An alias is created when two l values within a statement or expression reference the same memory location [29] Various points to analysis algorithms exist, but are often not suited for demand driven techniques because of their exhaustive nature and complexity [29, 40, 41]. However, near linear time algorithms do exist and may be considered for inclusion in future implementations [3, 41] Type extended records are not supported. Oberon implements objects as type extended records, resulting in the creation of both static and dynamic types. Type extended records ....

Marc Shapiro and Susan Horwitz. The eects of the precision of pointer analysis. In Proceedings of the 4th International Symposium on Static Analysis, pages 16-34, January 1997.

....in most cases. The non parameterized objectsensitive analysis from Section 3 can be expressed in the general framework for context sensitive class analysis presented in [13] however, it is not identified or studied in [13] Conceptually, our MOD analysis is based on similar MOD analyses for C [23, 14, 22]. Razafimahefa [19] presents algorithms for side e#ect analysis for Java that are based on context insensitive information. The more precise of the algorithms is based on context insensitive points to analysis for Java derived from Steensgaard s analysis for C [25] Clausen [7] investigates ....

M. Shapiro and S. Horwitz. The e#ects of the precision of pointer analysis. In Static Analysis Symposium, LNCS 1302, pages 16--34, 1997.

.... in [16, 11, 5, 10, 27, 26] Di#erent mechanisms for context sensitivity which typically abstract context by some combination of the parameter class types have been studied in the context of class analysis [1, 17, 2, 13] Conceptually, our MOD analysis is based on similar MOD analyses for C [22, 14, 21]. Razafimahefa [18] presents algorithms for side e#ect analysis for Java which are based on context insensitive information. The more precise of the algorithms is based on a points to analysis for Java derived from Steensgaard s analysis for C [24] These analyses do not take advantage of ....

M. Shapiro and S. Horwitz. The e#ects of the precision of pointer analysis. In Static Analysis Symposium, LNCS 1302, pages 16--34, 1997.

....As a result, analyses from this category are e#cient and can be used in production strength tools without introducing substantial time space overhead. Several combinations of a whole program mod analysis and a whole program flowand context insensitive points to analysis have been investigated [55, 34, 54]. Similarly to [55, 34] we consider a whole program mod analysis based on Andersen s whole program flow and context insensitive points to analysis for C [4] Even though we investigate these specific analyses, our techniques also apply to similar whole program flow and contextinsensitive ....

....this category are e#cient and can be used in production strength tools without introducing substantial time space overhead. Several combinations of a whole program mod analysis and a whole program flowand context insensitive points to analysis have been investigated [55, 34, 54] Similarly to [55, 34], we consider a whole program mod analysis based on Andersen s whole program flow and context insensitive points to analysis for C [4] Even though we investigate these specific analyses, our techniques also apply to similar whole program flow and contextinsensitive points to analyses (e.g. ....

[Article contains additional citation context not shown here]

M. Shapiro and S. Horwitz. The e#ects of the precision of pointer analysis. In Static Analysis Symposium, LNCS 1302, pages 16--34, 1997.

....results. Another approach to side e#ect analysis is to perform an interprocedural pointer aliasing algorithm and then identify all variables experiencing side e#ects at indirect stores through a pointer (i.e. at through dereference statements) using the aliases found [EGH94, GH98, Ruf95, HP98, SH97a, ZRL98, ZRL96] This is often used as an empirical test of the precision of the alias solution obtained. Related Analyses Related interprocedural analyses include compile time interprocedural program slicing [GL91, HRB90, OO84, RR95, GS96, LH96, HC98, SHR99, TCFR96, Tip96, Ven91, Wei84, TAFM97, ....

.... [LR91] Several solutions to MODC with di#erent flow insensitive, context insensitive points to approximation algorithms have been obtained by this method, since using program wide aliases yields an approximate problem for MODC that yields the same side e#ects regardless of calling context [SH97a] This Horwitz and Shapiro study shares the philosophy of the empirical results presented here, in that the e#ects of pointer aliasing on applications are reported. However, there are no flow and or context sensitive analyses performed and direct comparison with MODC (FIAlias) is di#cult, since ....

M. Shapiro and S. Horwitz. The e#ects of the precision of pointer analysis. In Proceedings of the Fourth International Symposium on Static Analysis (SAS'97), pages 16--34, September 1997.

.... results to perform slicing more e#ectively in the presence of pointers (e.g. 1, 3, 5, 14] Some researchers have also evaluated the e#ects of the precision of the pointer analysis on subsequent analyses, such as the computation of def use associations (e.g. 22] and program slicing (e.g. [4, 13, 20]) However, none of that research distinguishes data dependences based on types of the definition, the use, and the paths between the definition and the use they view uniformly each data dependence that arises in the presence of pointers. Other researchers (e.g. 6, 9] have investigated ....

M. Shapiro and S. Horwitz. The e#ects of the precision of pointer analysis. In 4 th Intl. Static Analysis Symp., vol. 1302 of LNCS, pages 16--34, Sept. 1997.

....which ignore the flow of control and the calling contexts of procedures. Such analyses are very e#cient and can be used in production strength compilers with little additional cost. Several combinations of a mod analysis and a flow and context insensitive points to analysis have been investigated [16, 15, 10]. Similarly to [16, 10] we consider a mod analysis based on Andersen s points to analysis for C [1] Even though we investigate these specific analyses, our results also apply to similar flow and context insensitive points to analyses (e.g. 18, 17, 5] and related mod analyses. 1.1 Separate ....

....and the calling contexts of procedures. Such analyses are very e#cient and can be used in production strength compilers with little additional cost. Several combinations of a mod analysis and a flow and context insensitive points to analysis have been investigated [16, 15, 10] Similarly to [16, 10], we consider a mod analysis based on Andersen s points to analysis for C [1] Even though we investigate these specific analyses, our results also apply to similar flow and context insensitive points to analyses (e.g. 18, 17, 5] and related mod analyses. 1.1 Separate Analysis of Modules ....

[Article contains additional citation context not shown here]

M. Shapiro and S. Horwitz. The e#ects of the precision of pointer analysis. In Static Analysis Symposium, LNCS 1302, pages 16--34, 1997.

....callsite. For example, a program analysis might report that y, z, and w are modi ed by f( when f( is called by statement 8. Furthermore, a program analysis that propagates the spurious program information throughout the program will be unnecessarily inecient. Many existing techniques (e.g. [2, 7, 11, 13]) compute safe program information by accounting for the e ects of aliasing in the analysis. However, only a few of these techniques (e.g. 7, 11] can distinguish memory locations accessed by a procedure under the context of speci c callsites. These techniques use conditional analysis that ....

....(left) and average time to compute a slice (right) this may be that, on these programs, the precision of the interprocedural slicing is not sensitive to the precision of identifying memory locations that are modi ed or referenced at a statement. This result is consistent with results reported in [8, 13], which show that the precision of interprocedural slicing is not very sensitive to the precision of alias information. The right side of the Table 3 shows T , the average time to compute a slice using information provided by lightweight context recovery, and T 0 , the average time to compute a ....

M. Shapiro and S. Horwitz. The eects of the precision of pointer analysis. In The 4th International Symposium on Static Analysis, pages 16-34, September 1997.

....callsite. For example, a program analysis might report that y, z, and w are modified by f( when f( is called by statement 8. Furthermore, a program analysis that propagates the spurious program information throughout the program will be unnecessarily ine#cient. Many existing techniques (e.g. [2, 8, 12, 14]) compute safe program information by accounting for the e#ects of aliasing in the analysis. However, only a few of these techniques (e.g. 8, 12] can distinguish memory locations accessed by a procedure under the context of specific callsites. These techniques use conditional analysis that ....

....improvement. One explanation for this may be that, on these programs, the precision of the interprocedural slicing is not sensitive to the precision of identifying memory locations that are modified or referenced at a statement. This result is consistent with results reported in References [9, 14], which show that the precision of interprocedural slicing is not very sensitive to the precision of alias information. The right side of the Table 3 shows T , the average time to compute a slice using information provided by 6 Data for some programs are unavailable: Landi and Ryder s algorithm ....

M. Shapiro and S. Horwitz. The e#ects of the precision of pointer analysis. In The 4th International Symposium on Static Analysis, pages 16--34, September 1997.

....of procedures. As a result, analyses from this category are very e#cient and can be used in productionstrength compilers with little additional cost. Several combinations of a mod analysis and a flow and context insensitive points to analysis have been investigated theoretically and empirically [21, 25, 20, 14]. Similarly to [21, 14] we consider a whole program mod analysis based on Andersen s whole program flow and context insensitive points to analysis [2] Even though we investigate these particular analyses, our results also apply to similar flow and context insensitive points to analyses (e.g. ....

....from this category are very e#cient and can be used in productionstrength compilers with little additional cost. Several combinations of a mod analysis and a flow and context insensitive points to analysis have been investigated theoretically and empirically [21, 25, 20, 14] Similarly to [21, 14], we consider a whole program mod analysis based on Andersen s whole program flow and context insensitive points to analysis [2] Even though we investigate these particular analyses, our results also apply to similar flow and context insensitive points to analyses (e.g. 24, 22, 6] and to mod ....

[Article contains additional citation context not shown here]

M. Shapiro and S. Horwitz. The e#ects of the precision of pointer analysis. In Static Analysis Symposium, LNCS 1302, pages 16--34, 1997.

....to post on servers or to redistribute to lists, requires prior speci c permission and or a fee. PLDI 2000, Vancouver, British Columbia, Canada. Copyright 2000 ACM 1 58113 199 2 00 0006. 5.00. points to information can greatly impact the performance and usefulness of subsequent analyses [SH97a]. The focus of this paper is ow and context insensitive pointer analysis. Within this domain, there are algorithms such as Steensgaard s uni cation based approach [Ste96b] almost linear running time) which scale well to large programs but produce relatively imprecise results. On the other ....

M. Shapiro and S. Horwitz. The eects of the precision of pointer analysis. In LNCS 1302, 4th International Symposium on Static Analysis, 1997. Springer-Verlag, September 1997.

....analysis is designed to achieve the following goals: Precision. The separate analysis is designed to be as precise as the whole program analysis. This is important because the precision of the points to information can greatly a#ect the cost and precision of subsequent analyses and applications [18, 22, 11]. Practicality. The cost of computing and storing the summary should be practical. In particular, the time to compute the summary should not be excessive (e.g. no more than a few minutes for a medium sized library) and the disk space needed to store the summary should be reasonable (e.g. ....

M. Shapiro and S. Horwitz. The e#ects of the precision of pointer analysis. In Proc. Static Analysis Symposium, LNCS 1302, pages 16--34, 1997. 11

.... side e#ect analysis using various aliasing methods can be found in [LRS 98, SRLZ98] Another approach to side e#ect analysis is to perform an interprocedural pointer aliasing analysis and then identify all variables that get modified through dereference of a pointer using the found aliases [SH97a, ZRL96, ZRL98, YRL98] 3.3 Incremental Data Flow Analyses Many incremental algorithms have been developed for data flow analysis, which are useful, especially in a programming environment [Zad84] Some incremental analyses use incremental elimination methods [Bur90, CR88, RP88] some are based on ....

M. Shapiro and S. Horwitz. The e#ects of the precision of pointer analysis. In Proceedings of the Fourth International Symposium on Static Analysis (SAS'97), pages 16--34, September 1997.

No context found.

Marc Shapiro and Susan Horwitz. The eects of precision on pointer analysis. In Proceedings of the Fourth International Symposium on Static Analysis, SAS '97, pages 16-34, Paris, France, September 8-10, 1997.

No context found.

M. Shapiro and S. Horwitz. The e#ects of the precision of pointer analysis. In Static Analysis Symposium, LNCS 1302, pages 16--34, 1997.

No context found.

Marc Shapiro and Susan Horwitz. The e#ects of the precision of pointer analysis. In Static Analysis Symposium (SAS), 1997.

No context found.

M. Shapiro and S.Horwitz. The eects of the precision of pointer analysis. In LNCS 1302, 4th International Symposium on Static Analysis, 1997.

No context found.

M. Shapiro and S. Horwitz. The eects of the precision of pointer analysis. Lecture Notes in Computer Science, 1302:16-34, 1997. 61

No context found.

M. Shapiro and S. Horwitz. The e#ects of the precision of pointer analysis. In Static Analysis Symposium, LNCS 1302, pages 16--34, 1997.

No context found.

M. Shapiro and S. Horwitz. The e#ects of the precision of pointer analysis. In 4 International Static Analysis Symposium, volume 1302 of LNCS, pages 16--34, September 1997.

No context found.

Marc Shapiro and Susan Horwitz. The eects of precision on pointer analysis. In Proceedings of the Fourth International Symposium on Static Analysis, SAS '97, pages 16-34, Paris, France, September 8-10, 1997.

No context found.

SH97. M. Shapiro and S. Horwitz. The e#ects of the precision of pointer analysis. In LNCS 1302, 4th International Symposium on Static Analysis. SpringerVerlag, 1997.

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