Shape types

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Shape types

Full text

Pdf (895 KB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents

Paris, France

Pages: 27 - 39

Year of Publication: 1997

ISBN:0-89791-853-3

Authors

Pascal Fradet	IRISA/INRIA, Campus de Beaulieu, 35042 Rennes, France
Daniel Le Métayer	IRISA/INRIA, Campus de Beaulieu, 35042 Rennes, France

Sponsors

L'Ecole des Mines de Paris : L'Ecole des Mines de Paris
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Ctr Natl de la Recherche Sci :
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 24, Citation Count: 11

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/263699.263706 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	L. Andersen, Program analysis and specialization .for the C programming language, Ph.D Thesis, DIKU, University of Copenhagen, May 1994.
	2	Jean-Pierre Banâtre , Daniel Le Métayer, Programming by multiset transformation, Communications of the ACM, v.36 n.1, p.98-111, Jan. 1993 [doi>10.1145/151233.151242]
	3	David R. Chase , Mark Wegman , F. Kenneth Zadeck, Analysis of pointers and structures, ACM SIGPLAN Notices, v.25 n.6, p.296-310, Jun. 1990
	4	Thomas T. Cormen , Charles E. Leiserson , Ronald L. Rivest, Introduction to algorithms, MIT Press, Cambridge, MA, 1990
	5	Brouno Courcelle, Graph rewriting: an algebraic and logic approach, Handbook of theoretical computer science (vol. B): formal models and semantics, MIT Press, Cambridge, MA, 1991
	6	P. Della Vigna and C. Ghezzi, Context-free graph grammars, Information and Control, Vol. 37, pp. 207- 233, 1978.
	7	Alain Deutsch, Semantic models and abstract interpretation techniques for inductive data structures and pointers, Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.226-229, June 21-23, 1995, La Jolla, California, United States [doi>10.1145/215465.215594]
	8	P. Fradet and D. Le MStayer, Structured Gamma, Irisa Research Report PI-989, March 1996.
	9	Pascal Fradet , Ronan Caugne , Daniel Le Métayer, Static Detection of Pointer Errors: An Axiomatisation and a Checking Algorithm, Proceedings of the 6th European Symposium on Programming Languages and Systems, p.125-140, April 22-24, 1996
	10	Rakesh Ghiya , Laurie J. Hendren, Is it a tree, a DAG, or a cyclic graph? A shape analysis for heap-directed pointers in C, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.1-15, January 21-24, 1996, St. Petersburg Beach, Florida, United States [doi>10.1145/237721.237724]
	11	J. Grosch, Tool support.for data structures, Structured Programming, Vol. 12, pp. 31-38, 1991.
	12	Laurie J. Hendren , Joseph Hummell , Alexandru Nicolau, Abstractions for recursive pointer data structures: improving the analysis and transformation of imperative programs, Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation, p.249-260, June 15-19, 1992, San Francisco, California, United States
	13	Joseph Hummel , Laurie J. Hendren , Alexandru Nicolau, Abstract description of pointer data structures: an approach for improving the analysis and optimization of imperative programs, ACM Letters on Programming Languages and Systems (LOPLAS), v.1 n.3, p.243-260, Sept. 1992 [doi>10.1145/151640.151644]
	14	N. Jones and S. Muchnick, Flow analysis and optimization of Lisp-like structures, in Program Flow Analysis: Theory and Applications, New Jersey 1981, Prentice-Hall, pp. 102-131.
	15	Nils Klarlund , Michael I. Schwartzbach, Graph types, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.196-205, March 1993, Charleston, South Carolina, United States [doi>10.1145/158511.158628]
	16	Nils Klarlund , Michael I. Schwartzbach, Graphs and Decidable Transductions Based on Edge Constraints (Extended Abstract), Proceedings of the 19th International Colloquium on Trees in Algebra and Programming, p.187-201, April 11-13, 1994
	17	William Landi , Barbara G. Ryder, Pointer-induced aliasing: a problem taxonomy, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.93-103, January 21-23, 1991, Orlando, Florida, United States [doi>10.1145/99583.99599]
	18	William Pugh, Skip lists: a probabilistic alternative to balanced trees, Communications of the ACM, v.33 n.6, p.668-676, June 1990 [doi>10.1145/78973.78977]
	19	Jean-Claude Raoult , Frédéric Voisin, Set-Theoretic Graph Rewriting, Proceedings of the International Workshop on Graph Transformations in Computer Science, p.312-325, January 01, 1993
	20	James R. Russell , Robert E. Strom , Daniel M. Yellin, A checkable interface language for pointer-based structures, ACM SIGPLAN Notices, v.29 n.8, p.59-73, Aug. 1994
	21	Mooly Sagiv , Thomas Reps , Reinhard Wilhelm, Solving shape-analysis problems in languages with destructive updating, Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.16-31, January 21-24, 1996, St. Petersburg Beach, Florida, United States [doi>10.1145/237721.237725]
	22	Robert Sedgewick, Algorithms in C, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	23	J. H. Siekmann, Unification theory, Advances in Artificial Intelligence, Ii, Elsevier Science Publishers, pp. 365-400, 1987.

CITED BY 11

	Anders Møller , Michael I. Schwartzbach, The pointer assertion logic engine, ACM SIGPLAN Notices, v.36 n.5, p.221-231, May 2001
	Daniel Le Métayer, Program analysis for software engineering: new applications, new requirements, new tools, ACM Computing Surveys (CSUR), v.28 n.4es, Dec. 1996
	Viktor Kuncak , Patrick Lam , Martin Rinard, Role analysis, ACM SIGPLAN Notices, v.37 n.1, p.17-32, Jan. 2002
	Arne John Glenstrup , Neil D. Jones, Termination analysis and specialization-point insertion in offline partial evaluation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.27 n.6, p.1147-1215, November 2005
	Jakob L. Jensen , Michael E. Jørgensen , Michael I. Schwartzbach , Nils Klarlund, Automatic verification of pointer programs using monadic second-order logic, ACM SIGPLAN Notices, v.32 n.5, p.226-234, May 1997
	Jean-Louis Giavitto , Olivier Michel, Declarative definition of group indexed data structures and approximation of their domains, Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming, p.150-161, September 05-07, 2001, Florence, Italy
	Greta Yorsh , Thomas Reps , Mooly Sagiv , Reinhard Wilhelm, Logical characterizations of heap abstractions, ACM Transactions on Computational Logic (TOCL), v.8 n.1, p.5-es, January 2007
	Graham Hughes , Tevfik Bultan, Extended interface grammars for automated stub generation, Proceedings of the second workshop on Automated formal methods, p.41-50, November 06-06, 2007, Atlanta, Georgia
	Martin Strecker, Modeling and Verifying Graph Transformations in Proof Assistants, Electronic Notes in Theoretical Computer Science (ENTCS), v.203 n.1, p.135-148, March, 2008
	Edward E. Aftandilian , Samuel Z. Guyer, GC assertions: using the garbage collector to check heap properties, ACM SIGPLAN Notices, v.44 n.6, June 2009
	María Del Mar Gallardo , Pedro Merino , David Sanán, Model Checking Dynamic Memory Allocation in Operating Systems, Journal of Automated Reasoning, v.42 n.2-4, p.229-264, April 2009