Extended Set Constraints and Tree Grammar Abstraction of Programs

Publikation: KonferencebidragPaperForskning

Resumé

Set constraints are relations between sets of ground terms or trees. This paper presents two main contributions: firstly we consider an extension of the systems of set constraints to include a tuple constructor, and secondly we construct a simplified solution procedure for set constraints. We illustrate the approach using logic programs and show that we can construct various set-based abstractions of a program including the TP abstraction using a system of set constraints derived in a single pass over the program.
OriginalsprogEngelsk
Publikationsdato2011
Antal sider12
StatusUdgivet - 2011

Citer dette

@conference{70cc7ac81fdc4c3589f71bb9b153df0b,
title = "Extended Set Constraints and Tree Grammar Abstraction of Programs",
abstract = "Set constraints are relations between sets of ground terms or trees.This paper presents two main contributions: firstly we consider an extension of the systems of set constraints to include a tuple constructor, and secondly we construct a simplified solution procedure for set constraints. We illustrate the approach using logic programs and show that we can construct various set-based abstractions of a program including the {"}Tau-P{"} abstraction using a system of set constraints derived in a single pass over the program.",
author = "Mads Rosendahl and Gallagher, {John Patrick}",
year = "2011",
language = "English",

}

TY - CONF

T1 - Extended Set Constraints and Tree Grammar Abstraction of Programs

AU - Rosendahl, Mads

AU - Gallagher, John Patrick

PY - 2011

Y1 - 2011

N2 - Set constraints are relations between sets of ground terms or trees.This paper presents two main contributions: firstly we consider an extension of the systems of set constraints to include a tuple constructor, and secondly we construct a simplified solution procedure for set constraints. We illustrate the approach using logic programs and show that we can construct various set-based abstractions of a program including the "Tau-P" abstraction using a system of set constraints derived in a single pass over the program.

AB - Set constraints are relations between sets of ground terms or trees.This paper presents two main contributions: firstly we consider an extension of the systems of set constraints to include a tuple constructor, and secondly we construct a simplified solution procedure for set constraints. We illustrate the approach using logic programs and show that we can construct various set-based abstractions of a program including the "Tau-P" abstraction using a system of set constraints derived in a single pass over the program.

M3 - Paper

ER -