Amortised Resource Analysis with Separation Logic
From MaRDI portal
Publication:3558217
DOI10.1007/978-3-642-11957-6_6zbMath1260.68083OpenAlexW2138657070MaRDI QIDQ3558217
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_6
Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Bringing Order to the Separation Logic Jungle, Verified Root-Balanced Trees, Selectively-amortized resource bounding, From Jinja bytecode to term rewriting: a complexity reflecting transformation, A Hoare Logic for Energy Consumption Analysis, Denotational semantics as a foundation for cost recurrence extraction for functional languages, Unnamed Item, Unnamed Item, For a few dollars more. Verified fine-grained algorithm analysis down to LLVM, Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits, Amortized complexity verified, Unnamed Item, Relational cost analysis in a functional-imperative setting, Two decades of automatic amortized resource analysis
Uses Software
