Author:
Giesl Jürgen,Aschermann Cornelius,Brockschmidt Marc,Emmes Fabian,Frohn Florian,Fuhs Carsten,Hensel Jera,Otto Carsten,Plücker Martin,Schneider-Kamp Peter,Ströder Thomas,Swiderski Stephanie,Thiemann René
Funder
Deutsche Forschungsgemeinschaft
Air Force Research Laboratory
Austrian Science Fund
Danish Council for Independent Research, Natural Sciences
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Software
Reference64 articles.
1. Albert, E., Arenas, P., Genaim, S., Puebla, G., Zanardini, D.: Removing useless variables in cost analysis of Java Bytecode. In: SAC ’08, pp. 368–375 (2008)
2. Alias, C., Darte, A., Feautrier, P., Gonnord, L.: Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs. In: SAS ’10, pp. 117–133 (2010)
3. Alpuente, M., Escobar, S., Lucas, S.: Removing redundant arguments automatically. TPLP 7(1–2), 3–35 (2007)
4. AProVE.
http://aprove.informatik.rwth-aachen.de/
5. Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB standard: Version 2.5. Technical report, The University of Iowa.
http://smt-lib.org/
(2015)
Cited by
82 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Non-termination in Term Rewriting and Logic Programming;Journal of Automated Reasoning;2024-02-02
2. Termination of triangular polynomial loops;Formal Methods in System Design;2023-12-04
3. Improving Bit-Blasting for Nonlinear Integer Constraints;Proceedings of the 32nd ACM SIGSOFT International Symposium on Software Testing and Analysis;2023-07-12
4. An Automated Approach to the Collatz Conjecture;Journal of Automated Reasoning;2023-04-25
5. Analyzing Innermost Runtime Complexity Through Tuple Interpretations;Electronic Proceedings in Theoretical Computer Science;2023-03-23