J.-s. Yur, B.G. Ryder, and W.A. Landi, "An Incremental Flow- and Context-Sensitive Pointer Aliasing Analysis," Proc. 21st Int'l Conf. Software Eng., pp. 442-452, May 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Automatic Loop Transformations and Parallelization for Java - Artigas, Gupta, Midkiff.. (2000) (9 citations) (Correct)
....numerical applications typically run on large memory systems, and that their data sets are much larger than the code, we believe that code expansion is a small price to pay for the enormous boost in performance. 7. RELATED WORK The analysis of aliasing relationships in programs is well studied [10, 11, 14, 15, 25, 27]. Our work is complementary to this pre Table 3: Code expansion for the eight benchmarks. benchmark Executable size baseline versioning parallelization (bytes) bytes) growth) bytes) growth) MATMUL 11986 16858 41 17950 50 MICRODC 15978 18098 13 17950 12 LU 14160 14656 4 15328 8 ....
J.-S. Yur, B. G. Ryder, and W. A. Landi. An incremental flow- and context-sensitive pointer aliasing analysis. In Proceedings of the 1999 International Conference on Software Engineering, pages 442--451, 1999.
A Schema for Interprocedural Modification.. - Ryder, Landi.. (2001) (3 citations) Self-citation (Ryder Landi) (Correct)
.... [ASU86] practical dependence analysis in programs with procedure calls [Ban88, Pol88, Wol89] data flow based testing [HS91, BH93, HFGO94, Ost90, Wey94, CR99, FW93, FI98] incremental semantic change analysis of software [Bur90, BR90, CR88, CK84, MR90a, MR91, PS89, Ryd83, RP88, YRLS97, YRL99] interprocedural def use relations [PLR94, HS94, GH98, CR99, Cha99] and e#ective static interprocedural program slicing [GL91, HRB90, OO84, RR95, GS96, LH96, HC98, SHR99, TCFR96, Tip96, Ven91, Wei84, TAFM97, AG96, AG98] Many of these key applications in parallel and sequential programming ....
J. Yur, B. G. Ryder, and W. Landi. An incremental flow- and context-sensitive pointer aliasing analysis. In Proceedings of the Twenty-First International Conference on Software Engineering, pages 442--451, May 1999.
Incremental Analysis For Flow- And Context-Sensitive Data-Flow.. - Yur (1999) Self-citation (Yur) (Correct)
.... 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 the technique of restarting iteration [CK84, PS89, YRL99] and some are a combination of these two techniques [MR90] An incremental elimination method first partitions the flow graph, and then establishes the data flow function from the head node of a region to each interior node; when the external information reaching a region changes, the solution ....
J. Yur, B. G. Ryder, and W. Landi. An incremental flow- and contextsensitive pointer aliasing analysis. In Proceedings of the Twenty-First International Conference on Software Engineering, pages 442--451, May 1999.
Analysis and Visualization of - Predicate Dependence On (Correct)
No context found.
J.-s. Yur, B.G. Ryder, and W.A. Landi, "An Incremental Flow- and Context-Sensitive Pointer Aliasing Analysis," Proc. 21st Int'l Conf. Software Eng., pp. 442-452, May 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