Termination proofs for logic programs
Termination proofs constitute a crucial part of program verification. Much research about termination has been done in the context of term rewriting systems. But until now there was little hope that termination proofs for nontrivial programs could be achieved automatically. This book gives a compreh...
Guardat en:
| Autor principal: | |
|---|---|
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science. Lecture notes in artificial intelligence
446 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Termination proofs for logic programs, Lutz Plümer, 1990, Berlin, Paris [etc.], Springer-Verlag, 1 vol. (viii-142 p.), Lecture notes in computer science, 3-540-52837-7 • Termination Proofs for Logic Programs, Texte imprimé, 9783662176948 |
Taula de continguts:
- 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.