Abstract
AbstractTo (dis)prove termination of programs, uses symbolic execution to transform the program’s code into an integer transition system, which is then analyzed by several backends. The transformation steps in and the tools in the backend only produce sub-proofs in their domains. Hence, we now developed new techniques to automatically combine the essence of these proofs. If non-termination is proved, then they yield an overall witness, which identifies a non-terminating path in the original program.
Publisher
Springer International Publishing
Reference17 articles.
1. AProVE: https://github.com/aprove-developers/aprove-releases/releases
2. AProVE Website: https://aprove.informatik.rwth-aachen.de/
3. Beyer, D.: Progress on software verification: SV-COMP 2022. In: Proc. TACAS ’22. LNCS (2022)
4. Beyer, D.: Verifiers and validators of the 11th Intl. Competition on Software Verification (SV-COMP 2022). Zenodo (2022), https://doi.org/10.5281/zenodo.5959149
5. Beyer, D., Keremoglu, M.E.: CPAchecker: A tool for configurable software verification. In: Proc. CAV ’11. pp. 184–190. LNCS 6806 (2011), https://doi.org/10.1007/978-3-642-22110-1_16
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. SMT Theory Arbitrage: Approximating Unbounded Constraints using Bounded Theories;Proceedings of the ACM on Programming Languages;2024-06-20
2. Proving Termination of C Programs with Lists;Automated Deduction – CADE 29;2023
3. FuzzNT : Checking for Program Non-termination;2022 IEEE International Conference on Software Maintenance and Evolution (ICSME);2022-10
4. Progress on Software Verification: SV-COMP 2022;Tools and Algorithms for the Construction and Analysis of Systems;2022
5. Software Model Checking: 20 Years and Beyond;Lecture Notes in Computer Science;2022