Static complexity analysis of higher order programs

DOI10.1007/978-3-642-15331-0_6MaRDI QIDQ5747632zbMATH OpenOpenAlexFDO

Authors Lars Kristiansen, James Emil Avery, Jean-Yves Moyen

Publication date 14 September 2010

Published in Foundational and Practical Aspects of Resource Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15331-0_6

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A flow calculus of \(mwp\)-bounds for complexity analysis
• Analysing the complexity of functional programs: higher-order meets first-order
• Higher-order interpretations and program complexity
• Higher-order interpretations and program complexity
• Static determination of quantitative resource usage for higher-order programs

Cited in

(6)

• Automated higher-order complexity analysis
• A flow calculus of \(mwp\)-bounds for complexity analysis
• Analysing the complexity of functional programs: higher-order meets first-order
• The Nuggetizer: Abstracting Away Higher-Orderness for Program Verification
• Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
• Tight polynomial worst-case bounds for loop programs

This page was built for publication: Static complexity analysis of higher order programs

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