N.D. Jones and S.S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In Symp. on Princ. of Prog. Lang., pages 66-- 74, 1982.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....[ e] and e e 1. F j= e ] 2. F(lab(e ) F(lab(e) A general technique for proving such a theorem is presented in [WW02] The semantics is presented as a reduction system for labelled expressions, in which each expression or value is labelled with its origin (an idea dating back to [JM82]) The proof relies on a local structure heuristic: e] depends only on local structure of e. The local structure of e is not much different from that of e. Hence the constraints in [ e ] are not much different from those in [ e] So the proof just needs to account for the differences. ....

Neil D. Jones and Steven S. Muchnick. A flexible approach to interprocedural data flow analysis and progrms with recursive data structures. In Conf. Rec. 9th ACM Symposium on Principles of Programming Languages, pages 66--74, 1982.

....versus variables names to distinguish client heap cells. The variable names approach [37, 33] merges two heap nodes if the set of variables and fields pointed to them are the same. The allocation site approach merges two nodes if they are allocated at the same allocation site in the client program [6, 21]. Our empirical observations were as follows: i) The independent attribute approach yielded an implementation that was as precise as the relational one, and faster. We believe that the precision of the independent attribute approach is due to the disjunctive abstractions we use as ....

N. Jones and S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In Proc. ACM Symp. on Principles of Programming Languages, pages 66--74, NewYork, NY, 1982. ACM Press.

....constraint systems, thus propagating data flow information between the constraint systems for the various program components. The resulting solution yields invariants characterizing the runtime behavior of the entire program. A number of researchers, including Reynolds [39] Jones and Muchnick [29], Heintze [24] Aiken [2] and Cousot and Cousot [7] previously exploited the relationship between RTGs and the least solution of a constraint system. We present an additional result, namely a connection between RTGs and the observable behavior (i.e. the entire solution space) of constraint ....

Jones, N., and Muchnick, S. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages (January 1982), pp. 66--74.

....the analyzer would have to return the same heap name for all calls to the allocator. Another solution would be to allow the user to specify what calls allocate memory. This would accurately split the heap for all memory allocators. Another popular approach to splitting the heap is k limitig[13]. This approach allows up to k copies of a heap name to be generated where k is pre determined. The goal of the k limitcl approach is to allow for more accurate analysis of heap structures. If we have a heap allocated linked list, the first k 1 nodes can be given unique names and the rest of the ....

N.D. Jones and S.S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. Coferece Record of the Nith Aual A CM 'ymposium o Priciples of Programmi,g La,guages, 8(6):66 74, January 1982.

....Horwitz et al. 25] while Landi and Ryder [30] consider this to be the problem of restricting the propagation of information along realizable interprocedural execution paths. One traditional solution to this problem has been to include some context information in the abstraction being calculated [27]. Typical examples of this approach include: memory components [34] procedure strings [18, 19] assumed alias sets [30] and source alias sets with the last call site [7] Rather than embedding the context in the abstraction being estimated, we have chosen to follow a different strategy where we ....

N. D. Jones and S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, pages 66--74, January 1982.

....constraint systems, thus propagating data flow information between the constraint systems for the various program components. The resulting solution yields invariants characterizing the runtime behavior of the entire program. y A number of researchers, including Reynolds [39] Jones and Muchnick [29], Heintze [24] Aiken [2] and Cousot and Cousot [7] previously exploited the relationship between RTGs and the least solution of a constraint system. We present an additional result, namely a connection between RTGs and the observable behavior (i.e. the entire solution space) of constraint ....

Jones, N., and Muchnick, S. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages (January 1982), pp. 66--74.

....the meet over all paths solution of a data flow problem [Kil73, MR90b] For interprocedural data flow analysis, not all paths in the usual graph representation correspond to real program executions. A realizable path is a path on which every procedure returns to the call site which invoked it [JM82b, LR92, RHS95, SP81] Paths on which a procedure does not return to the call site which invoked it are unrealizable and can never happen in an actual execution. setjump and longjump are not allowed in the C programs analyzed. A fundamental problem of interprocedural analysis is how to restrict ....

....schema defines a family of algorithms which determine modification side e#ects to fixed locations at program points. A fixed location is either an user defined variable or a heap storage creation site. Each individual dynamically allocated fixed location is identified by the site that created it [JM82b, RM88] therefore, whereas two fixed locations created at the same allocation site are not distinguishable, those created at di#erent sites are. Fixed locations are so named because the relation between a fixed location and the storage location to which it refers, is unchanging during execution. ....

[Article contains additional citation context not shown here]

N. D. Jones and S. S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, pages 66--74, January 1982.

....can be used to compute the may definitions of an assignment in static program slicing or to verify the independence of two pointer references to enable an optimization. Precise pointer analysis is computationally difficult [LH88, LR92] The high cost of flow sensitive approaches [Wei80, JM81, JM82, CWZ90, HN90, LR92, HEGV93] has led to the development of flow insensitive techniques [Ste96, And94, SH97] which are often nearly as precise for a fraction of the cost [HP98] Shape analysis is a static analysis that infers properties of pointer structures that could be used by programmers as ....

Neil D. Jones and Steve S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In POPL, pages 66--74, January 1982.

....not tight; it is possible that a closer examination of the algorithm (or a better algorithm) could reduce the time bound. 5. 10 Related work Though the SCG was derived from the value flow analysis used in the SETL compiler, it bears a strong resemblance to analysis proposed by Jones and Muchnick [JM82] There they use abstract interpretation [CC77, Myc81] to construct approximations to values appearing at definition sites. These approximations can be regarded as regular tree languages describing the values that can appear at the definition sites. The grammar for the regular tree language is ....

Neil D. Jones and Steven S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In Conf. Record of the Ninth Annual Symposium on Principles of Programming Languages, pages 66--74, 1982.

....computation states. Regular approximations could be applied as the abstraction in off line partial evaluation but is not discussed in this paper. Related ideas for binding time analysis using tree grammars have been used by Mogensen [21] Also, regular tree grammars were used by Jones and Muchnick [11] to analyse interprocedural data flow for programs with recursive data structures such as the structure of the stack of activation records in a language interpreter. In on line partial evaluation generalisation is applied whenever some state is recognised as being a version, according to some ....

N. D. Jones and S. S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In A. Press, editor, Conference Record of the Ninth Symposium on Principles of Programming Languages, pages 66--74, 1982.

....also be possible to allow arrays to contain arrays (thus generalizing lists) if one used the abstraction that any element selected from the array must be considered as a likely candidate for the subarray. Reasoning about the structure of such composite objects is more difficult; Jones and Muchnick [7] provide such a treatment for lists. 6 The original challenge to solve this problem functionally and efficiently was posed in January 1985 by Daniel Friedman. 17 It is interesting to note that since our model has a store component, local side effects may be easily handled. However, a ....

N.D. Jones and S.S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In 9th ACM Sym. on Prin. of Prog. Lang., pages 66--74, ACM, January 1982.

....Paths on which a procedure does not return to the call site which invoked it, are unrealizable and can never happen in an actual execution. A fundamental problem of interprocedural analysis is how to restrict the propagation of data flow information to realizable paths. Jones and Muchnick[JM82] give a general approach for handling this problem for abstract interpretations, which is also valid for data flow analysis. They associate with each data flow fact, an abstraction of the run time stack on paths on which the fact is created. This abstraction, created at procedure entry, is used at ....

N. D. Jones and S. S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, pages 66--74, January 1982.

No context found.

N.D. Jones and S.S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In Symp. on Princ. of Prog. Lang., pages 66-- 74, 1982.

No context found.

N.D. Jones and S.S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In POPL, pages 66--74, 1982.

No context found.

N.D. Jones and S.S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In ACM Symposium on Principles of Programming Languages, pages 66--74, New York, NY, 1982. ACM Press.

No context found.

N.D. Jones and S.S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In Princip. of Prog. Lang., pages 66--74, 1982.

No context found.

N.D. Jones and S.S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In ACM Symposium on Principles of Programming Languages, pages 66--74, New York, NY, 1982. ACM Press.

No context found.

N.D. Jones and S.S. Muchnick. A flexible approach to interprocedural data-flow analysis and programs with recursive data structures. In Proc. POPL, pages 66--74. ACM, 1982.

No context found.

Jones, N. D. and S. S. Muchnick: 1982, `A Flexible ApproachtoInterprocedural Data Flow Analysis and Programs with Recursive Data Structures'. In: A. Press #ed.#: ConferenceRecord of the Ninth Symposium on Principles of Programming Languages. pp. 66#74.

No context found.

N. D. Jones and S. S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In Principles of Programming Languages, POPL'82, pages 66--74, 1982.

No context found.

N. D. Jones and S. S. Muchnick, "A Flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures", Ninth ACM Symposium on Principles of Programming Languages, 1982, 66-74.

No context found.

Jones, N., Muchnick, S.: A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In: Princ. of Prog. Lang. (1982) 66--74

No context found.

Neil Jones and Steven Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In 9th ACM Symposium on Principles of Programming Languages, pages 66--74, Albuquerque, NM, January 1982.

No context found.

N. D. Jones and S. S. Muchnick. Flexible approach to interprocedural data flow analysis and programs with recursive data structures. In Proc. 9th ACM POPL, 1982.

No context found.

N. Jones and S. Muchnick. A flexible approach to interprocedural data flow analysis and programs with recursive data structures. In In Proc. of the ACM SIGPLAN conf. on Principles of Programming Languages, 1982.

First 50 documents  Next 50

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