Efficient Type-Checking for Amortised Heap-Space Analysis

DOI10.1007/978-3-642-04027-6_24zbMath1257.68051OpenAlexW94295739MaRDI QIDQ3644757

Martin Hofmann, Dulma Rodriguez

Publication date: 12 November 2009

Published in: Computer Science Logic (Search for Journal in Brave)

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

zbMATH Keywords

semanticstype systemsresource analysisOOP

Mathematics Subject Classification ID

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

Related Items (4)

\textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs ⋮ A type-based complexity analysis of object oriented programs ⋮ Unnamed Item ⋮ Two decades of automatic amortized resource analysis

Uses Software

• COSTA
• SPEED
• Featherweight Java

Cites Work

• Unnamed Item
• Recursion and dynamic data-structures in bounded space
• Static prediction of heap space usage for first-order functional programs
• Amortized Computational Complexity
• Purely Functional Data Structures
• SPEED
• Static Analysis
• Programming Languages and Systems

This page was built for publication: Efficient Type-Checking for Amortised Heap-Space Analysis