scientific article; zbMATH DE number 7204445
From MaRDI portal
Publication:5111324
DOI10.4230/LIPIcs.FSCD.2017.26zbMath1441.68018MaRDI QIDQ5111324
Jan Hoffmann, Benjamin Lichtman
Publication date: 26 May 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Exponential automatic amortized resource analysis ⋮ Unnamed Item ⋮ Relational cost analysis in a functional-imperative setting ⋮ Two decades of automatic amortized resource analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cost analysis of object-oriented bytecode programs
- Automated higher-order complexity analysis
- Analyzing innermost runtime complexity of term rewriting by dependency pairs
- Complexity and resource bound analysis of imperative programs using difference constraints
- Resource Analysis of Complex Programs with Cost Equations
- Segment Abstraction for Worst-Case Execution Time Analysis
- Refinement Types for Incremental Computational Complexity
- Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages
- The geometry of types
- Static prediction of heap space usage for first-order functional programs
- Denotational cost semantics for functional languages with inductive types
- Analysing the complexity of functional programs: higher-order meets first-order
- ABC: Algebraic Bound Computation for Loops
- Lightweight semiformal time complexity analysis for purely functional data structures
- Amortised Resource Analysis with Separation Logic
- Amortized Resource Analysis with Polynomial Potential
- Efficient Type-Checking for Amortised Heap-Space Analysis
- Linear Dependent Types and Relative Completeness
- Type-Based Amortized Resource Analysis with Integers and Arrays
- Amortised Resource Analysis and Typed Polynomial Interpretations
- Static determination of quantitative resource usage for higher-order programs
- SPEED
- Multivariate Amortised Resource Analysis for Term Rewrite Systems
- Contract-based resource verification for higher-order functions with memoization
- Towards automatic resource bound analysis for OCaml
- Multivariate amortized resource analysis
- Typed Lambda Calculi and Applications
- Programming Languages and Systems
This page was built for publication:
