Recommendations
Cited in
(8)- Lifting CDCL to template-based abstract domains for program verification
- Reflections on termination of linear loops
- Specifying termination in CSP
- Proving termination through conditional termination
- Automatically proving termination and memory safety for programs with pointer arithmetic
- Abstract conflict driven learning
- Abstract interpretation as automated deduction
- Inference of ranking functions for proving temporal properties by abstract interpretation
This page was built for publication: Conflict-driven conditional termination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702895)