Relating complexity and precision in control flow analysis
- 1 October 2007
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 42 (9), 85-96
- https://doi.org/10.1145/1291151.1291166
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- Declarative continuations: An investigation of duality in programming language semanticsPublished by Springer Science and Business Media LLC ,2005
- λμ-Calculus: An algorithmic interpretation of classical natural deductionPublished by Springer Science and Business Media LLC ,2005
- FUNCTIONAL PEARL Linear lambda calculus and PTIME-completenessJournal of Functional Programming, 2004
- Higher-order control-flow analysis in retrospectACM SIGPLAN Notices, 2004
- Modular control-flow analysis with rank 2 intersection typesMathematical Structures in Computer Science, 2003
- Undecidability of context-sensitive data-dependence analysisACM Transactions on Programming Languages and Systems, 2000
- Polymorphic splittingACM Transactions on Programming Languages and Systems, 1998
- A type system equivalent to flow analysisACM Transactions on Programming Languages and Systems, 1995
- Closure analysis in constraint formACM Transactions on Programming Languages and Systems, 1995
- The circuit value problem is log space complete for PACM SIGACT News, 1975