Termin realizacji zamówienia: ok. 20 dni roboczych.
Darmowa dostawa!
Presents a technique for the automatic generation of termination proofs for logic programs, which constitute a crucial part of program verification. This book discusses several nontrivial examples.
Basic notions.- Static program properties and transformations.- Terminating logic programs.- The problem of local variables.- And/or dataflow graphs.- A termination proof procedure.- Integration of unfolding techniques.- Conclusions.