Exponential automatic amortized resource analysis
From MaRDI portal
(Redirected from Publication:2200835)
Recommendations
- Two decades of automatic amortized resource analysis
- Type-based amortized resource analysis with integers and arrays
- Type-based amortized resource analysis with integers and arrays
- Multivariate amortized resource analysis
- Amortized resource analysis with polynomial potential. A static inference of polynomial bounds for functional programs
Cites work
- scientific article; zbMATH DE number 1059329 (Why is no real title available?)
- scientific article; zbMATH DE number 7204445 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- A calculus of communicating systems
- A partial order approach to branching time logic model checking.
- A stubborn attack on state explosion
- A theory of type polymorphism in programming
- Amortized Computational Complexity
- Amortized complexity verified
- Analyzing innermost runtime complexity of term rewriting by dependency pairs
- Automatic Space Bound Analysis for Functional Programs with Garbage Collection
- Combining partial-order reductions with on-the-fly model-checking.
- Complexity and resource bound analysis of imperative programs using difference constraints
- Confluence for process verification
- Contract-based resource verification for higher-order functions with memoization
- Invariants for the construction of a handshake register
- Liveness analysis for parameterised Boolean equation systems
- Mechanical program analysis
- Parameterised Boolean equation systems
- Partial order reduction for checking LTL formulae with the next-time operator
- Partial order reduction for reachability games
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Partial-order reduction in the weak modal mu-calculus
- Proof graphs for parameterised Boolean equation systems
- Results on the propositional \(\mu\)-calculus
- Stubborn set intuition explained
- Stubborn set reduction for two-player reachability games
- The inconsistent labelling problem of stutter-preserving partial-order reduction
- Type-Based Allocation Analysis for Co-recursion in Lazy Functional Languages
- Weakest precondition reasoning for expected run-times of probabilistic programs
Cited in
(4)
This page was built for publication: Exponential automatic amortized resource analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200835)
