Termination analysis of logic programs (Extended abstract)

    Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review


    Termination is well-known to be one of the most intriguing aspects of program verification. Since logic programs are Turing-complete, it follows by the undecidability of the halting problem that there exists no algorithm which, given an arbitrary logic program, decides whether the program terminates. However, one can propose both conditions that are equivalent to termination and their approximations that imply termination and can be verified automatically. This paper briefly discusses these kinds of conditions that were studied in [2].
    Originele taal-2Engels
    TitelProceedings of the 19th International Conference on Logic Programming (ICLP'03), 9-13 December 2003, Mumbai, India
    RedacteurenC. Palamidessi
    Plaats van productieBerlin
    ISBN van geprinte versie3-540-20642-6
    StatusGepubliceerd - 2003

    Publicatie series

    NaamLecture Notes in Computer Science
    ISSN van geprinte versie0302-9743

    Citeer dit