Inference of Well-Typings for Logic Programs with Application to Termination Analysis

M. Bruynooghe, John Patrick Gallagher, W. Van Humbeeck

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearch

    Abstract

    A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms can automatically be constructed. Previous work on type-based termination analysis used either types declared by the user, or automatically generated monomorphic types describing the success set of predicates. The latter types are less precise and result in weaker termination conditions than those obtained from declared types. Our type inference procedure involves solving set constraints generated from the program and derives a well-typing in contrast to a success-set approximation. Experiments so far show that our automatically inferred well-typings are close to the declared types and result in termination conditions that are as strong as those obtained with declared types. We describe the method, its implementation and experiments with termination analysis based on the inferred types.
    Original languageEnglish
    Title of host publicationStatic Analysis, 12th International Symposium
    Number of pages17
    PublisherKluwer Academic Publishers
    Publication date2005
    Pages35-51
    ISBN (Print)3-540-28584-9
    Publication statusPublished - 2005
    Event12th International Static Analysis Symposium - London, United Kingdom
    Duration: 7 Sep 20059 Sep 2005
    Conference number: 12

    Conference

    Conference12th International Static Analysis Symposium
    Number12
    Country/TerritoryUnited Kingdom
    CityLondon
    Period07/09/200509/09/2005
    SeriesLecture Notes in Computer Science
    Volume3672
    ISSN0302-9743

    Cite this