Amortised Memory Analysis Using the Depth of Data Structures

DOI10.1007/978-3-642-00590-9_14MaRDI QIDQ3617700zbMATH OpenOpenAlexFDO

Authors Brian A. Campbell

Publication date 31 March 2009

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00590-9_14

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Data structures (68P05) Searching and sorting (68P10)

Recommendations

• Programming Languages and Systems
• Automatic amortised analysis of dynamic memory allocation for lazy functional programs
• Amortized resource analysis with polynomial potential. A static inference of polynomial bounds for functional programs
• Static prediction of heap space usage for first-order functional programs
• Efficient Type-Checking for Amortised Heap-Space Analysis

Cited in

(4)

• Trends in trends in functional programming 1999/2000 versus 2007/2008
• Hierarchical shape abstraction for analysis of free list memory allocators
• Static prediction of heap space usage for first-order functional programs
• Two decades of automatic amortized resource analysis

This page was built for publication: Amortised Memory Analysis Using the Depth of Data Structures

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