A Decision Tree Abstract Domain for Proving Conditional Termination
Abstract elided by the publisher.
Related papers
- Lifted termination analysis by abstract interpretation and its applications GPCE 2021
- A Binary Decision Tree Abstract Domain Functor SAS 2015
- Decision Tree Learning in CEGIS-Based Termination Analysis CAV 2021
- Recursive proofs for inductive tree data-structures POPL 2012
- Decision Procedures for Automating Termination Proofs VMCAI 2011
- Proving data-poisoning robustness in decision trees PLDI 2020
- Lifted Static Analysis of Dynamic Program Families by Abstract Interpretation ECOOP 2021
- Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes CAV 2022