A combination framework for complexity
From MaRDI portal
Publication:276251
DOI10.1016/j.ic.2015.12.007zbMath1339.68135OpenAlexW148448369MaRDI QIDQ276251
Publication date: 3 May 2016
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2015.12.007
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
ATLAS: automated amortised complexity analysis of self-adjusting data structures ⋮ From Jinja bytecode to term rewriting: a complexity reflecting transformation ⋮ Read/write factorizable programs ⋮ Analysing parallel complexity of term rewriting ⋮ Unnamed Item ⋮ Type-based analysis of logarithmic amortised complexity ⋮ Runtime complexity analysis of logically constrained rewriting
Uses Software
Cites Work
- Uncurrying for termination and complexity
- A new recursion-theoretic characterization of the polytime functions
- Complexity analysis of term-rewriting systems
- Modular termination proofs for rewriting using dependency pairs
- Termination of term rewriting using dependency pairs
- A new order-theoretic characterisation of the polytime computable functions
- Analyzing innermost runtime complexity of term rewriting by dependency pairs
- Algorithms with polynomial interpretation termination proof
- Polynomial Path Orders
- On Constructor Rewrite Systems and the Lambda Calculus
- A Combination Framework for Complexity
- Tyrolean Complexity Tool: Features and Usage.
- Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems
- Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations
- Monotonicity Constraints for Termination in the Integer Domain
- Quasi-interpretation Synthesis by Decomposition
- Automated Complexity Analysis Based on the Dependency Pair Method
- POP* and Semantic Labeling Using SAT
- Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
- Termination proofs and the length of derivations
- Automated Complexity Analysis Based on Context-Sensitive Rewriting
- The size-change principle for program termination
- A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems
- Automatic Type Inference for Amortised Heap-Space Analysis
- Closing the Gap Between Runtime Complexity and Polytime Computability.
- Modular Complexity Analysis via Relative Complexity
- Multivariate amortized resource analysis
- Complexity, Graphs, and the Dependency Pair Method
- Rewriting Techniques and Applications
- The Derivational Complexity Induced by the Dependency Pair Method
This page was built for publication: A combination framework for complexity
