| Rakesh Ghiya and Laurie J. Hendren. Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C. In Conference Record of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'96), pages 1--15, St. Petersburg, Florida, January 21--24, 1996. ACM Press. |
No context found.
Rakesh Ghiya and Laurie J. Hendren. Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C. In POPL'96, pages 1--15, St. Petersburg Beach, Florida, 21--24 January 1996.
No context found.
Rakesh Ghiya and Laurie J. Hendren. Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C. In Conference Record of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'96), pages 1--15, St. Petersburg, Florida, January 21--24, 1996. ACM Press.
No context found.
R. Ghiya and L. J. Hendren. Is it a tree, a dag, or a cyclic graph? A shape analysis for heap-directed pointers in C. In POPL, 1996.
No context found.
R. Ghiya and L. J. Hendren. Is it a Tree, a DAG, or a Cyclic Graph? A Shape Analysis for Heap-Directed Pointers in C. In Proceedings of the 23rd ACM SIGPLANSIGACT Symposium on Principles of Programming Languages, pages 1-15, 1996.
No context found.
Rakesh Ghiya and L. J. Hendren. Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C. In ACM Symposium on Principles of Programming Languages (POPL '96), pages 1--15, 1996.
No context found.
R. Ghiya and L. Hendren. Is it a tree, a DAG or a cyclic graph? a shape analysis for heap-directed pointers in C. In Proceedings of the 23rd Annual ACM Symposium on the Principles of Programming Languages, pages 1--15, Jan. 1996.
No context found.
R. Ghiya and L. J. Hendren. Is it a tree, a dag, or a cyclic graph? A shape analysis for heap-directed pointers in C. In Symposium on Principles of Programming Languages POPL, pages 1--15, St. Petersburg, Florida, Jan 1996. ACM.
No context found.
Rakesh Ghiya and Laurie J. Hendren. Is it a tree, a dag, or a cyclic graph? A shape analysis for heap-directed pointers in C. In Symposium on Principles of Programming Languages POPL, pages 1--15, St. Petersburg, Florida, Jan 1996. ACM.
No context found.
Rakesh Ghiya and Laurie J. Hendren. Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C. In Proceedings of the 23rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 1-15, St. Petersburg Beach, FL, January 21-24, 1996.
No context found.
Rakesh Ghiya and Laurie J. Hendren. Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C. In Twenty-Third ACM Symposium on Principles of Programming Languages, pages 1--15, St. Petersburg Beach, Florida, January 1996.
No context found.
R. Ghiya and L. J. Hendren. Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C. In POPL'96, pages 1--15, 21--24 Jan. 1996.
No context found.
Rakesh Ghiya and Laurie J. Hendren. Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C. In Twenty-Third ACM Symposium on Principles of Programming Languages, pages 1--15, St. Petersburg Beach, Florida, January 1996.
No context found.
R. Ghiya and L. Hendren. Is it a tree, a DAG or a cyclic graph? a shape analysis for heap-directed pointers in C. In Proceedings of the 23rd Annual ACM Symposium on the Principles of Programming Languages, pages 1--15, Jan. 1996.
No context found.
R. Ghiya and L. Hendren. A shape analysis for heap-directed pointers in C. In Proc. 23rd Principles of Programming Languages, pages 1--15, 1996.
No context found.
R. Ghiya and L. J. Hendren. Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C. In pages 1--15, 1996.
No context found.
Rakesh Ghiya and Laurie J. Hendren. Is it a tree, a DAG, or a cyclic graph? a shape analysis for heap-directed pointers in C. In Proceedings of the 23th Annual ACM Symposium on Principles of Programming Languages, January 1996.
No context found.
R. Ghiya and L. Hendren. Is it a tree, a DAG or a cyclic graph? a shape analysis for heap-directed pointers in C. In Proceedings of the 23rd Annual ACM Symposium on the Principles of Programming Languages, pages 1--15, Jan. 1996.
No context found.
R. Ghiya and L. Hendren. Is it a tree, a DAG or a cyclic graph? A shape analysis for heap-directed pointers in C. In Proceedings of the 23rd Annual ACM Symposium on the Principles of Programming Languages, pages 1--15, Jan. 1996.
No context found.
R. Ghiya and L. J. Hendren. Is it a tree, a dag, or a cyclic graph? a shape analysis for heap-directed pointers in c. In Proc. of the 23rd ACM/SIGPLAN SIGACT Symp. on Principles of Programming Languages, January 1996.
No context found.
Rakesh Ghiya and Laurie J. Hendren. Is it a tree, a dag, or a cyclic graph? a shape analysis for heap-directed pointers in c. In Proc. of the 23rd ACM/SIGPLAN SIGACT Symp. on Principles of Programming Languages, January 1996.
No context found.
Rakesh Ghiya and Laurie J. Hendren. Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C. In Conference Record of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Langualges (POPL), pages 1--15, St. Petersburg, Florida, January 1996.
No context found.
R. Ghiya and L. Hendren. Is it a Tree, a DAG, or a Cyclic Graph? a shape analysis for heap-directed pointers in C. In Proceedings of the Twenty-third Annual ACM Symposium on the Principles of Programming Languages, pages 1--15, New York, NY, January 1996. ACM Press.
No context found.
R. Ghiya and L. Hendren. Is is a tree, a DAG or a cyclic graph? a shape analysis for heap-directed pointers in C. In Proceedings of the 23rd Annual ACM Symposium on the Principles of Programming Languages, pages 1--15, January 1996.
No context found.
R. Ghiya and L. J. Hendren. Is it a tree, a dag, or a cyclic graph? a shape analysis for heap-directed pointers in c. In Porceedings of POPL 1996, pages 1-15, 1996.
No context found.
Rakesh Ghiya and Laurie J. Hendren. Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C. In Conference Record of the 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'96), pages 1--15, St. Petersburg, Florida, January 21--24, 1996. ACM Press.
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