Trace-based program analysis

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Trace-based program analysis

Full text

Pdf (1.50 MB)

Source

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

St. Petersburg Beach, Florida, United States

Pages: 195 - 207

Year of Publication: 1996

ISBN:0-89791-769-3

Authors

Christopher Colby	School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania
Peter Lee	School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 36, Citation Count: 4

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/237721.237776 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	Alfred V. Aho , Ravi Sethi , Jeffrey D. Ullman, Compilers: principles, techniques, and tools, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1986
	2	Alexander Aiken , Alexandru Nicolau, Perfect Pipelining: A New Loop Parallelization Technique, Proceedings of the 2nd European Symposium on Programming, p.221-235, March 21-24, 1988
	3	David R. Chase , Mark Wegman , F. Kenneth Zadeck, Analysis of pointers and structures, Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation, p.296-310, June 1990, White Plains, New York, United States
	4	Christopher Colby. Analysis of synchromzation and aliasing with #b#tract interpretation. Unpublished.
	5	Christopher Colby, Analyzing the communication topology of concurrent programs, Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.202-213, June 21-23, 1995, La Jolla, California, United States [doi>10.1145/215465.215592]
	6	Christopher Colby, Determining Storage Properties of Sequential and Concurrent Programs with Assignment and Structured Data, Proceedings of the Second International Symposium on Static Analysis, p.64-81, September 25-27, 1995
	7	Charles Consel, Polyvariant binding-time analysis for applicative languages, Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.66-77, June 14-16, 1993, Copenhagen, Denmark [doi>10.1145/154630.154638]
	8	Patrick Cousot , Radhia Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.238-252, January 17-19, 1977, Los Angeles, California [doi>10.1145/512950.512973]
	9	Patrick Cousot , Radhia Cousot, Systematic design of program analysis frameworks, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.269-282, January 29-31, 1979, San Antonio, Texas [doi>10.1145/567752.567778]
	10	Patrick Cousot , Radhia Cousot, Inductive definitions, semantics and abstract interpretations, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.83-94, January 19-22, 1992, Albuquerque, New Mexico, United States [doi>10.1145/143165.143184]
	11	P. Cousot and R. Cousot. Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages), in Proceedings of 199# IEEE International Con}erence on Computer Languages (ICCL '9#), Toulouse, France, pages 95-112, May 1994.
	12	Patrick Cousot , Radhia Cousot, Formal language, grammar and set-constraint-based program analysis by abstract interpretation, Proceedings of the seventh international conference on Functional programming languages and computer architecture, p.170-181, June 26-28, 1995, La Jolla, California, United States [doi>10.1145/224164.224199]
	13	Alain Deutsch. Operational Models of Programming Languages and Representations of Relations on Regular Languages with Apphcatzon to the Static Determination of Dynamic Abasing Properties of Data. PhD thesis, LIX, Ecole Polytechnique, Palaiseau, France, 1992.
	14	Alain Deutsch. A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relations. In Procee&ngs of the IEEE 1992 International Conference on Computer Languages, San Pransisco, California, pages 2-13, April 1992.
	15	M. Felleisen and D.P. Friedman. Control operators, the seed-machine, and the lambda-calculus. In 3rd Working Conference on the Formal Descriptzon of Programming Concepts, August 1986.
	16	Philippe Granger, Static analysis of linear congruence equalities among variables of a program, Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1, p.169-192, April 1991, Brighton, United Kingdom
	17	Williams LudweI1 Harrison. The interprocedural analysis and automatic parallelisatlon of scheme programs. Lisp and Symbolic Computation, 2(3):176-396, October 1989.
	18	Paul Hudak , Jonathan Young, Collecting interpretations of expressions, ACM Transactions on Programming Languages and Systems (TOPLAS), v.13 n.2, p.269-290, April 1991 [doi>10.1145/103135.103139]
	19	Suresh Jagannathan , Stephen Weeks, A unified treatment of flow analysis in higher-order languages, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.393-407, January 23-25, 1995, San Francisco, California, United States [doi>10.1145/199448.199536]
	20	Neil D. Jones , Steven S. Muchnick, Flow analysis and optimization of LISP-like structures, Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.244-256, January 29-31, 1979, San Antonio, Texas [doi>10.1145/567752.567776]
	21	M. Karr. Affine relationships among variables of a program. Acta Informatica, 6.133-151, 1976.
	22	M. Lam, Software pipelining: an effective scheduling technique for VLIW machines, Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation, p.318-328, June 20-24, 1988, Atlanta, Georgia, United States
	23	Torben Æ. Mogensen, Binding Time Analysis for Polymorphically Typed Higher Order Languages, Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages, p.298-312, March 13-17, 1989
	24	Alan Mycroft. Abstract Interpretation and Optzm#sing Transformations for Apphcatzve Programs. PhD thesis, Department of Computer Science, University of Edinburgh, Scotland, 1981.
	25	Flemming Nielson, Strictness analysis and denotational abstract interpretation, Information and Computation, v.76 n.1, p.29-92, January 1988 [doi>10.1016/0890-5401(88)90041-7]
	26	Gordon Plotkin. A structural approach to operational semantics. Technical Report DAIMI-FN-19, Computer Science Department, Aarhus University, 1981.
	27	Olin Grigsby Shivers, Control-flow analysis of higher-order languages of taming lambda, Carnegie Mellon University, Pittsburgh, PA, 1991
	28	Joseph E. Stoy, Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, MIT Press, Cambridge, MA, 1977
	29	Philip Wadler , R. J. M. Hughes, Projections for strictness analysis, Proc. of a conference on Functional programming languages and computer architecture, p.385-407, October 1987, Portland, Oregon, United States

CITED BY 4

	Mihnea Marinescu , Benjamin Goldberg, Partial-evaluation techniques for concurrent programs, ACM SIGPLAN Notices, v.32 n.12, p.47-62, Dec. 1997
	Fausto Spoto , Thomas Jensen, Class analyses as abstract interpretations of trace semantics, ACM Transactions on Programming Languages and Systems (TOPLAS), v.25 n.5, p.578-630, September 2003
	Xavier Rival, Symbolic transfer function-based approaches to certified compilation, ACM SIGPLAN Notices, v.39 n.1, p.1-13, January 2004
	Yanhong A. Liu , Tom Rothamel , Fuxiang Yu , Scott D. Stoller , Nanjun Hu, Parametric regular path queries, ACM SIGPLAN Notices, v.39 n.6, May 2004