Converting One Type-Based Abstract Domain to Another

John Patrick Gallagher, German Puebla, Elvira Albert

Research output: Contribution to journalConference articleResearchpeer-review

Abstract

The specific problem that motivates this paper is how to obtain abstract descriptions of the meanings of imported predicates (such as built-ins) that can be used when analysing a module of a logic program with respect to some abstract domain. We assume that abstract descriptions of the imported predicates are available in terms of some ``standard" assertions. The first task is to define an abstract domain corresponding to the assertions for a given module and express the descriptions as objects in that domain. Following that they are automatically transformed into the analysis domain of interest. We develop a method which has been applied in order to generate call and success patterns from the Ciaopp assertions for built-ins, for any given regular type-based domain. In the paper we present the method as an instance of the more general problem of mapping elements of one abstract domain to another, with as little loss in precision as possible.
Original languageEnglish
Book seriesLecture Notes in Computer Science
Pages (from-to)147-162
Number of pages16
ISSN0302-9743
Publication statusPublished - 2006
EventInternational Workshop on Logic Program Synthesis and Transformation (LOPSTR) - London, United Kingdom
Duration: 7 Sep 20059 Sep 2005

Conference

ConferenceInternational Workshop on Logic Program Synthesis and Transformation (LOPSTR)
CountryUnited Kingdom
CityLondon
Period07/09/200509/09/2005

Cite this

@inproceedings{a9640a00c74811dbbd5f000ea68e967b,
title = "Converting One Type-Based Abstract Domain to Another",
abstract = "The specific problem that motivates this paper is how to obtain abstract descriptions of the meanings of imported predicates (such as built-ins) that can be used when analysing a module of a logic program with respect to some abstract domain. We assume that abstract descriptions of the imported predicates are available in terms of some ``standard{"} assertions. The first task is to define an abstract domain corresponding to the assertions for a given module and express the descriptions as objects in that domain. Following that they are automatically transformed into the analysis domain of interest. We develop a method which has been applied in order to generate call and success patterns from the Ciaopp assertions for built-ins, for any given regular type-based domain. In the paper we present the method as an instance of the more general problem of mapping elements of one abstract domain to another, with as little loss in precision as possible.",
author = "Gallagher, {John Patrick} and German Puebla and Elvira Albert",
note = "Serie: Lecture Notes in Computer Science, 3901",
year = "2006",
language = "English",
pages = "147--162",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Physica-Verlag",

}

Converting One Type-Based Abstract Domain to Another. / Gallagher, John Patrick; Puebla, German; Albert, Elvira.

In: Lecture Notes in Computer Science, 2006, p. 147-162.

Research output: Contribution to journalConference articleResearchpeer-review

TY - GEN

T1 - Converting One Type-Based Abstract Domain to Another

AU - Gallagher, John Patrick

AU - Puebla, German

AU - Albert, Elvira

N1 - Serie: Lecture Notes in Computer Science, 3901

PY - 2006

Y1 - 2006

N2 - The specific problem that motivates this paper is how to obtain abstract descriptions of the meanings of imported predicates (such as built-ins) that can be used when analysing a module of a logic program with respect to some abstract domain. We assume that abstract descriptions of the imported predicates are available in terms of some ``standard" assertions. The first task is to define an abstract domain corresponding to the assertions for a given module and express the descriptions as objects in that domain. Following that they are automatically transformed into the analysis domain of interest. We develop a method which has been applied in order to generate call and success patterns from the Ciaopp assertions for built-ins, for any given regular type-based domain. In the paper we present the method as an instance of the more general problem of mapping elements of one abstract domain to another, with as little loss in precision as possible.

AB - The specific problem that motivates this paper is how to obtain abstract descriptions of the meanings of imported predicates (such as built-ins) that can be used when analysing a module of a logic program with respect to some abstract domain. We assume that abstract descriptions of the imported predicates are available in terms of some ``standard" assertions. The first task is to define an abstract domain corresponding to the assertions for a given module and express the descriptions as objects in that domain. Following that they are automatically transformed into the analysis domain of interest. We develop a method which has been applied in order to generate call and success patterns from the Ciaopp assertions for built-ins, for any given regular type-based domain. In the paper we present the method as an instance of the more general problem of mapping elements of one abstract domain to another, with as little loss in precision as possible.

M3 - Conference article

SP - 147

EP - 162

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -