Amortized Resource Analysis with Polynomial Potential
From MaRDI portal
Publication:3558228
DOI10.1007/978-3-642-11957-6_16zbMath1260.68074OpenAlexW1230660382MaRDI QIDQ3558228
Publication date: 4 May 2010
Published in: Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11957-6_16
Functional programming and lambda calculus (68N18) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation, Denotational semantics as a foundation for cost recurrence extraction for functional languages, Resource-usage-aware configuration in software product lines, Tight typings and split bounds, fully developed, A resource semantics and abstract machine for \textit{Safe}: a functional language with regions and explicit deallocation, Type-based amortized resource analysis with integers and arrays, Types for complexity of parallel computation in pi-calculus, Run-time complexity bounds using squeezers, Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits, Combining linear logic and size types for implicit complexity, Unnamed Item, More Precise Yet Widely Applicable Cost Analysis, Certified abstract cost analysis, Unnamed Item, Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs, Two decades of automatic amortized resource analysis, Type-based analysis of logarithmic amortised complexity
Uses Software
