Bøger af Lutz Plumer

Termination proofs constitute a crucial part of program verification. Although logic programs pose special difficulties for termination proofs it turns out that automation of this task is obtainable to a much larger degree than for programs in imperative languages.