Relating complexity and precision in control flow analysis

DOI10.1145/1291151.1291166MaRDI QIDQ5168927zbMATH OpenOpenAlexFDO

Authors David van Horn, Harry G. Mairson

Publication date 21 July 2014

Published in Proceedings of the 12th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1291151.1291166

zbMATH Keywords

complexitycontinuationcontrol flow analysiseta expansiongeometry of interactionlinear logicnormalizationproofnetstatic analysis

Mathematics Subject Classification ID

Proof-theoretic aspects of linear logic and other substructural logics (03F52) Functional programming and lambda calculus (68N18) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Deciding kCFA is complete for EXPTIME
• Flow Analysis, Linearity, and PTIME
• scientific article; zbMATH DE number 1692944
• CFA2: A Context-Free Approach to Control-Flow Analysis
• CFA2: a context-free approach to control-flow analysis

Cited in

(7)

• Logical approximation for program analysis
• scientific article; zbMATH DE number 1692944 (Why is no real title available?)
• Flow Analysis, Linearity, and PTIME
• scientific article; zbMATH DE number 1953276 (Why is no real title available?)
• Strong typed Böhm theorem and functional completeness on the linear lambda calculus
• Deciding kCFA is complete for EXPTIME
• Aspects of availability. Enforcing timed properties to prevent denial of service

This page was built for publication: Relating complexity and precision in control flow analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5168927)