Author:
Naaf Matthias,Frohn Florian,Brockschmidt Marc,Fuhs Carsten,Giesl Jürgen
Publisher
Springer International Publishing
Reference37 articles.
1. Albert, E., Arenas, P., Genaim, S., Puebla, G.: Closed-form upper bounds in static cost analysis. J. Autom. Reasoning 46(2), 161–203 (2011)
2. Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Cost analysis of object-oriented bytecode programs. Theor. Comput. Sc. 413(1), 142–159 (2012)
3. Lecture Notes in Computer Science;E Albert,2014
4. Lecture Notes in Computer Science;C Alias,2010
5. AProVE.
https://aprove-developers.github.io/trs_complexity_via_its/
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Automatic Amortized Resource Analysis with Regular Recursive Types;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
2. Elements of Quantitative Rewriting;Proceedings of the ACM on Programming Languages;2023-01-09
3. From Starvation Freedom to All-Path Reachability Problems in Constrained Rewriting;Practical Aspects of Declarative Languages;2023
4. Analysing Parallel Complexity of Term Rewriting;Logic-Based Program Synthesis and Transformation;2022
5. Automatic amortized resource analysis with the Quantum physicist’s method;Proceedings of the ACM on Programming Languages;2021-08-22