Extended Set Constraints and Tree Grammar Abstraction of Programs

Mads Rosendahl; John Patrick Gallagher

Extended Set Constraints and Tree Grammar Abstraction of Programs

Programming, Logic and Intelligent Systems

Research output: Contribution to conference › Paper › Research

330 Downloads (Pure)

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.

Original language	English
Publication date	2011
Number of pages	12
Publication status	Published - 2011
Event	21st Workshop on Logic-based methods in Programming Environments: Satellite workshop of ICLP 2011 - Lexington, United States Duration: 10 Jul 2011 → 10 Jul 2011 Conference number: 21

Workshop

Workshop	21st Workshop on Logic-based methods in Programming Environments
Number	21
Country/Territory	United States
City	Lexington
Period	10/07/2011 → 10/07/2011

Access to Document

PaperSubmitted manuscript, 201 KB

http://imada.sdu.dk/~petersk/WLPE2011/#venue

Citation Styles

@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",

note = "21st Workshop on Logic-based methods in Programming Environments : Satellite workshop of ICLP 2011 ; Conference date: 10-07-2011 Through 10-07-2011",

}

TY - CONF

T1 - Extended Set Constraints and Tree Grammar Abstraction of Programs

AU - Rosendahl, Mads

AU - Gallagher, John Patrick

N1 - Conference code: 21

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

T2 - 21st Workshop on Logic-based methods in Programming Environments

Y2 - 10 July 2011 through 10 July 2011

ER -