"Carbon Credits" for Resource-Bounded Computations Using Amortised Analysis

Authors:
Steffen Jost;Hans-Wolfgang Loidl;Kevin Hammond;Norman Scaife;Martin Hofmann
Affiliations:
St Andrews University, St Andrews, Scotland, UK;Ludwig-Maximilians University, Munich, Germany;St Andrews University, St Andrews, Scotland, UK;Université Blaise-Pascal, Clermont-Ferrand, France;Ludwig-Maximilians University, Munich, Germany
Venue:
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Year:
2009

Citing 16
Cited 9

Proving the correctness of reactive systems using sized types

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Purely functional data structures

Purely functional data structures
Resource bound certification

Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Cache behavior prediction by abstract interpretation

Science of Computer Programming
Calculating Sized Types

Higher-Order and Symbolic Computation
Static prediction of heap space usage for first-order functional programs

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A type system for bounded space and functional in-place update

Nordic Journal of Computing
Hume: a domain-specific language for real-time embedded systems

Proceedings of the 2nd international conference on Generative programming and component engineering
Real-Time Digital Signal Processing: Implementations and Applications

Real-Time Digital Signal Processing: Implementations and Applications
Parametric prediction of heap memory requirements

Proceedings of the 7th international symposium on Memory management
Analysing memory resource bounds for low-level programs

Proceedings of the 7th international symposium on Memory management
Amortised Memory Analysis Using the Depth of Data Structures

ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Live heap space analysis for languages with garbage collection

Proceedings of the 2009 international symposium on Memory management
Polynomial size analysis of first-order functions

TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Inferring cost equations for recursive, polymorphic and higher-order functional programs

IFL'03 Proceedings of the 15th international conference on Implementation of Functional Languages
Type-Based amortised heap-space analysis

ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems

Improvements to a resource analysis for hume

FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Characterising effective resource analyses for parallel and distributed coordination

FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Multivariate amortized resource analysis

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ABC: algebraic bound computation for loops

LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Amortized resource analysis with polymorphic recursion and partial big-step operational semantics

APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Amortized resource analysis with polynomial potential: a static inference of polynomial bounds for functional programs

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Multivariate amortized resource analysis

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automatic amortised analysis of dynamic memory allocation for lazy functional programs

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
A runtime approach for estimating resource usage

Proceedings of the Fourth Symposium on Information and Communication Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bounding resource usage is important for a number of areas, notably real-time embedded systems and safety-critical systems. In this paper, we present a fully automatic static type-based analysis for inferring upper bounds on resource usage for programs involving general algebraic datatypes and full recursion. Our method can easily be used to bound any countable resource, without needing to revisit proofs. We apply the analysis to the important metrics of worst-case execution time, stack- and heap-space usage. Our results from several realistic embedded control applications demonstrate good matches between our inferred bounds and measured worst-case costs for heap and stack usage. For time usage we infer good bounds for one application. Where we obtain less tight bounds, this is due to the use of software floating-point libraries.