Deciding kCFA is complete for EXPTIME

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2008, Pages 275-282

  Van Horn, David ^a   Mairson, Harry G ^a  

^a BRANDEIS UNIVERSITY   (United States)

Author keywords

Complexity; Flow analysis

Indexed keywords

ABSTRACT INTERPRETATIONS; COMPLEXITY; CONTROL FLOW ANALYSIS; DECISION PROBLEMS; EXPONENTIAL TIME; FLOW ANALYSIS;

COMPUTER PROGRAMMING; FUNCTIONAL PROGRAMMING; PROGRAM INTERPRETERS; PROGRAMMING THEORY; PULSATILE FLOW;

COMPUTATIONAL COMPLEXITY;

EID: 59249099145     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1411204.1411243     Document Type: Conference Paper

References (24)

1. G. L. Burn, C. L. Hankin, and S. Abramsky. The theory of strictness analysis for higher order functions. In H. Ganzinger and N. Jones, editors, Programs as data objects, pages 42-62, New York, NY, USA, 1985. Springer-Verlag. ISBN 0-387-16446-4.
2. Haim Gaifman, Harry Mairson, Yehoshua Sagiv, and Moshe Y. Vardi. Undecidable optimization problems for database logic programs. J. ACM, 40(3):683-713, 1993. ISSN 0004-5411. doi: http://doi.acm.org/10.1145/174130. 174142.
3. Fritz Henglein. Simple closure analysis. DIKU Semantics Report D-193, March 1992.
4. Gerd G. Hillebrand, Paris C. Kanellakis, Harry G. Mairson, and Moshe Y. Vardi. Undecidable boundedness problems for datalog programs. J. Logic Program., 25(2): 163-190, 1995.
5. Suresh Jagannathan, Peter Thiemann, Stephen Weeks, and Andrew Wright. Single and loving it: must-alias analysis for higher-order languages. In POPL '98: Proceedings of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 329-341, New York, NY, USA, 1998. ACM. ISBN 0-89791-979-3. doi: http://doi.acm.org/10.1145/268946.268973.
6. Neil D. Jones. Flow analysis of lambda expressions (preliminary version). In Proceedings of the 8th Colloquium on Automata, Languages and Programming, pages 114-128, London, UK, 198.1. Springer-Verlag. ISBN 3-540-10843-2.
7. Richard E. Ladner. The circuit value problem is log space complete for P. SIGACT News, 7(1):18-20, 1975. ISSN 0163-5700. doi:http://doi.acm.org/ 10.1145/990518.990519.
8. Jean-Jacques Lévy. Réductions correctes et optimales dans le lambdacalcul. PhD thesis, Paris 7, January 1978. Thèse d'Etat.
9. Harry G. Mairson. Linear lambda calculus and PTTME-completeness. J. Funct. Program., 14(6):623-633, 2004. ISSN 0956-7968. doi:http://dx.doi.org/ 10.10.17/S0956796804005131.
10. Harry G. Mairson. Deciding ML typability is complete for deterministic exponential time. In POPL '90: Proceedings of the 17th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 382-01, New York, NY, USA, 1990. ACM.. ISBN 0-89791-343-4. doi: http://doi.acm.org/10.1145/96709. 96748.
11. Jan Midtgaard. Control-flow analysis of functional programs. Technical Report. BRICS RS-07-18, DAIMI, Department of Computer Science, University of Aarhus, Aarhus, Denmark, December 2007.
12. Matthew Might. Environment analysis of higher-order languages. PhD thesis, Georgia Institute of Technology, Atlanta, GA, USA, 2007. AdviserOlin G. Shivers.
13. Matthew Might and Olin Shivers. Improving flow analyses via TCFA: abstract garbage collection and counting. In ICFP 06: Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming, pages 13-25, New York, NY, USA, 2006. ACM. ISBN 1-59593-309-3. doi: http://doi.acm.org/10.1145/1159803.1159807.
14. Christian Mossin. Exact flow analysis. In SAS '97: Proceedings of the 4th International Symposium on Static Analysis, pages 250-264, London., UK, 1997. Springer-Verlag. ISBN 3-540-63468-1.
15. Peter Møller Neergaard and Harry G. Mairson. Types, potency, and idempotency: why nonlinearity and amnesia make a type system work. In ICFP '04: Proceedings of the ninth ACM SIGPLAN International Conference on Functional Programming, pages 138-149, New York, NY, USA, 2004. ACM. Press. ISBN 1-58113-905-5. doi: http://doi.acm.org/10.1145/1016850.1016871.
16. Flemming Nielson and Hanne Riis Nielson. Inflnitary control flow analysis: a collecting semantics for closure analysis. In POPL "97: Proceedings of the 24th ACM SIGPLAN-SIGACT Symposium, on Principles of Programming Languages, pages 332-345, New York, NY, USA, 1997. ACM. ISBN 0-89791-853-3. doi: http://dcd.acm.org/10.l 145/263699.263745.
17. Flemming Nielson, Hanne R. Nielson, and Chris Hankin. Principles of Program Analysis. Springer-Verlag New York, Inc., Secaucus, NJ, USA, 1999. ISBN 3540654100.
18. Peter Sestoft. Replacing function parameters by global variables. Master's thesis, DIKU, University of Copenhagen, Denmark, October 1988. Master's thesis no. 254.
19. Olin Shivers. Control flow analysis in Scheme. In PLDI '88: Proceedings of the ACM SIGPLAN 1988 Conference on Programming Language Design and Implementation, pages 164-174, New York, NY, USA, 1988. ACM. ISBN 0-89791-269-1. doi: http://doi.acm.org/10.1145/53990.54007.
20. Olin Shivers. Control-flow Analysis of Higher-order Languages. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, USA, 1991.
21. Olin Shivers. Higher-order control-flow analysis in retrospect: lessons learned, lessons abandoned. SIGPLANNot, 39(4):257-269,2004. ISSN 0362-1340. doi: http://doi.acm.org/10.1145/989393.989421.
22. David Van Horn, and Harry G. Mairson. Relating complexity and precision in control flow analysis. In ICFP '07: Proceedings of the 2007 ACM SIGPLAN International Conference on Functional. Programming, pages 85-96, New York, NY, USA, 2007. ACM. Press. ISBN 978-1-59593-815-2. doi : http://doi.acm.org/10. 1145/1291151.1291166.
23. David Van Horn and Harry G. Mairson. Linearity, flow analysis, and PTIME. In Maria Alpuente and Germán Vidal, editors, The 15th International Static Analysis Symposium, SAS 2008, volume 5079 of Lecture Notes in Computer Science, pages 255-269. Springer, July 2008.
24. Andrew K. Wright and Suresh Jagannathan. Polymorphic splitting: an effective polyvariant flow analysis. ACM Trans. Program. Lang. Syst., 20(1): 166-207, 1998. ISSN 0164-0925. doi: http://doi.acm.org/10.1145/271510. 271523.