Unfolding the mystery of Mergesort

N. Lindenstrauss, Y. Sagiv, A. Serebrenik

    Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

    7 Citaten (Scopus)

    Samenvatting

    This paper outlines a fully automatic transformation for proving termination of queries to a class of logic programs, for which existing methods do not work directly. The transformation consists of creating adorned clauses and unfolding. In general, the transformation may improve termination behavior by pruning infinite branches from the LD-tree. Conditions are given under which the transformation preserves termination behavior. The work presented here has been done in the framework of the TermiLog system, and it complements the algorithms described in [12].
    Originele taal-2Engels
    TitelProceedings of the 7th International Workshop on Logic Programming Synthesis and Transformation (LOPSTR'97), 10-12 July 1997, Leuven, Belgium
    RedacteurenN.E. Fuchs
    Plaats van productieBerlin
    UitgeverijSpringer
    Pagina's206-225
    ISBN van geprinte versie3-540-65074-1
    DOI's
    StatusGepubliceerd - 1997

    Publicatie series

    NaamLecture Notes in Computer Science
    Volume1463
    ISSN van geprinte versie0302-9743

    Vingerafdruk

    Duik in de onderzoeksthema's van 'Unfolding the mystery of Mergesort'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit