scientific article; zbMATH DE number 7204445
From MaRDI portal
Publication:5111324
DOI10.4230/LIPICS.FSCD.2017.26zbMATH Open1441.68018MaRDI QIDQ5111324FDOQ5111324
Authors: Benjamin Lichtman, Jan Hoffmann 
Publication date: 26 May 2020
Title of this publication is not available (Why is that?)
Recommendations
- Type-based amortized resource analysis with integers and arrays
- Type-based amortized resource analysis with integers and arrays
- Towards automatic resource bound analysis for OCaml
- Amortized resource analysis with polynomial potential. A static inference of polynomial bounds for functional programs
- Multivariate amortized resource analysis
Cites Work
- Analyzing innermost runtime complexity of term rewriting by dependency pairs
- Analysing the complexity of functional programs: higher-order meets first-order
- Linear dependent types and relative completeness
- Multivariate amortized resource analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- SPEED: precise and efficient static estimation of program computational complexity
- Cost analysis of object-oriented bytecode programs
- Automated higher-order complexity analysis
- Static prediction of heap space usage for first-order functional programs
- Denotational cost semantics for functional languages with inductive types
- Lightweight semiformal time complexity analysis for purely functional data structures
- Amortised resource analysis with separation logic
- Amortized resource analysis with polynomial potential. A static inference of polynomial bounds for functional programs
- Contract-based resource verification for higher-order functions with memoization
- Towards automatic resource bound analysis for OCaml
- Complexity and resource bound analysis of imperative programs using difference constraints
- ABC: algebraic bound computation for loops
- Amortised resource analysis and typed polynomial interpretations
- Multivariate amortised resource analysis for term rewrite systems
- Resource analysis of complex programs with cost equations
- Efficient Type-Checking for Amortised Heap-Space Analysis
- Static determination of quantitative resource usage for higher-order programs
- Programming Languages and Systems
- The geometry of types
- Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages
- Title not available (Why is that?)
- Segment Abstraction for Worst-Case Execution Time Analysis
- Refinement types for incremental computational complexity
- Typed Lambda Calculi and Applications
- Type-based amortized resource analysis with integers and arrays
Cited In (6)
- Type-based amortized resource analysis with integers and arrays
- Type-based amortized resource analysis with integers and arrays
- Two decades of automatic amortized resource analysis
- Exponential automatic amortized resource analysis
- Title not available (Why is that?)
- Relational cost analysis in a functional-imperative setting
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111324)
