Static prediction of heap space usage for first-order functional programs
From MaRDI portal
Recommendations
- Automatic Space Bound Analysis for Functional Programs with Garbage Collection
- A space consumption analysis by abstract interpretation
- Automatic amortised analysis of dynamic memory allocation for lazy functional programs
- Amortised Memory Analysis Using the Depth of Data Structures
- Efficient Type-Checking for Amortised Heap-Space Analysis
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 615137 (Why is no real title available?)
- scientific article; zbMATH DE number 1942450 (Why is no real title available?)
- scientific article; zbMATH DE number 1948151 (Why is no real title available?)
- scientific article; zbMATH DE number 1953123 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- Regular expression pattern matching for XML
- Types and programing languages
Cited in
(50)- Light types for polynomial time computation in lambda calculus
- Linear types and non-size-increasing polynomial time computation.
- A type-based complexity analysis of object oriented programs
- A type system for counting instances of software components
- Trends in trends in functional programming 1999/2000 versus 2007/2008
- Combining linear logic and size types for implicit complexity
- Types for complexity of parallel computation in pi-calculus
- Structural recursion as a query language on lists and ordered trees
- Type-based cost analysis for lazy functional languages
- Closed-form upper bounds in static cost analysis
- A resource semantics and abstract machine for \textit{Safe}: a functional language with regions and explicit deallocation
- Exception handling for copyless messaging
- A program logic for resources
- Static insertion of safe and effective memory reuse commands into ML-like programs
- A Coq library for internal verification of running-times
- Attribute-based signatures for circuits from bilinear map
- Recursion and dynamic data-structures in bounded space: towards embedded ML programming
- Machine-checked verification of the correctness and amortized complexity of an efficient union-find implementation
- Amortized complexity verified
- Calculating statically maximum log memory used by multi-threaded transactional programs
- Formal Certification of a Resource-Aware Language Implementation
- Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis
- An Inference Algorithm for Guaranteeing Safe Destruction
- Amortised Memory Analysis Using the Depth of Data Structures
- A Heterogeneous Pushout Approach to Term-Graph Transformation
- A Type System for Usage of Software Components
- Efficient Type-Checking for Amortised Heap-Space Analysis
- Analysis of functional programs to detect run-time garbage cells
- scientific article; zbMATH DE number 1948397 (Why is no real title available?)
- scientific article; zbMATH DE number 2090846 (Why is no real title available?)
- A transformational approach to resource analysis with typed-norms inference
- Combining linear logic and size types for implicit complexity
- Denotational semantics as a foundation for cost recurrence extraction for functional languages
- scientific article; zbMATH DE number 7204445 (Why is no real title available?)
- Tight typings and split bounds, fully developed
- Automatic Space Bound Analysis for Functional Programs with Garbage Collection
- Type-based amortized resource analysis with integers and arrays
- A type system with usage aspects
- A space consumption analysis by abstract interpretation
- Two decades of automatic amortized resource analysis
- Type-based analysis of logarithmic amortised complexity
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits
- Amortized complexity verified
- Amortized analysis via coalgebra
- Typable fragments of polynomial automatic amortized resource analysis
- Worst-case input generation for concurrent programs under non-monotone resource metrics
- A Bytecode Logic for JML and Types
- Cost analysis of object-oriented bytecode programs
- ATLAS: automated amortised complexity analysis of self-adjusting data structures
- Space-aware ambients and processes
This page was built for publication: Static prediction of heap space usage for first-order functional programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942925)
