Abstract: The verification of termination is a difficult problem. While most of the recent work on automated termination proofs focuses on the construction of linear ranking functions for unnested ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback