A practical and flexible flow analysis for higher-order languages

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

A practical and flexible flow analysis for higher-order languages

Full text

Pdf (1.11 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: 184 - 194

Year of Publication: 1996

ISBN:0-89791-769-3

Author

J. Michael Ashley

Snow Hall 415, Lawrence, KS, 66045 and Computer Science Department, Indiana University, Bloomington, Indiana

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): 5, Downloads (12 Months): 16, Citation Count: 9

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.237773 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	J. Michael Ashley , R. Kent Dybvig, An efficient implementation of multiple return values in Scheme, Proceedings of the 1994 ACM conference on LISP and functional programming, p.140-149, June 27-29, 1994, Orlando, Florida, United States
	2	Anders Bondorf. Similiz Manual, System Version 5.0. DIKU, University of Copenhagen, Denmark, 1993.
	3	Bhaskar Bose. DDD--A transformation system for Digital Design Derivation. Technical Report 331, Indiana University, Computer Science Department, May 1991.
	4	Francois Bourdoncle. Abstract interpretation by dynamic partitioning. Journal of Functional Programming, 2 (4): 407-436, October 1992.
	5	François Bourdoncle, Semantic Analysis of Interval Congruences, Proceedings of the International Conference on Formal Methods in Programming and Their Applications, p.128-141, June 28-July 02, 1993
	6	Robert G. Burger. The Scheme machine. Technical Report 413, Indiana University, Computer Science Department, August 1994.
	7	Cadence Research Systems, Bloomington, Indiana. Chez Scheme System Manual, Rev. 2.#, july 1994.
	8	H. Abelson , R. K. Dybvig , C. T. Haynes , G. J. Rozas , N. I. Adams, IV , D. P. Friedman , E. Kohlbecker , G. L. Steele, Jr. , D. H. Bartley , R. Halstead , D. Oxley , G. J. Sussman , G. Brooks , C. Hanson , K. M. Pitman , M. Wand , William Clinger , Jonathan Rees, Revised report on the algorithmic language scheme, ACM SIGPLAN Lisp Pointers, v.IV n.3, p.1-55, July, 1991 [doi>10.1145/382130.382133]
	9	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]
	10	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]
	11	R. Kent Dybvig , R. Hieb, A new approach to procedures with variable arity, Lisp and Symbolic Computation, v.3 n.3, p.229-244, Sep. 1990 [doi>10.1007/BF01806099]
	12	Cormac Flanagan , Amr Sabry , Bruce F. Duba , Matthias Felleisen, The essence of compiling with continuations, Proceedings of the ACM SIGPLAN 1993 conference on Programming language design and implementation, p.237-247, June 21-25, 1993, Albuquerque, New Mexico, United States
	13	W. L. Harrison III. The interprocedural analysis and automatic parallelization of Scheme programs. Lisp and Symbohc Computation, 2(3/4):179-396, 1989.
	14	Nevin Heintze, Set-based analysis of ML programs, Proceedings of the 1994 ACM conference on LISP and functional programming, p.306-317, June 27-29, 1994, Orlando, Florida, United States
	15	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]
	16	Suresh Jagannathan , Andrew K. Wright, Effective Flow Analysis for Avoiding Run-Time Checks, Proceedings of the Second International Symposium on Static Analysis, p.207-224, September 25-27, 1995
	17	Peter Lee, Topics in advanced language implementation, MIT Press, Cambridge, MA, 1991
	18	Zhong Shao , Andrew W. Appel, Space-efficient closure representations, Proceedings of the 1994 ACM conference on LISP and functional programming, p.150-161, June 27-29, 1994, Orlando, Florida, United States
	19	Olin Grigsby Shivers, Control-flow analysis of higher-order languages of taming lambda, Carnegie Mellon University, Pittsburgh, PA, 1991
	20	Olin Shivers, The semantics of Scheme control-flow analysis, Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.190-198, June 17-19, 1991, New Haven, Connecticut, United States
	21	Mitchell Wand , Dino P. Oliva, Proving the correctness of storage representations, Proceedings of the 1992 ACM conference on LISP and functional programming, p.151-160, June 22-24, 1992, San Francisco, California, United States
	22	Mitchell Wand , Paul Steckler, Selective and lightweight closure conversion, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.435-445, January 16-19, 1994, Portland, Oregon, United States [doi>10.1145/174675.178044]
	23	Andrew K. Wright , Robert Cartwright, A practical soft type system for Scheme, Proceedings of the 1994 ACM conference on LISP and functional programming, p.250-262, June 27-29, 1994, Orlando, Florida, United States
	24	Kwangkeun Yi , Williams Ludwell Harrison, III, Automatic generation and management of interprocedural program analyses, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.246-259, March 1993, Charleston, South Carolina, United States [doi>10.1145/158511.158642]

CITED BY 9

	Jens Palsberg, Equality-based flow analysis versus recursive types, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.6, p.1251-1264, Nov. 1998
	Kirsten L. Solberg Gasser , Flemming Nielson , Hanne Riis Nielson, Systematic realisation of control flow analyses for CML, ACM SIGPLAN Notices, v.32 n.8, p.38-51, Aug. 1997
	Frank Tip , Jens Palsberg, Scalable propagation-based call graph construction algorithms, ACM SIGPLAN Notices, v.35 n.10, p.281-293, Oct. 2000
	Oscar Waddell , J. Michael Ashley, Visualizing the performance of higher-order programs, ACM SIGPLAN Notices, v.33 n.7, p.75-82, July 1998
	J. Palsberg, Compiler technology for object-oriented languages, ACM Computing Surveys (CSUR), v.28 n.4es, Dec. 1996
	J. Michael Ashley, The effectiveness of flow analysis for inlining, ACM SIGPLAN Notices, v.32 n.8, p.99-111, Aug. 1997
	Andrew K. Wright , Suresh Jagannathan, Polymorphic splitting: an effective polyvariant flow analysis, ACM Transactions on Programming Languages and Systems (TOPLAS), v.20 n.1, p.166-207, Jan. 1998
	Greg DeFouw , David Grove , Craig Chambers, Fast interprocedural class analysis, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.222-236, January 19-21, 1998, San Diego, California, United States
	David Grove , Craig Chambers, A framework for call graph construction algorithms, ACM Transactions on Programming Languages and Systems (TOPLAS), v.23 n.6, p.685-746, November 2001