Type-based amortized resource analysis with integers and arrays

DOI10.1017/S0956796815000192zbMath1420.68068MaRDI QIDQ5371954

Zhong Shao, Jan Hoffmann

Publication date: 23 October 2017

Published in: Journal of Functional Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items (3)

Type-based cost analysis for lazy functional languages ⋮ Inferring expected runtimes of probabilistic integer programs using expected sizes ⋮ Type-based analysis of logarithmic amortised complexity

Uses Software

• LPbook

Cites Work

• Cost analysis of object-oriented bytecode programs
• Closed-form upper bounds in static cost analysis
• Arrangements on chessboards
• Automatic Inference of Resource Consumption Bounds
• Static prediction of heap space usage for first-order functional programs
• A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis
• Amortized Resource Analysis with Polynomial Potential
• Static Analysis in Disjunctive Numerical Domains
• Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
• Type-Based Amortized Resource Analysis with Integers and Arrays
• SPEED
• Multivariate amortized resource analysis
• Programming Languages and Systems
• Linear programming. Foundations and extensions

This page was built for publication: Type-based amortized resource analysis with integers and arrays