Synthesis with asymptotic resource bounds

DOI10.1007/978-3-030-81685-8_37zbMath1493.68112arXiv2103.04188OpenAlexW3186139944MaRDI QIDQ832230

Qinheping Hu, John Cyphert, Loris D'Antoni, Thomas W. Reps

Publication date: 25 March 2022

Full work available at URL: https://arxiv.org/abs/2103.04188

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Programmable program synthesis

Uses Software

• TiML

Cites Work

• Unnamed Item
• Unnamed Item
• The concrete tetrahedron. Symbolic sums, recurrence equations, generating functions, asymptotic estimates
• On the solution of linear recurrence equations
• Exponential automatic amortized resource analysis
• A fistful of dollars: formalizing asymptotic complexity claims via deductive program verification
• Proving divide and conquer complexities in Isabelle/HOL
• Closed-form upper bounds in static cost analysis
• Mechanical program analysis
• Multivariate amortized resource analysis
• Syntax-guided synthesis with quantitative syntactic objectives

This page was built for publication: Synthesis with asymptotic resource bounds