On the power and limitation of strictness analysis based on abstract interpretation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

On the power and limitation of strictness analysis based on abstract interpretation

Full text

Pdf (1.12 MB)

Source

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

Orlando, Florida, United States

Pages: 37 - 48

Year of Publication: 1991

ISBN:0-89791-419-8

Authors

R. C. Sekar	Dept. of Computer Science, SUNY at Stony Brook, NY
Prateek Mishra	Dept. of Computer Science, SUNY at Stony Brook, NY
I. V. Ramakrishnan	Dept. of Computer Science, SUNY at Stony Brook, NY

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): 6, Downloads (12 Months): 20, Citation Count: 6

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/99583.99591 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.

	Aug84	Lennart Augustsson, A compiler for lazy ML, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.218-227, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802038]
	BHA85	G. L. Burn , C. L. Hankin , S. Abramsky, The theory of strictness analysis for higher order functions, on Programs as data objects, p.42-62, April 1986, Copenhagen, Denmark
	Cla85	Chris Clack , Simon L. Peyton Jones, Strictness analysis—a practical approach, Proc. of a conference on Functional programming languages and computer architecture, p.35-49, January 1985, Nancy, France
	Hall87	C. V. Hall , D. S. Wise, Compiling strictness into streams, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.132-143, January 21-23, 1987, Munich, West Germany [doi>10.1145/41625.41637]
	Hud86	Paul Hudak , Jonathan Young, Higher-order strictness analysis in untyped lambda calculus, Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.97-109, January 01, 1986, St. Petersburg Beach, Florida [doi>10.1145/512644.512653]
	Huet79	HURT, G. AND LEVY, J.J., Computations in Nonambiguous Linear Term Rewriting Systems, Tech. Rep. No. 359(1979), INRIA, Le Chesney, France.
	Hug85	John Hughes, Strictness detection in non-flat domains, on Programs as data objects, p.112-135, April 1986, Copenhagen, Denmark
	KrHud	Paul Hudak , David Kranz, A combinator-based compiler for a functional language, Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.122-132, January 15-18, 1984, Salt Lake City, Utah, United States [doi>10.1145/800017.800523]
	KuoMis89	Tsung-Min Kuo , Prateek Mishra, Strictness analysis: a new perspective based on type inference, Proceedings of the fourth international conference on Functional programming languages and computer architecture, p.260-272, September 11-13, 1989, Imperial College, London, United Kingdom [doi>10.1145/99370.99390]
	Lin86	Gary Lindstrom, Static evaluation of functional programs, ACM SIGPLAN Notices, v.21 n.7, p.196-206, July 1986
	Myc80	Alan Mycroft, The Theory and Practice of Transforming Call-by-need into Call-by-value, Proceedings of the Fourth 'Colloque International sur la Programmation' on International Symposium on Programming, p.269-281, April 22-24, 1980
	Sek90	R. C. Sekar , Shaunak Pawagi , I. V. Ramarkrishnan, Small domains spell fast strictness analysis, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.169-183, December 1989, San Francisco, California, United States [doi>10.1145/96709.96727]
	Wad	P. WADLER, Strictness Analysis on Non- Flat Domains (by Abstract Interpretation over Finite Domains), Abstract Interpretation of Declarative Languages, Ellis Hotwood, 1987 EDITED :BY ABRAMSKY AND HANKIN
	Wad87	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 6

	R. Sekar , I. V. Ramakrishnan, Fast strictness analysis based on demand propagation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.17 n.6, p.896-937, Nov. 1995
	Alan Mycroft, Completeness and predicate-based abstract interpretation, Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, p.179-185, June 14-16, 1993, Copenhagen, Denmark
	Marc Neuberger , Prateek Mishra, A precise relationship between the deductive power of forward and backward strictness analysis, ACM SIGPLAN Lisp Pointers, v.V n.1, p.127-138, Jan. 1992
	Sandip K. Biswas, A demand-driven set-based analysis, Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.372-385, January 15-17, 1997, Paris, France
	R. Sekar , I. V. Ramakrishnan , P. Mishra, On the power and limitations of strictness analysis, Journal of the ACM (JACM), v.44 n.3, p.505-525, May 1997
	Fausto Spoto, Optimality and condensing of information flow through linear refinement, Theoretical Computer Science, v.388 n.1-3, p.53-82, December, 2007