J.R. Larus and P.N. Hilfinger. Detecting conflicts between structure accesses. In SIGPLAN Conference on Programming Languages Design and Implementation, pages 21--34, New York, NY, 1988. ACM Press. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Interprocedural Slicing Using Dependence Graphs - Horwitz, Reps, Binkley (1990) (325 citations) (Correct)
....and constructs found in real world programming languages, 20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation (1979 1999) A Selection, 2003. Copyright 2003 ACM 1 58113 623 4 . 5.00. including arrays [4, 50, 29, 18, 32] reference parameters [20] pointers [28, 19, 10], non structured control flow [2, 11, 1, 46, 27] and threads [26, 15, 30] Context Sensitive Program Analysis Nowadays the interprocedural slicing method of the PLDI 88 paper would be termed a context sensitive interprocedural slicing method. In general, a context sensitive analysis is one in ....
J.R. Larus and P.N. Hilfinger. Detecting conflicts between structure accesses. In Conf. on Prog. Lang. Design and Impl., pages 21--34, New York, NY, 1988. ACM Press.
Existential Heap Abstraction Entailment is Undecidable - Kuncak, Rinard (2003) (1 citation) (Correct)
....for programs with general control flow, strengthening the consequence of Rice s theorem [28] to the case where all program statements are reachable. In contrast, our result shows that local analysis of a single statement is undecidable. Most shape analysis algorithms are non compositional [5, 16, 23, 30, 31] and many of them were originally used for program optimization. In such an analysis, the imprecision in heap property entailment can cause the analysis to perform some extra fixpoint iterations but may lead to a result that is su#ciently precise for program optimization. We choose a compositional ....
James R. Larus and Paul N. Hilfinger. Detecting conflicts between structure accesses. In Proc. ACM PLDI, Atlanta, GA, June 1988.
Parametric Shape Analysis via 3-Valued Logic - Mooly Sagiv Thomas (Correct)
No context found.
J.R. Larus and P.N. Hilfinger. Detecting conflicts between structure accesses. In SIGPLAN Conference on Programming Languages Design and Implementation, pages 21--34, New York, NY, 1988. ACM Press.
Recency-Abstraction for Heap-Allocated Storage Gogul.. - Comp Sci Dept (Correct)
No context found.
J.R. Larus and P.N. Hilfinger. Detecting conflicts between structure accesses. In Prog. Lang. Design and Impl., pages 21--34, 1988.
A Decidable Logic - For Describing Linked (Correct)
No context found.
J.R. Larus and P.N. Hilfinger. Detecting conflicts between structure accesses. In SIGPLAN Conference on Programming Languages Design and Implementation, pages 21--34, New York, NY, 1988. ACM Press.
The Journal of Supercomputing, 28, 91--117, 2004 - Run-Time Support For (Correct)
No context found.
J. Larus and P. Hilfinger. Detecting conflicts between structure accesses. In Proceedings of the Conference on Programming Language Design and Implementation, pp. 21--34, ACM, 1988.
On the Boolean Algebra of Shape Analysis Constraints - Kuncak, Rinard (2003) (Correct)
No context found.
James R. Larus and Paul N. Hilfinger. Detecting conflicts between structure accesses. In Proc. ACM PLDI, Atlanta, GA, June 1988.
Partially Disjunctive Heap Abstraction - Mooly (2004) (1 citation) (Correct)
No context found.
J. Larus and P. Hilfinger. Detecting conflicts between structure accesses. In Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, pages 21--34, New York, NY, 1988. ACM Press.
On the Boolean Algebra of Shape Analysis Constraints - Kuncak, Rinard (2003) (Correct)
No context found.
James R. Larus and Paul N. Hilfinger. Detecting conflicts between structure accesses. In Proc. ACM PLDI, Atlanta, GA, June 1988. 7
Alias Types for Recursive Data Structures - Walker, Morrisett (2000) (67 citations) (Correct)
No context found.
James R. Larus and Paul N. Hilfinger. Detecting conflicts between structure accesses. In ACM Conference on Programming Language Design and Implementation, pages 24-- 31, June 1988.
Partially Disjunctive Heap Abstraction - Roman Manevich Mooly (2004) (1 citation) (Correct)
No context found.
J. Larus and P. Hilfinger. Detecting conflicts between structure accesses. In Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, pages 21--34, New York, NY, 1988. ACM Press.
Partially Disjunctive Heap Abstraction - Manevich, Sagiv, Ramalingam, Field (2004) (1 citation) (Correct)
No context found.
J. Larus and P. Hilfinger. Detecting conflicts between structure accesses. In Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, pages 21--34, New York, NY, 1988. ACM Press.
Alias Types for Recursive Data Structures - Extended Version David (Correct)
No context found.
James R. Larus and Paul N. Hilfinger. Detecting conflicts between structure accesses. In ACM Conference on Programming Language Design and Implementation, pages 24-- 31, June 1988.
Data Structure Analysis: A Fast and Scalable Context-Sensitive .. - Lattner, Adve (2003) (1 citation) (Correct)
No context found.
J. R. Larus and P. N. Hilfinger. Detecting conflicts between structure accesses. In SIGPLAN Conference on Programming Language Design and Implementation, pages 21--34, July 1988.
Analysis of Multithreaded Programs - Rinard (2001) (13 citations) (Correct)
No context found.
J. Larus and P. Hilfinger. Detecting conflicts between structure accesses. In Implementation, Atlanta, GA, June 1988. ACM, New York.
Commutativity Analysis: A New Analysis Framework for.. - Rinard, Diniz (1996) (22 citations) (Correct)
No context found.
J. Larus and P. Hilfinger. Detecting conflicts between structure accesses. In Proceedings of the SIGPLAN '88 Conference on Program Language Design and Implementation, Atlanta, GA, June 1988.
Increasing the Accuracy of Shape and Safety Analysis of.. - Diniz (Correct)
No context found.
J. Larus and P. Hilfinger. Detecting conflicts between structure accesses. In Proceedings of the ACM SIGPLAN '88 Conference on Program Language Design and Implementation, pages 21--34, New York, NY, June 1988. ACM Press.
On the Boolean Algebra of Shape Analysis Constraints - Kuncak, Rinard (2004) (Correct)
No context found.
James R. Larus and Paul N. Hilfinger. Detecting conflicts between structure accesses. In Proc. ACM PLDI, Atlanta, GA, June 1988.
Symbolic Bounds Analysis of Pointers, Array Indices, and.. - Rugina, Rinard (2000) (1 citation) (Correct)
No context found.
J. Larus and P. Hilfinger. Detecting conflicts between structure accesses. In Proceedings of the SIGPLAN '88 Conference on Program Language Design and Implementation, Atlanta, GA, June 1988. ACM, New York.
Retaining Path-Sensitive Relations across Control-Flow Merges - Douglas Gregor Dept (Correct)
No context found.
J. R. Larus and P. N. Hilfinger. Detecting conflicts between structure accesses. In Proc. of the ACM SIGPLAN'88 Conf. on Programming Language Design and Implementation (PLDI), pages 21--34, July 1988. 16
The Use of Program Dependence Graphs in Software Engineering - Susan Horwitz And (1992) (6 citations) (Correct)
No context found.
Larus, J.R. and Hilfinger, P.N., "Detecting conflicts between structure accesses," Proceedings of the SIGPLAN 88 Conference on Programming Language Design and Implementation, (Atlanta, GA, June 2224, 1988), pp. 21-34 (June 1988).
Data Structure Analysis: A Fast and Scalable Context-Sensitive .. - Lattner, Adve (2003) (1 citation) (Correct)
No context found.
J. R. Larus and P. N. Hilfinger. Detecting conflicts between structure accesses. In ACM Conf. Prog. Lang. Design and Implementation, pages 21--34, July 1988.
Boolean Algebra of Shape Analysis Constraints - Kuncak, Rinard (2004) (Correct)
No context found.
James R. Larus and Paul N. Hilfinger. Detecting conflicts between structure accesses. In Proc. ACM PLDI, Atlanta, GA, June 1988.
Points-to Analysis for Java with Applications to Loop - Optimizations Peng Wu (Correct)
No context found.
J. Larus and P. Hilfinger. Detecting conflicts between structure accesses. In In Proceedings of the SIGPLAN '88 Conference on Program Language Design and Implementation, Atlanta, GA, june 1988.
the Garbage Collection Bibliography - Richard Jones (2003) (Correct)
No context found.
James R. Larus and Paul N. Hilfinger. Detecting conflicts between structure accesses. In PLDI [PLDI1988], pages 21--34.
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