Convex Hull Abstraction in Specialisation of CLP Programs

    Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

    Abstract

    We introduce an abstract domain consisting of atomic formulas constrained by linear arithmetic constraints (or convex hulls). This domain is used in an algorithm for specialization of constraint logic programs. The algorithm incorporates in a single phase both top-down goal directed propagation and bottom-up answer propagation, and uses a widening on the convex hull domain to ensure termination. We give examples to show the precision gained by this approach over other methods in the literature for specializing constraint logic programs. The specialization method can also be used for ordinary logic programs containing arithmetic, as well as constraint logic programs. Assignments, inequalities and equalities with arithmetic expressions can be interpreted as constraints during specialization, thus increasing the amount of specialization that can be achieved.
    OriginalsprogEngelsk
    BogserieLecture Notes in Computer Science
    Udgave nummer2664
    Sider (fra-til)90-108
    Antal sider19
    ISSN0302-9743
    StatusUdgivet - 2003

    Citer dette