Automatic inference of resource consumption bounds

DOI10.1007/978-3-642-28717-6_1MaRDI QIDQ2891436zbMATH OpenOpenAlexFDO

Authors Elvira Albert, Puri Arenas, Samir Genaim, 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)

Recommendations

• On the inference of resource usage upper and lower bounds
• Towards automatic resource bound analysis for OCaml
• Automatic Static Cost Analysis for Parallel Programs
• Static determination of quantitative resource usage for higher-order programs
• Automated resource analysis with Coq proof objects

Cited in

(11)

• Inferring energy bounds via static program analysis and evolutionary modeling of basic blocks
• Rely-guarantee bound analysis of parameterized concurrent shared-memory programs. With an application to proving that non-blocking algorithms are bounded lock-free
• Automated resource analysis with Coq proof objects
• Preface: Special issue on automatic resource bound analysis
• On the inference of resource usage upper and lower bounds
• Interval-based resource usage verification: formalization and prototype
• Interval-based resource usage verification by translation into Horn clauses and an application to energy consumption
• A transformational approach to resource analysis with typed-norms inference
• Injecting abstract interpretations into linear cost models
• Type-based amortized resource analysis with integers and arrays
• Theoretical Aspects of Computing – ICTAC 2005

Describes a project that uses

Uses Software

• COSTA
• COSTABS
• SPEED

This page was built for publication: Automatic inference of resource consumption bounds

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