Exponential automatic amortized resource analysis
From MaRDI portal
Publication:2200835
DOI10.1007/978-3-030-45231-5_19OpenAlexW3009691493MaRDI QIDQ2200835
Publication date: 23 September 2020
Full work available at URL: https://arxiv.org/abs/2002.09519
Stirling numbersresource consumptionfunctional programmingexponentialquantitative analysisamortized analysis
Related Items
Synthesis with asymptotic resource bounds, Two decades of automatic amortized resource analysis, Type-based analysis of logarithmic amortised complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Invariants for the construction of a handshake register
- Amortized complexity verified
- Confluence for process verification
- A stubborn attack on state explosion
- Results on the propositional \(\mu\)-calculus
- Combining partial-order reductions with on-the-fly model-checking.
- A calculus of communicating systems
- A theory of type polymorphism in programming
- A partial order approach to branching time logic model checking.
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- The inconsistent labelling problem of stutter-preserving partial-order reduction
- Analyzing innermost runtime complexity of term rewriting by dependency pairs
- Complexity and resource bound analysis of imperative programs using difference constraints
- Parameterised Boolean equation systems
- Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages
- Weakest Precondition Reasoning for Expected Run–Times of Probabilistic Programs
- Proof Graphs for Parameterised Boolean Equation Systems
- Partial order reduction for checking LTL formulae with the next-time operator
- Liveness Analysis for Parameterised Boolean Equation Systems
- Amortized Computational Complexity
- Mechanical program analysis
- Stubborn Set Intuition Explained
- Automatic Space Bound Analysis for Functional Programs with Garbage Collection
- Contract-based resource verification for higher-order functions with memoization
- Partial order reduction for reachability games
- Partial-order reduction in the weak modal mu-calculus
