Automatic Inference of Resource Consumption Bounds

DOI10.1007/978-3-642-28717-6_1zbMath1352.68048OpenAlexW2101953483MaRDI QIDQ2891436

Elvira Albert, Samir Genaim, Puri Arenas, Miguel Gómez-Zamalloa, Germán Puebla

Publication date: 15 June 2012

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28717-6_1

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Related Items (2)

Type-based amortized resource analysis with integers and arrays ⋮ Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free

Uses Software

• COSTA
• SPEED
• COSTABS

This page was built for publication: Automatic Inference of Resource Consumption Bounds