Author:
Avanzini Martin,Moser Georg
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference42 articles.
1. A. Ben-Amram, Monotonicity constraints for termination in the integer domain, Log. Methods Comput. Sci. 7 (3).
2. Algorithms with polynomial interpretation termination proof;Bonfante;J. Funct. Program.,2001
3. Termination proofs and the length of derivations;Hofbauer,1989
4. Automated complexity analysis based on the dependency pair method;Hirokawa,2008
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Robust Resource Bounds with Static Analysis and Bayesian Inference;Proceedings of the ACM on Programming Languages;2024-06-20
2. Automatic Amortized Resource Analysis with Regular Recursive Types;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
3. Read/write factorizable programs;Journal of Functional Programming;2023
4. Analysing Parallel Complexity of Term Rewriting;Logic-Based Program Synthesis and Transformation;2022
5. Type-based analysis of logarithmic amortised complexity;Mathematical Structures in Computer Science;2021-10-19