Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)
From MaRDI portal
Publication:6492742
DOI10.1007/978-3-031-38499-8_13MaRDI QIDQ6492742
Publication date: 26 April 2024
Mechanization of proofs and logical operations (03B35) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
This page was built for publication: Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)