### Resumé

Originalsprog | Engelsk |
---|---|

Publikationsdato | 2011 |

Antal sider | 12 |

Status | Udgivet - 2011 |

### Citer dette

}

**Extended Set Constraints and Tree Grammar Abstraction of Programs.** / Rosendahl, Mads; Gallagher, John Patrick.

Publikation: Konferencebidrag › Paper › Forskning

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 -