Vertel uw vrienden over dit artikel:
Termination Proofs for Logic Programs - Lecture Notes in Computer Science Lutz Plumer 1990 edition
Termination Proofs for Logic Programs - Lecture Notes in Computer Science
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.
142 pages, biography
| Media | Boeken Paperback Book (Boek met zachte kaft en gelijmde rug) |
| Vrijgegeven | 24 juli 1990 |
| ISBN13 | 9783540528371 |
| Uitgevers | Springer-Verlag Berlin and Heidelberg Gm |
| Pagina's | 142 |
| Afmetingen | 155 × 235 × 8 mm · 226 g |
| Taal en grammatica | Engels |