Selectively-amortized resource bounding

DOI10.1007/978-3-030-88806-0_14zbMath1497.68117arXiv2108.08263OpenAlexW3209554355MaRDI QIDQ2145338

Tianhan Lu, Ashutosh Trivedi, Bor-Yuh Evan Chang

Publication date: 17 June 2022

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

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• z3

Cites Work

• Unnamed Item
• Completing the temporal picture
• Automated resource analysis with Coq proof objects
• Type-directed bounding of collections in reactive programs
• A fistful of dollars: formalizing asymptotic complexity claims via deductive program verification
• Complexity and resource bound analysis of imperative programs using difference constraints
• More Precise Yet Widely Applicable Cost Analysis
• Program Slicing
• Amortised Resource Analysis with Separation Logic
• Amortized Computational Complexity
• Polynomial Invariants for Affine Programs
• SPEED
• Synthesis of Circular Compositional Program Proofs via Abduction
• Towards automatic resource bound analysis for OCaml
• Multivariate amortized resource analysis
• Computer Aided Verification

This page was built for publication: Selectively-amortized resource bounding