We use a declarative SMT-based approach to model-checking of infinite state systems to design a procedure for automatically establishing the termination of backward reachability by using well-quasi-orderings. Besides showing that our procedure succeeds in many instances of problems covered by general termination results, we argue that it could predict termination also on single problems outside the scope of applicability of such general results.
['Alessandro Carioni', 'Silvio Ghilardi', 'Silvio Ranise']
Automated termination in model checking modulo theories