Funder
Deutsche Forschungsgemeinschaft
Air Force Research Laboratory
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Software
Reference34 articles.
1. Albert, E., Genaim, S., Masud, A.N.: On the inference of resource usage upper and lower bounds. ACM Trans. Comput. Log. 14(3), 22 (2013)
2. AProVE.
http://aprove.informatik.rwth-aachen.de/eval/lowerbounds-journal/
3. Avanzini, M., Moser, G.: A combination framework for complexity. In: Proceedings of RTA ’13. LIPIcs 21, pp. 55–70 (2013)
4. Avanzini, M., Moser, G., Schaper, M.: $${\sf TcT}$$: Tyrolean complexity tool. In: Proceedings of TACAS ’16. LNCS 9636, pp. 407–423 (2016)
5. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Dependency Pair Framework for Relative Termination of Term Rewriting;Lecture Notes in Computer Science;2024
2. Analysing Parallel Complexity of Term Rewriting;Logic-Based Program Synthesis and Transformation;2022
3. Improving Automatic Complexity Analysis of Integer Programs;The Logic of Software. A Tasting Menu of Formal Methods;2022
4. Inferring Lower Runtime Bounds for Integer Programs;ACM Transactions on Programming Languages and Systems;2020-09-30
5. The Termination and Complexity Competition;Tools and Algorithms for the Construction and Analysis of Systems;2019