Abstract
AbstractWe recently proposed Acceleration Driven Clause Learning (ADCL), a novel calculus to analyze satisfiability of Constrained Horn Clauses (CHCs). Here, we adapt ADCL to transition systems and introduce ADCL-NT, a variant for disproving termination. We implemented ADCL-NT in our tool and evaluate it against the state of the art.
Publisher
Springer Nature Switzerland
Reference28 articles.
1. Bagnara, R., Pescetti, A., Zaccagnini, A., Zaffanella, E.: PURRS: towards computer algebra support for fully automatic worst-case complexity analysis. CoRR abs/cs/0512056 (2005). https://arxiv.org/abs/cs/0512056
2. Lecture Notes in Computer Science;AM Ben-Amram,2019
3. Lecture Notes in Computer Science;C Borralleras,2017
4. Lecture Notes in Computer Science;M Bozga,2009
5. Brockschmidt, M., Ströder, T., Otto, C., Giesl, J.: Automated detection of non-termination and NullPointerExceptions for Java Bytecode. In: Beckert, B., Damiani, F., Gurov, D. (eds.) Formal Verification of Object-Oriented Software. FoVeOOS 2011. LNCS, vol. 7421, pp. 123–141. Springer, Berlin, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31762-0_9