Program specialisation as a preprocessing step for termination analysis
Manh Thang Nguyen, Maurice Bruynooghe, Danny De Schreye, Michaël Leuschel · Lirias · 2006
Previous works have shown that the structure information of a logic program can be used to transform it to another program such that the transformation is termination preserving and termination proof becomes easier and more precise [1,2]. In [2], a transformation which is based on partial evaluation