James R. Larus and Paul N. Hil nger. Detecting con icts between structure accesses. In Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation, pages 21-34, Atlanta, Georgia, June 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....is the incorporation of client analysis information into procedure level pointer alias summaries [81] Clientdriven pointer analyses may also be able to selectively apply more aggressive approaches to obtaining precision, such as those of [68] 4. 6 Heap Modeling Shape analysis algorithms [53, 43, 9, 19, 36, 35, 18, 74, 28, 29, 87, 88, 89, 103, 21, 54] have demonstrated high precision, over schemes that name objects based on allocation site (as in [47, 44, 83, 43, 9] but their scalability to even medium programs is uncertain. Mooly Sagiv summarizes the current state of the eld: Although I believe we are making good progress, in all honesty, ....

J. R. Larus and P. N. Hil nger. Detecting con icts between structure accesses. In Proceedings of the ACM SIGPLAN'88 Conference on Programming Language Design and 23(7), July 1988.

....data structures is one of the key factors that make the implication of regular graph constraints undecidable. The idea of representing properties of a statically unbounded number of heaps by homomorphically mapping them to a bounded family of graphs is pervasive in the work on shape analysis [16, 2, 11, 19, 20]. These analyses use abstractions that capture approximate properties of data structures even if they are not tree like. This feature of shape analyses makes our results directly applicable. Our undecidability result implies inability to semantically check implication or equivalence of such ....

J. Larus and P. Hil nger. Detecting con icts between structure accesses. In Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation, Atlanta, GA, June 1988.

....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 ....

James R. Larus and Paul N. Hil nger. Detecting con icts between structure accesses. pages 24-31, June 1988.

....analyzes a program to determine information about the heap allocated data structures that the program manipulates. The analysis algorithm is conservative, i.e. the discovered information is true for every input. The information can be used to understand, verify, optimize [GH98] or parallelize [LH88, Hen90, AW93, PCK93, Zap99] programs. For example, it can be utilized to check at compile time for the absence of certain types of memory management errors, such as memory leakage or dereference of null pointers [DRS98, DRS00] In the past two decades, many shape analysis algorithms have been developed [JM81, JM82, LH88, ....

....AW93, PCK93, Zap99] programs. For example, it can be utilized to check at compile time for the absence of certain types of memory management errors, such as memory leakage or dereference of null pointers [DRS98, DRS00] In the past two decades, many shape analysis algorithms have been developed [JM81, JM82, LH88, HPR89, CWZ90, Str92, AW93, PCK93, Wan94, SRW98]. The quality , and thus the usability, of the information these algorithms can determine relies on the assumption that the number of variables is xed. When this assumption is violated, as is the case when recursive procedures are used, the quality of the results, as well as the cost, of these ....

[Article contains additional citation context not shown here]

J.R. Larus and P.N. Hilnger. Detecting con icts between structure accesses. In SIGPLAN Conf. on Prog. Lang. Design and Impl., pages 21-34, New York, NY, 1988. ACM Press.

....analyzes a program to determine information about the heap allocated data structures that the program manipulates. The analysis algorithm is conservative, i.e. the discovered information is true for every input. The information can be used to understand, verify, optimize [6] or parallelize [1, 8, 12] programs. For example, it can be utilized to check at compile time for the absence of certain types of memory management errors, such as memory leakage or dereference of null pointers [5] This paper addresses the problem of shape analysis in the presence of recursive procedures. This problem is ....

....of recursive calls, di erent incarnations of a local variable may point to the same heap cell. The ability to have distinctions between invisible instances of variables based on their local properties is the reason for the di erence in precision between our method and the methods described in [1, 2, 7, 8, 12, 14]. In Sect. 4, we also exploit properties that capture relationships between the stack and the heap. In many cases, the ability to have these distinctions also leads to a more ecient analysis. Technically, these properties and the analysis algorithm itself are explained (and implemented) using the ....

J.R. Larus and P.N. Hilnger. Detecting con icts between structure accesses. In SIGPLAN Conf. on Prog. Lang. Design and Impl., pages 21-34, 1988.

.... Mooly Sagiv et al. 1. INTRODUCTION In the past two decades, many shape analysis algorithms have been developed that can automatically create di erent classes of shape descriptors for programs that perform destructive updating on dynamically allocated storage [Jones and Muchnick 1981; 1982; Larus and Hil nger 1988; Horwitz et al. 1989; Chase et al. 1990; Stransky 1992; Assmann and Weinhardt 1993; Plevyak et al. 1993; Wang 1994; Sagiv et al. 1998] A common feature of these algorithms is that they represent the set of possible memory states ( stores ) that arise at a given point in the program by shape ....

....abstract interpretation process always terminates. The Embedding Theorem implies that the results obtained are conservative. By de ning appropriate instrumentation predicates, it is possible to emulate some previous shape analysis algorithms (e.g. Chase et al. 1990; Jones and Muchnick 1981; Larus and Hil nger 1988; Horwitz et al. 1989] Unfortunately, there is also bad news: the method described above and illustrated in Fig. 9 can be very imprecise. For instance, the statement y = y n illustrated in Fig. 9 sets y to the value of y n; i.e. it makes y point to the next element in the list. In the ....

Larus, J. and Hilfinger, P. 1988. Detecting con icts between structure accesses. In SIGPLAN Conf. on Prog. Lang. Design and Impl. ACM Press, New York, NY, 21-34.

....is the rst to demonstrate that a ow insensitive analysis accommodating complete C features can handle programs of more than 200,000 lines of code. Besides resolving aliases for general pointer dereferences, a lot of researchers have focused on obtaining detailed descriptions for heap objects [37, 38, 39, 40, 41, 11]. Our algorithm can only provide a safe approximation but not a detailed pro le. 6 Conclusions In this paper we have presented an ecient and e ective modular interprocedural pointer analysis algorithm for C programs. Our algorithm can calculate ow insensitive and context sensitive summary ....

J. R. Larus and P. N. Hilnger, \Detecting con icts between structure accesses," in Proceedings of the ACM SIGPLAN '88 Conference on Programming Language Design and Implementation, pp. 21-34, July 1988.

....analysis is how to abstract from the statically unknown number of heap objects, especially from those belonging to an instance of an abstract data type, to a nite number of objects that can be manipulated during the analysis. Here the methods di er. Methods using k limitation as [JM81] or [LH88] just coalesce in their analysis all paths that are longer than a xed constant k. Consequently the value of the analysis is heavily dependent on that k; larger values improve the results but may slow down the analysis signi cantly. Methods using abstract storage locations, e.g. JM82] ....

J. R. Larus and P. N. Hilnger. Detecting con- icts between structure accesses. In ACM Sigplan Conf. on Programming Language Design and Implementation, June 1988.

....FORTRAN90. The pointer analysis problem can be divided into 2 distinct subproblems: 1) disambiguating pointers that point to objects on the stack, and (2) disambiguating pointers that point to objects on the heap. There has been a considerable amount of work in both of these areas [JM81, JM82, LH88, Lar91, Gua88, HPR89, Har89, CWZ90, HN90, LR92, CBC93, Deu92, Deu94, PCK93, EGH94, WL95, Ruf95] although more attention has been paid to actually implementing methods that work well for stack allocated objects [LR92, CBC93, EGH94, Ruf95, WL95] A complete discussion and comparison of these ....

James R. Larus and Paul N. Hilnger. Detecting con icts between structure accesses. In Proc. of the SIGPLAN '88 Conf. on Programming Language Design and Implementation, pages 21-34, Atlanta, Georgia, Jun. 1988.

....location. Consequently, any modi cation to the value stored at the location corresponding to a will result in the modi cation of the value stored at the location corresponding to b, and vice versa. In this case, a and b are said to be aliased. We call expressions such as a, and b, access paths ([10]) More precisely, an access path is the l value of an expression constructed from variables, pointer dereferences, and structure eld selection operators. The aliasing of a and b is represented by the alias pair h a; bi. An alias relation R at statement S is a set of alias pairs hx; yi. Such a ....

J. R. Larus and P. N. Hilnger. Detecting con icts between structure accesses. In Programming Language Design and Implementation, pages 21-34, 1988.

No context found.

James R. Larus and Paul N. Hil nger. Detecting con icts between structure accesses. In Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation, pages 21-34, Atlanta, Georgia, June 1988.

No context found.

James R. Larus and Paul N. Hil nger. Detecting con icts between structure accesses. In Proc. ACM PLDI, Atlanta, GA, June 1988.

No context found.

J.R. Larus and P.N. Hil nger. Detecting con icts between structure accesses. In 1988. ACM Press.

No context found.

James R. Larus and Paul N. Hil nger. Detecting con icts between structure accesses. In Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation, pages 21-34, Atlanta, Georgia, June 1988.

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