Alain Deutsch. Interprocedural May-Alias analysis for pointers: Beyond k-limiting. SIGPLAN Notices, 29(6):230--241, June 1994. Proceedings of the ACM SIGPLAN '94 Conference on Programming Language Design and Implementation. (pp 3, 4)  Home/Search   Document Not in Database   Summary   Related Articles   Check

....result. There are at least four types of analyses that fall into this category: points to analyses, alias analyses, escape analyses, and shape analyses. A points to analysis, e.g. 5] identifies the memory locations which are pointed to by a specific pointer variable. An alias analysis, e.g. [9], determines the pairs of pointer expressions which are aliased, i.e. point to the same memory location. An escape analysis, e.g. 4] detects the memory locations that escape a given scope; the scope of such an analysis is usually a method, but other alternatives are possible: the current ....

....static analysis is an interesting problem. Some analyses, including ours, model the heap as a points to graph of bounded size [5, 10, 26, 16, 6] Other analysis do not use any graph at all: they either work with a set of pairs of aliased heap paths, i.e. paths that lead to the same object, e.g. [9], or use some other idea, e.g. 4] In general, storing a points to graph requires less memory space than storing the set of aliased paths from it: by standard graph theory, the number of paths is asymptotically bigger than the number of edges. Also, the points to graphs have the advantage of ....

[Article contains additional citation context not shown here]

Alain Deutsch. Interprocedural may-alias analysis for pointers: beyond k- limiting. In Proc. ACM PLDI, 1994.

.... defined in terms of monomial relations (a kind of multi variable polynomial expression with structure accessors as the variables) The analysis is therefore only relevant for strongly typed languages such as ML and strongly typable programs written in weakly typed languages such as C (as shown in [Deu94]) Access paths are combined by unification. A higher order (context sensitive) points to analysis by type inference has been developed by Tofte and Talpin for the purposes of creating an ML interpreter without a garbage collector [TT94] The analysis is based on polymorphic type inference over a ....

Alain Deutsch. Interprocedural may-alias analysis for pointers: Beyond k-limiting. In S1GPLAN'94: Conference on Programming Language Design and Implementation, pages 23(241, June 20-24 1994.

....to the type system is a mechanism for combining recursive type operators with rst class store abstractions that represent repeated patterns of aliasing. In this respect, our work is inspired by the more complex approaches to alias and shape analysis that have recently appeared in the literature [11, 12, 33]. The generalization to recursive datatypes opens the door for users or certifying compilers to have far more control over the memory management of complex data structures. To demonstrate this fact, we show how two classes of space optimization can be encoded in a language based on recursive ....

....implement a theorem prover to check the safety of programs. Consequently, we have found it straightforward to integrate alias types with our Typed Assembly Language implementation [38] There are also similarities between our research and work on alias analysis techniques for imperative languages [18, 21, 11, 12, 33]. Our type system appears most closely related to the shape analysis developed by Sagiv, Reps, and Wilhelm (SRW) 33] which has also been used to develop sophisticated pointer logics [34, 4] Although the precise relationship is currently unknown to us, it is clear that several of the key ....

Alain Deutsch. Interprocedural may-alias analysis for pointers: Beyond k-limiting. In ACM Conference on Programming Language Design and Implementation, pages 230-241, Orlando, June 1994.

....A common use of pointers in C programs is to track the addresses of data structures that have been dynamically allocated on the heap. Thus, much effort described in the literature has been directed at discovering and representing the shape of pointer based structures constructed in the heap [8, 4, 17, 12]. From our perspective, the issue of understanding the internal structure of the heap is orthogonal to the rest of the analyzer. The simplest solution available to us would model the whole heap with a single name. All loads and stores involving the heap would refer to this name. Since the name ....

Alain Deutsch. Interprocedural may-alias analysis for pointers: Beyond k-limiting. 5'IGPLAN Notices, 29(6):230 241, June 1994.

....separates them from earlier work on e#ects systems. However, capabilities only express the simplest aliasing relationships: a region is either completely unaliased or it may alias any other region. Our capabilities reveal very little of the structure of the store. A number of other researchers [10, 7, 32] have studied static analyses that infer the shapes of data structures and the aliasing relationships between them. We plan to investigate how to use these finergrained memory models to increase the flexibility of our type system. A connection can also be drawn between capabilities and monadic ....

Alain Deutsch. Interprocedural may-alias analysis for pointers: Beyond k-limiting. In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 230--241, Orlando, June 1994.

....on data ow machines [Pap88, Tra86, Hel89] could dispense with this feature because it was handling functional languages. For instance, two store instructions that have no data dependency between them cannot be reordered if they may update the same memory location. Alias analysis (e.g. HT01, Deu94, WL95, Ste96, SH97] commutativity analysis [RD97] and other side e ect analysis (e.g. RR00] techniques can be used to remove unnecessary tokens between instructions with side e ects which are provably independent, unleashing more parallelism. The side e ect operations will thus execute only ....

Alain Deutsch. Interprocedural may-alias analysis for pointers: beyond k-limiting. In Proceedings of the ACM SIGPLAN '94 conference on Programming language design and implementation, pages 230-241, 1994.

....fails to do. None of the above approaches have been completely formalised, despite considerable effort. We have a sound formalisation and proven alias protection guarantees. Much work has been done in program language semantics in proposing means for coping with pointers and references including [27, 13, 41, 30, 21, 5, 8, 7, 46]. Special reference attachment mechanisms have been proposed for language run time systems to enforce unique or linear pointers [6, 11, 34, 20, 28] Unfortunately, these proposals forbid many common uses of aliasing in object oriented programs. A common approach to preventing representation ....

Alain Deutsch. Interprocedural May-Alias Analysis for Pointers: Beyond k-limiting. In Proceedigns of the ACM SIGPLAN'94 Conference on Programming Language Design and Implementation, June 1994.

....9] so they are unable to express many common uses of aliasing in object oriented programs. Static alias analysis has similarly long been of interest to compiler writers, even since programming languages began to permit aliasing. Whole programs can be analysed directly to detect possible aliasing [27, 16, 25], or hints may be given to the compiler as to probable aliasing invariants [22] Static analysis techniques have also been developed to optimise locking in concurrent languages, particularly Java [11, 6, 7, 2, 38] This work is typically based around escape analysis and removes exclusion from ....

Alain Deutsch. Interprocedural May-Alias Analysis for Pointers: Beyond k-limiting. In Proceedigns of the ACM SIGPLAN'94 Conference on Programming Language Design and Implementation, June 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 ....

Alain Deutsch. Interprocedural may-alias analysis for pointers: Beyond k-limiting. In of the ACM SIGPLAN '94 on Programming Language Design and Implementation, June 1994.

No context found.

Alain Deutsch. Interprocedural may-alias analysis for pointers:beyond k-limiting. In In Proceedings of the ACM SIGPLAN '94 Conference on Programming Language Design and Implementation., June 1994.

No context found.

Alain Deutsch. Interprocedural May-Alias analysis for pointers: Beyond k-limiting. SIGPLAN Notices, 29(6):230--241, June 1994. Proceedings of the ACM SIGPLAN '94 Conference on Programming Language Design and Implementation. (pp 3, 4)

No context found.

Alain Deutsch. Interprocedural may-alias analysis for pointers: beyond k-limiting. In Proc. ACM PLDI, 1994.

No context found.

Alain Deutsch. Interprocedural may-alias analysis for pointers: beyond k-limiting. In Proc. ACM PLDI, 1994. 7

No context found.

Alain Deutsch. Interprocedural may-alias analysis for pointers: Beyond k-limiting. In ACM Conference on Programming Language Design and Implementation, pages 230--241, Orlando, June 1994. 11

No context found.

Alain Deutsch. Interprocedural may-alias analysis for pointers: Beyond k-limiting. In ACM Conference on Programming Language Design and Implementation, pages 230--241, Orlando, June 1994.

No context found.

Alain Deutsch. Interprocedural may-alias analysis for pointers: Beyond k-limiting. In ACM Conference on Programming Language Design and Implementation, pages 230--241, Orlando, June 1994. 11

No context found.

Alain Deutsch. Interprocedural may-alias analysis for pointers: Beyond klimiting. In Proceedings of the ACM SIGPLAN'94 Conference on Programming Language Design and Implementation, pages 230-241, June 1994.

No context found.

Alain Deutsch. Interprocedural may-alias analysis for pointers: beyond k-limiting. ACM SIGPLAN Notices, 29(6):230--241, 1994.

No context found.

A. Deutsh, "Interprocedural may-alias analysis for pointers: Beyond k-limiting," in Proc. ACM SIGPLAN'94 Conf. Programming Language Design and Implementation, June 1994, pp. 230--241.

No context found.

Alain Deutsch. Interprocedural may-alias analysis for pointers: beyond k-limiting. In Proc. ACM PLDI, 1994.

No context found.

Alain Deutsch. Interprocedural May-Alias analysis for pointers: Beyond k-limiting. SIGPLAN Notices, 29(6):230--241, June 1994. Proceedings of the ACM SIGPLAN '94 Conference on Programming Language Design and Implementation. (pp 3, 4)

No context found.

Alain Deutsch. Interprocedural may-alias analysis for pointers: Beyond k-limiting. In Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, pages 230--241. ACM Press, 1994.

No context found.

Alain Deutsch. Interprocedural May-Alias analysis for pointers: Beyond k-limiting. In Proceedings of the ACMSIGPLAN 1994.

No context found.

Alain Deutsch. Interprocedural may-alias analysis for pointers: beyond k-limiting. ACM SIGPLAN Notices,

No context found.

Alain Deutsch. Interprocedural may-alias analysis for pointers: beyond k- limiting. ACM SIGPLAN Notices, 29(6):230-241, 1994. 98

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