M.Burke,P.Carini,J.-D.Choi,andM.Hind. Flow-insensitive interprocedural alias analysis in the presence of pointers. In K. PingO---= U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors, Language and Compilers for Parallel Computing, 7th International Workshop, LNCS 892, pagL 234--250. SpringO= Verlag Au g 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....Java is no exception. This means that, to determine whether an object must be serialized, we need to keep track of how all of its aliases are used. Fortunately, the aliasing problem is a well known and thoroughly studied one in program analysis, and a number of suitable techniques exist (e.g. [11, 3, 22, 19, 12, 13]) Moreover, alias analysis is orthogonal to the type based analysis we describe here, and the two can be combined straightforwardly as follows. First, we can exploit the results of alias analysis to annotate each node of the control flow graph with the alias set associated to each parameter ....

M. Burke et al. Flow-Insensitive Interprocedural Alias Analysis in the Presence of Pointers. In Languages and Compilers for Parallel Computing: Proc. of the 7th Int. WS, LNCS 892, pages 234--244, 1995.

....(CIS) with ECS in [1] we have implemented all slicing algorithms of the previous sections to evaluate them fully. We used our infrastructure to analyze C programs [10] to implement all slicing (and chopping) algorithms with a flow insensitive but context sensitive alias analysis similar to [5]. The details of the analyzed programs are shown in Figure 6. The programs stem from three different sources: ctags, patch and diff are the GNU programs. The rest are from the benchmark database of the PROLANGS Analysis Framework (PAF) 17] The LOC column shows lines of code (measured via wc ....

M. Burke, P. Carini, J.-D. Choi, and M. Hind. Flowinsensitive interprocedural alias analysis in the presence of pointers. In Lecture Notes in Computer Science, 892. 1995.

....all program analyses for languages with pointers must perform alias analysis : when a program indirectly loads or stores through a pointer p, the analysis must determine to which location(s) p points. The research literature abounds with proposed alias analysis techniques, including [LR92, And94, BCCH94, EGH94, WL95, Ste96, Das00] some of which scale to very large programs [FFSA98, RF01, HT01] Almost all of these techniques are fully automatic. That is, the analyses take a bare program and infer all possible aliasing. While these techniques show great promise, we believe that alias analysis is ....

....with polymorphic recursion. Given the similarities between our type system and Tofte and Talpin s region type system, we believe that Tofte and Birkedal s region inference algorithm [TB98] can be adapted to our type system. Automatic alias analysis has been heavily studied in recent years [And94, BCCH94, CRL99, Das00, DMW98, Deu94, DRS98, EGH94, FRD00, HT01, HP98, LR92, SRW99, SH97, Ste96, WL95, YHR99, ZRL96] Our type system incorporates may alias analysis to check the correctness of restrict annotations. The may alias analysis we use is very conservative, and in the future we plan to extend ....

Michael Burke, Paul Carini, Jong-Deok Choi, and Michael Hind. Flow-Insensitive Interprocedural Alias Analysis in the Presence of Pointers. In K. Pingali, U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors, Proceedings of the Seventh Workshop on Languages and Compilers for Parallel Computing, volume 892 of Lecture Notes in Computer Science, pages 234-250. Springer-Verlag, 1994.

....attempts to verify strategically placed formulas. A more abstract contribution is to identify and exploit an important niche of finite state regularity in programming language semantics. Related Work Our work does not follow the established tradition of conventional heapbased pointer analysis [7, 8, 15, 4, 5, 14, 13, 17, 2] which develops specialized algorithms for answering specific questions about preexisting programs without annotations. We are more general in providing a full, decidable logic in which one may phrase a broad range of questions, and in providing concrete counterexamples whenever a question is ....

Michael Burke, Paul Carini, Jong-Deok Choi, and Michael Hind. Flowinsensitive interprocedural alias analysis in the presence of pointers. In of the 7th International on Languages and Compilers for Parallel Computing, number 892 in Lecture Notes in Computer Science, August 1994.

....interprocedural PTA sec 5 x x PSPACE hard interprocedural PTA sec 4 x in P, O(n 5 ) intraprocedural PTA sec 4.3 x in NC Table 1: Complexity results for PTA summarized and threads, or C without exceptions. At the one end of the spectrum are flow and context insensitive approaches [Cou86, Gua88, BCCH94, And94, SH97b, Ste96a, Wei80, ZRL96, HP98], which are the least expensive, but also the most imprecise. At the other end are flow and context sensitive approaches [Coo89, Gua88, GH98, WL95, Ruf95, HA90, SFRW90, CRL99, LR92, EGH94, WL95, CBC93, MLR 93, Ruf95] which are the most precise, but also the most expensive. Approaches like ....

Michael Burke, Paul Carini, Jong-Doek Choi, and Michael Hind. Flow-insensitive interprocedural alias analysis in the presence of pointers. In Proceedings of the 7th International Workshop on Languages and Compilers for Parallel Computing, pages 234-- 250. Springer-Verlag, August 1994.

.... of a fixed location and the object name (containing a single dereference) which points to it (e.g. ##p,x# means p points to x) This representation, like a points to representation, requires a closure step to obtain object names containing multiple levels of dereferences [CBC93, MLR 93, BCCH94, BCCH97, HBCC99] For example, in order to determine the fixed locations potentially experiencing side e#ects in p= the implicit representation pairs ##p,q# and ##q,r# must be combined to yield ###p,r#. FSAlias [LR92] the flow context sensitive alias approximation algorithm uses an ....

....alias created at that statement, ##q,r#, obtaining the spurious alias ####p,s#. This occurs because neither representation encodes enough information to remember that the two incoming aliases do not exist concurrently on a path 7 The implicit representation is called compact in [CBC93, BCCH94, BCCH97, HP98, HBCC99] 10 in the program. These examples are simple instances of the general problem. S1: x = y; S2: p = x; S3: x = z; S4: p = S1: q = z; S2: if ( S3: p = q; else S4: q = y; S5: p = S1: if ( S2: p = q; else S3: r = s; S4: q = r; S5: p = a) Implicit ....

[Article contains additional citation context not shown here]

Michael Burke, Paul Carini, Jong-Doek Choi, and Michael Hind. Flow-insensitive interprocedural alias analysis in the presence of pointers. In Proceedings of the 7th International Workshop on Languages and Compilers for Parallel Computing, pages 234--250. Springer-Verlag, August 1994.

....SFRW90] Recently, there have been many investigations of pointer aliasing algorithms which vary in cost and precision. Several concentrate on aliases in heap storage [HPR89, CWZ90, Deu94, HN90, EGH94, JM82, LH88, SRW96] Others calculate program wide (flow insensitive) aliases [Cou86, Gua88, BCCH94, And94, SH97, Ste95, Wei80, ZRL96] Still other work concentrated on aliases in higher order functional languages [Deu90, NPD87] Incremental algorithms update data flow information after a program change rather than recomputing it from scratch, with the belief that the change impact will be ....

Michael Burke, Paul Carini, Jong-Doek Choi, and Michael Hind. Flow-insensitive interprocedural alias analysis in the presence of pointers. In Proceedings of the 7th International Workshop on Languages and Compilers for Parallel Computing, pages 234--250. Springer-Verlag, August 1994.

....understanding, particularly for programmers reading code which they did not write. Our focus in this paper is on the efficient and practical solution of the pointer aliasing problem to facilitate these applications. Many techniques for compile time pointer aliasing analysis have been proposed [3, 4, 6, 7, 8, 9, 11, 14, 15, 22, 26, 27, 32, 36, 37, 39, 40]. Some of them are more appropriate for aliases involving accesses to heap locations [6, 8, 11, 14, 15, 26, 36] others for aliases involving accesses to stack locations [9, 39] Still others handle both in a similar fashion [3, 4, 7, 22, 27, 32, 37, 40] All of these methods vary in the precision ....

.... proposed [3, 4, 6, 7, 8, 9, 11, 14, 15, 22, 26, 27, 32, 36, 37, 39, 40] Some of them are more appropriate for aliases involving accesses to heap locations [6, 8, 11, 14, 15, 26, 36] others for aliases involving accesses to stack locations [9, 39] Still others handle both in a similar fashion [3, 4, 7, 22, 27, 32, 37, 40]. All of these methods vary in the precision of the aliasing information calculated and their cost. For compile time pointer aliasing analysis, a program can be considered a sequence of assignments having effects on pointer aliasing; we call them pointer related assignments. In this paper, we ....

[Article contains additional citation context not shown here]

Michael Burke, Paul Carini, Jong-Deok Choi, and Michael Hind. Flow-insensitive interprocedural alias analysis in the presence of pointers. In Lecture Notes in Computer Science, number No. 892, pages 234--250. Springer-Verlag, 1995. Proceedings from the 7th International Workshop on Languages and Compilers for Parallel Computing.

....element, the pointer can only point to fields at offsets that are some multiple of that size away from the ends of the array. In addition, there have been algorithms that distinguish fields of structures, but do not handle casting. This includes the work of Choi et al. CBC93] Burke et al. BCCH94] Andersen [And94] Emami et al. EGH94] and Tonella [Ton97] We cannot categorize the work of Ruf [Ruf95] While it appears that fields of structures are distinguished, this aspect of the analysis is only mentioned briefly, and it is not possible to tell whether casting is handled. 12 ....

M. Burke, P. Carini, J.-D. Choi, and M. Hind. Flow-insensitive interprocedural alias analysis in the presence of pointers. In K. Pingali, U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors, Language and Compilers for Parallel Computing, 7th International Workshop, LNCS 892, pages 234--250. SpringerVerlag, August 1994.

.... sensitivity In flow and context insensitive analysis, the sequencing and control flow of a program is ignored, that is, the program is regarded as a set of statements, and a data flow algorithm will examine the statements one by one and process the aliasing e#ect it may contribute [Cou86, Gua88, BCCH94, And94, SH97b, Ste96, Wei80, ZRL96, HP98] 7 int x,y,z; int p, q; foo( p= x; p= y; a: bar(p) d: q= u: x z; b: bar( z) bar(int w) c: q=w; w,y w,z q,y q,z p,x p,x , p,y q,y , q,z q,y , q,z q,y , q,z Figure 2.2: Aliasing solution by ....

....the MOD problem [LRZ93] ALIAS ALIAS(n) is the pointer aliasing problem at program point n. Even though a flow and context sensitive aliasing analysis [LR92] is utilized, the problem decomposition also allows plugging a di#erent type of aliasing analysis (e.g. a flowinsensitive one [Cou86, Gua88, BCCH94, And94, SH97b, Ste96, Wei80, ZRL96, HP98] which is more e#cient, but less precise [SRLZ98] in the computation. An alias, called a reaching alias at the entry of the procedure containing program point n, is used to approximate the calling context under which we are performing analysis at ....

[Article contains additional citation context not shown here]

Michael Burke, Paul Carini, Jong-Doek Choi, and Michael Hind. Flowinsensitive interprocedural alias analysis in the presence of pointers. In Proceedings of the 7th International Workshop on Languages and Compilers for Parallel Computing, pages 234--250. Springer-Verlag, August 1994.

....Keywords : C , Interprocedural static analysis, Type determination, Aliasing, Virtual functions, Pointers. 1 Introduction In the past decade, significant research by the static analysis community has concentrated on expanding compile time analysis to include interprocedural information [BCC 94, Bur90, Cal88, CBC93, CK88, CK89, HS94, HRB90, LRZ93, MLR 93, Mey81] Historically, compile time analysis has been used in intraprocedural context for code optimizations. The emphasis is shifting towards the use of interprocedural static analysis in compiling as well as all phases of software life ....

M. Burke, P. Carini, J-D. Choi and M. Hind. Flow-insensitive interprocedural alias analysis in the presence of pointers. In Proceedings of the Seventh International Workshop on Languages and Compilers for Parallel Computing, August 19994.

.... appropriate cost benefit goals This question can be considered, for example, in the field of pointer analysis[Zhang et al. 1996] Recently, there have been significant advances in the approximate analyses of difficult program constructs such as pointers[Choi et al. 1993; Marlowe et al. 1993; Burke et al. 1994; Landi and Ryder 1992; Steensgaard 1996] These approximate analysis methods are difficult to compare in terms of accuracy and efficiency, but are necessarily approximate because of the provable difficulty of the problem they address. Before reasonable software tools can incorporate such methods, ....

Burke, M., Carini, P., Choi, J.-D., and Hind, M. 1994. Flow-insensitive interprocedural alias analysis in the presence of pointers. In Proceedings of the 7th International Workshop on Languages and Compilers for Parallel Computing (Aug. 1994), pp. 234--250. SpringerVerlag.

....the called function is now a part of the PCG, it will be visited during the normal course of events of each alias analysis. This is the general flavor of how function pointer and incremental building of the PCG is performed. This incremental building of the PCG is an idea that appeared in [EGH94, BCCH95] However, since each analysis visits functions differently, in the sections describing each analysis we will explain the specific analysis handling of function pointers and incremental building of the PCG. From this point forward, when we refer to a call site calling a function, we will mean ....

.... algorithm [Ste96] that computes one solution set for the entire program and relies on a union find data structure, AN: an iterative implementation of Andersen s flow insensitive algorithm [And94] that computes one solution set for the entire program, FI: a flow insensitive algorithm [BCCH95, BCCH97] that computes a solution set for every function, FS: a flow sensitive algorithm [CBC93, BCCH97] that computes a solution set for every program point. All alias analyses use the same underlying program representation (Section 5.1) and are context insensitive, but each varies the ....

[Article contains additional citation context not shown here]

Michael Burke, Paul Carini, Jong-Deok Choi, and Michael Hind. Flow-insensitive interprocedural alias analysis in the pressence of pointers. In David Gelertner, Alexandru Nicolau, and David Padua, editors, Lecture Notes in Computer Science, 892. Springer-Verlag, 1995.

....for this problem. Although some of these have been used for pointer analysis of C, they can be adapted for the type inference problem for Java without exceptions and threads or C without exceptions. There are intraprocedurally and interprocedurally flow insensitive approaches [BCCH94, Wei80, Ste96b, Ste96a, SH97, ZRL96, And94] which are the The research reported here was supported, in part, by NSF grant GER 9023628 and the Hewlett Packard Corporation. 2 types with data members only of primitive type least expensive, but also the most imprecise. In contrast, there are ....

Michael Burke, Paul Carini, Jong-Doek Choi, and Michael Hind. Flowinsensitive interprocedural alias analysis in the presence of pointers. In Proceedings of the 7th International Workshop on Languages and Compilers for Parallel Computing, pages 234--250. Springer-Verlag, August 1994.

....attempts to verify strategically placed formulas. A more abstract contribution is to identify and exploit an important niche of finite state regularity in programming language semantics. Related Work Our work does not follow the established tradition of conventional heap based pointer analysis [8, 9, 20, 4, 5, 19, 16, 22, 2], which develops specialized algorithms for answering specific questions about preexisting programs without annotations. We are more general in providing a full, decidable logic in which one may phrase a broad range of questions, and in providing concrete counterexamples whenever a question is ....

Michael Burke, Paul Carini, Jong-Deok Choi, and Michael Hind. Flow-insensitive interprocedural alias analysis in the presence of pointers. In of the 7th International on Languages and Compilers for Parallel Computing, number 892 in Lecture Notes in Computer Science, August 1994.

.... stores all aliases as pairs consisting of a location and the single level pointer expression which points to it (e.g. p; x means the dereferenced value of p is x) this representation requires a transitive closure step to obtain all pairs of aliases at a program point [CBC93, MLR 93, BCCH94] FSAlias, the flow sensitive, context sensitive alias approximation algorithm [LR92] uses an explicit representation of aliases as pairs of names possibly containing dereferences (e.g. h p,q i) Redundant aliases obtained through dereferences applied to both elements of an alias pair are not ....

....used. 26 Recently, there have been many investigations of pointer aliasing algorithms which vary in cost and precision. Several concentrate on aliases in heap storage [HPR89, CWZ90, Deu94, HN90, EGH94, JM82a, LH88, SRW96] Others calculate program wide (flow insensitive) aliases [Cou86, Gua88, BCCH94, And94, SH97b, Ste95, Wei80, ZRL96] There are flow sensitive techniques as well which calculate programpoint specific aliases [Coo89, LR92, CBC93, MLR 93, EGH94, WL95, Ruf95, HA90, SFRW90] Still other work concentrated on aliases in higher order functional languages [Deu90, NPD87] 6 ....

Michael Burke, Paul Carini, Jong-Doek Choi, and Michael Hind. Flow-insensitive interprocedural alias analysis in the presence of pointers. In Proceedings of the 7th International Workshop on Languages and Compilers for Parallel Computing, pages 234--250. Springer-Verlag, August 1994.

....tradeoff of efficiency and precision. 4 Related Work Many pointer aliasing analysis or points to analysis algorithms have been proposed in the literature. These algorithms can be classified into flow sensitive and contextsensitive [4, 5, 6, 7, 10, 12, 21] flow insensitive and context insensitive [2, 15, 16, 17, 18, 20], flow sensitive and context insensitive [3, 13] or flow insensitive and context sensitive [1] They can also be organized into stack based aliasing analysis [6] heap based aliasing analysis [3, 5, 7, 8, 9, 11] or both [4, 10, 13, 17, 18, 21] chomp loader stanford pokerd sim dineroIII ....

Michael Burke, Paul Carini, Jong-Deok Choi, and Michael Hind. Flow-insensitive interprocedural alias analysis in the presence of pointers. In Lecture Notes in Computer Science, number No. 892, pages 234--250. Springer-Verlag, 1995. Proceedings from the 7th International Workshop on Languages and Compilers for Parallel Computing.

....MOD REF solution of similar precision. 1 Introduction Compile time analysis of pointer induced aliases is critical for optimization, parallelization, program transformation and many other applications. Over the past few years, many techniques for the analysis have been proposed in the literature [1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 16, 19, 22, 24, 26, 28, 30]. Some of them are more appropriate for aliases involving accesses to heap locations (i.e. heap based aliases) e.g. 4, 6, 12] Some are more appropriate for aliases involving accesses to stack locations (i.e. stack based aliases) e.g. 7, 8] Others handle both in a similar fashion, e.g. ....

....analysis. It is our conjecture that the flow insensitive analysis is not doing as well as either the flowsensitive analysis or the combined analysis because it calculates a symmetric alias relation. 7 Related Work Many pointer aliasing analysis algorithms have been proposed in the literature [1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 16, 19, 22, 24, 26, 28, 30]. Any of these algorithms can be employed for individual weakly connected components in our program decomposition. In addition, our decomposition enables a sparse program representation for each component and therefore will allow any analysis algorithm to run faster. The existing analysis ....

[Article contains additional citation context not shown here]

Michael Burke, Paul Carini, Jong-Deok Choi, and Michael Hind. Flow-insensitive interprocedural alias analysis in the presence of pointers. In Lecture Notes in Computer Science, number No. 892, pages 234--250. Springer-Verlag, 1995. Proceedings from the 7th International Workshop on Languages and Compilers for Parallel Computing.

....purely dynamic, untyped languages like SELF and ours for typed languages like C , the two approaches may supplement each other for languages which combine these separate domains. Since virtual function calls in C can be modeled using function pointers in C, algorithms which handle them [BCC 94, EGH94, WL95, Wei80] may be applied towards analysis of C . Nevertheless, these approaches i) have a different emphasis and are ill tuned to function pointer analysis and or ii) have impractical worst case complexity, and are unsuitable in C context where virtual functions are ubiquitous. Techniques for ....

M. Burke, P. Carini, J-D. Choi and M. Hind. Flow-insensitive interprocedural alias analysis in the presence of pointers. In Proceedings of the Seventh International Workshop on Languages and Compilers for Parallel Computing, August 19994.

....attempts to serve this role, as well as categorizing existing work. 2. BACKGROUND A pointer alias analysis attempts to determine when two pointer expressions refer to the same storage location. A points to analysis [27, 22, 2] or similarly, an analysis based on a compact representation [13, 5, 38], attempts to determine what storage locations a pointer can point to. This information can then be used to determine the aliases in the Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or ....

.... Is control ow information of a procedure used during the analysis By not considering control ow information, and therefore computing a conservative summary, ow insensitive analyses compute one solution for either the whole program (such as [2, 94, 108, 91] or for each method (such as [5, 38, 55]) whereas a ow sensitive analysis computes a solution for each program point. Flowinsensitive analyses thus can be more ecient, but less precise than a ow sensitive analysis. Flow insensitive analyses are either equality based [94, 108] which treat assignments as bidirectional and typically ....

[Article contains additional citation context not shown here]

M. Burke, P. Carini, J.-D. Choi, and M. Hind. Flow-insensitive interprocedural alias analysis in the presence of pointers. In K. Pingali, U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors, Lecture Notes in Computer Science, 892, pages 234-250. Springer-Verlag, 1994. Proceedings from the 7th Workshop on Languages and Compilers for Parallel Computing.

....Gay s work statically detects dataraces in SPMD programs [1] Since SPMD programs employ barrier style synchronizations, they need not track locks held at each statement. The static datarace analysis employed as part of our datarace detection is based on points to analysis of reference variables [7, 26]. The primary advantage of a static analysis approach is its efficiency due to the fact that it incurs no runtime overhead. However, this advantage is mitigated in practice by severe limitations in precision (due to false positive reports) and ease of use (due to the requirement of presenting a ....

M. Burke, P. Carini, J.-D. Choi, and M. Hind. Flow-insensitive interprocedural alias analysis in the presence of pointers. In 7th International Workshop on Languages and Compilers for Parallel Computing, 1994.

....of internal procedure structure, but not invariant across many inputs. This is to be contrasted to the constant summary information of the [IC] criterion. Examples of AFS and AFI Examples of approximation methods we can categorize in this manner are the Pointer induced MayAlias algorithms of [BCCH94, LR92] the Def Use analysis of C like programs [PLR94] and MayBeModifiedC [LRZ93] 11 The Burke et.al. algorithm [BCCH94] uses a functional annotation for each procedure computed without consideration of intraprocedural program structure. Between each interprocedural data flow propagation ....

....information of the [IC] criterion. Examples of AFS and AFI Examples of approximation methods we can categorize in this manner are the Pointer induced MayAlias algorithms of [BCCH94, LR92] the Def Use analysis of C like programs [PLR94] and MayBeModifiedC [LRZ93] 11 The Burke et.al. algorithm [BCCH94] uses a functional annotation for each procedure computed without consideration of intraprocedural program structure. Between each interprocedural data flow propagation pass, there is an evaluation of each of these procedural annotations, to calculate possible new intraprocedural information to ....

[Article contains additional citation context not shown here]

Michael Burke, Paul Carini, J-D. Choi, and M. Hind. Flow-insensitive interprocedural alias analysis in the presence of pointers. In Proceedings of the 7th International Workshop on Languages and Compilers for Parallel Computing, pages 234--250. Springer-Verlag, August 1994.

No context found.

M.Burke,P.Carini,J.-D.Choi,andM.Hind. Flow-insensitive interprocedural alias analysis in the presence of pointers. In K. PingO---= U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors, Language and Compilers for Parallel Computing, 7th International Workshop, LNCS 892, pagL 234--250. SpringO= Verlag Au g 1994.

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