Infinitary control flow analysis

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Infinitary control flow analysis: a collecting semantics for closure analysis

Full text

Pdf (972 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: 332 - 345

Year of Publication: 1997

ISBN:0-89791-853-3

Authors

Flemming Nielson	Department of Computer Science, University of Aarhus, Denmark
Hanne Riis Nielson

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): 10, Downloads (12 Months): 45, Citation Count: 32

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.263745 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	Alexander Aiken , Edward L. Wimmers , T. K. Lakshman, Soft typing with conditional types, Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.163-173, January 16-19, 1994, Portland, Oregon, United States [doi>10.1145/174675.177847]
	2	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]
	3	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]
	4	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]
	5	Alain Deutsch, Interprocedural may-alias analysis for pointers: beyond k-limiting, Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, p.230-241, June 20-24, 1994, Orlando, Florida, United States
	6	Karl-Filip Faxén, Optimizing Lazy Functional Programs Using Flow Inference, Proceedings of the Second International Symposium on Static Analysis, p.136-153, September 25-27, 1995
	7	M. Felleisen and D. P. Friedman. Control operators, the SECD-machine, and the A-calculus. In Formal Description of Programming Concepts 111. North-Holland, 1986.
	8	Cormac Flanagan , Matthias Felleisen, The semantics of future and its use in program optimization, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.209-220, January 23-25, 1995, San Francisco, California, United States [doi>10.1145/199448.199484]
	9	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
	10	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]
	11	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
	12	Neil D. Jones , Flemming Nielson, Abstract interpretation: a semantics-based tool for program analysis, Handbook of logic in computer science (vol. 4): semantic modelling, Oxford University Press, Oxford, 1995
	13	Jens Palsberg, Closure analysis in constraint form, ACM Transactions on Programming Languages and Systems (TOPLAS), v.17 n.1, p.47-62, Jan. 1995 [doi>10.1145/200994.201001]
	14	G. D. Plotkin. A structural approach to operational semantics. Technical Report FN-19, DAIMI, Aarhus University, Denmark, 1981.
	15	P. Sestoft. Analysis and e.Oicient implementation of functional programs. Ph.D.-thesis, Department of Computer Science, University of Copenhagen, Denmark, 1991.
	16	O. Shivers, Control flow analysis in scheme, Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation, p.164-174, June 20-24, 1988, Atlanta, Georgia, United States
	17	Olin Shivers, The semantics of Scheme control-flow analysis, ACM SIGPLAN Notices, v.26 n.9, p.190-198, Sept. 1991
	18	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]

CITED BY 32

	Frank Tip , Jens Palsberg, Scalable propagation-based call graph construction algorithms, ACM SIGPLAN Notices, v.35 n.10, p.281-293, Oct. 2000
	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
	Anindya Banerjee, A modular, polyvariant and type-based closure analysis, ACM SIGPLAN Notices, v.32 n.8, p.1-10, Aug. 1997
	Lunjin Lu, Path dependent analysis of logic programs, ACM SIGPLAN Notices, v.37 n.3, p.63-74, March 2002
	David A. Schmidt, Data flow analysis is model checking of abstract interpretations, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.38-48, January 19-21, 1998, San Diego, California, United States
	Manuel Fähndrich , Jakob Rehof , Manuvir Das, Scalable context-sensitive flow analysis using instantiation constraints, ACM SIGPLAN Notices, v.35 n.5, p.253-263, May 2000
	Jens Palsberg , Christina Pavlopoulou, From polyvariant flow information to intersection and union types, Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.197-208, January 19-21, 1998, San Diego, California, United States
	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
	Matthias Neubauer , Michael Sperber, Down with Emacs Lisp: dynamic scope analysis, ACM SIGPLAN Notices, v.36 n.10, October 2001
	Daniel Damian , Olivier Danvy, Syntactic accidents in program analysis: on the impact of the CPS transformation, ACM SIGPLAN Notices, v.35 n.9, p.209-220, Sept. 2000
	David Grove , Greg DeFouw , Jeffrey Dean , Craig Chambers, Call graph construction in object-oriented languages, ACM SIGPLAN Notices, v.32 n.10, p.108-124, Oct. 1997
	Oukseh Lee , Kwangkeun Yi , Yunheung Paek, A proof method for the corectness of modularized OCFA, Information Processing Letters, v.81 n.4, p.179-185, 28 February 2002
	Chris Hankin , Rajagopal Nagarajan , Prahladavaradan Sampath, Flow analysis: games and nets, The essence of computation: complexity, analysis, transformation, Springer-Verlag New York, Inc., New York, NY, 2002
	Lunjin Lu, Path Dependent Analysis of Logic Programs, Higher-Order and Symbolic Computation, v.16 n.4, p.341-377, December 2003
	Mitchell Wand , Igor Siveroni, Constraint systems for useless variable elimination, Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.291-302, January 20-22, 1999, San Antonio, Texas, United States
	Flemming Nielson, Perspectives on program analysis, ACM Computing Surveys (CSUR), v.28 n.4es, Dec. 1996
	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
	Paolo Di Blasio , Kathleen Fisher , Carolyn Talcott, A Control-Flow Analysis for a Calculus of Concurrent Objects, IEEE Transactions on Software Engineering, v.26 n.7, p.617-634, July 2000
	Hanne Riis Nielson , Flemming Nielson, Flow logic: a multi-paradigmatic approach to static analysis, The essence of computation: complexity, analysis, transformation, Springer-Verlag New York, Inc., New York, NY, 2002
	Christian Fecht , Helmut Seidl, Propagating differences: an efficient new fixpoint algorithm for distributive constraint systems, Nordic Journal of Computing, v.5 n.4, p.304-329, Winter 1998
	Thomas Reps, Undecidability of context-sensitive data-independence analysis, ACM Transactions on Programming Languages and Systems (TOPLAS), v.22 n.1, p.162-186, Jan. 2000
	Allyn Dimock , Ian Westmacott , Robert Muller , Franklyn Turbak , J. B. Wells, Functioning without closure: type-safe customized function representations for standard ML, ACM SIGPLAN Notices, v.36 n.10, October 2001
	Anindya Banerjee , Thomas Jensen, Modular control-flow analysis with rank 2 intersection types, Mathematical Structures in Computer Science, v.13 n.1, p.87-124, February 2003
	Christian Mossin, Exact flow analysis, Mathematical Structures in Computer Science, v.13 n.1, p.125-156, February 2003
	David A. Schmidt, Trace-Based Abstract Interpretation of Operational Semantics, Lisp and Symbolic Computation, v.10 n.3, p.237-271, May 1998
	Jens Palsberg , Christina Pavlopoulou, From Polyvariant flow information to intersection and union types, Journal of Functional Programming, v.11 n.3, p.263-317, May 2001
	J. B. Wells , Allyn Dimock , Robert Muller , Franklyn Turbak, A calculus with polymorphic and polyvariant flow types, Journal of Functional Programming, v.12 n.3, p.183-227, May 2002
	Daniel Damian , Olivier Danvy, Syntactic accidents in program analysis: on the impact of the CPS transformation, Journal of Functional Programming, v.13 n.5, p.867-904, September 2003
	David Van Horn , Harry G. Mairson, Relating complexity and precision in control flow analysis, ACM SIGPLAN Notices, v.42 n.9, September 2007
	David Van Horn , Harry G. Mairson, Deciding kCFA is complete for EXPTIME, ACM SIGPLAN Notices, v.43 n.9, September 2008
	Arjun Guha , Shriram Krishnamurthi , Trevor Jim, Using static analysis for Ajax intrusion detection, Proceedings of the 18th international conference on World wide web, April 20-24, 2009, Madrid, Spain