Analysis of Logic Programs Using Regular Tree Languages

Extended Abstract

Publikation: Bidrag til tidsskriftKonferenceartikelForskningpeer review

Resumé

The eld of nite tree automata provides fundamental notations and tools for reasoning about set of terms called regular or recognizable tree languages. We consider two kinds of analysis using regular tree languages, applied to logic programs. The rst approach is to try to discover automatically a tree automaton from a logic program, approximating its minimal Herbrand model. In this case the input for the analysis is a program, and the output is a tree automaton. The second approach is to expose or check properties of the program that can be
expressed by a given tree automaton. The input to the analysis is a program
and a tree automaton, and the output is an abstract model of the program. These two contrasting abstract interpretations can be used in a wide range of analysis and verication problems.
OriginalsprogEngelsk
BogserieLecture Notes in Computer Science
Vol/bind7225
Sider (fra-til)1-3
Antal sider3
ISSN0302-9743
StatusUdgivet - 2012

Citer dette

@inproceedings{677a5321e7814705b4cf6c2f632e0c79,
title = "Analysis of Logic Programs Using Regular Tree Languages: Extended Abstract",
abstract = "The eld of nite tree automata provides fundamental notations and tools for reasoning about set of terms called regular or recognizable tree languages. We consider two kinds of analysis using regular tree languages, applied to logic programs. The rst approach is to try to discover automatically a tree automaton from a logic program, approximating its minimal Herbrand model. In this case the input for the analysis is a program, and the output is a tree automaton. The second approach is to expose or check properties of the program that can beexpressed by a given tree automaton. The input to the analysis is a programand a tree automaton, and the output is an abstract model of the program. These two contrasting abstract interpretations can be used in a wide range of analysis and verication problems.",
author = "Gallagher, {John Patrick}",
year = "2012",
language = "English",
volume = "7225",
pages = "1--3",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Physica-Verlag",

}

Analysis of Logic Programs Using Regular Tree Languages : Extended Abstract. / Gallagher, John Patrick.

I: Lecture Notes in Computer Science, Bind 7225, 2012, s. 1-3.

Publikation: Bidrag til tidsskriftKonferenceartikelForskningpeer review

TY - GEN

T1 - Analysis of Logic Programs Using Regular Tree Languages

T2 - Extended Abstract

AU - Gallagher, John Patrick

PY - 2012

Y1 - 2012

N2 - The eld of nite tree automata provides fundamental notations and tools for reasoning about set of terms called regular or recognizable tree languages. We consider two kinds of analysis using regular tree languages, applied to logic programs. The rst approach is to try to discover automatically a tree automaton from a logic program, approximating its minimal Herbrand model. In this case the input for the analysis is a program, and the output is a tree automaton. The second approach is to expose or check properties of the program that can beexpressed by a given tree automaton. The input to the analysis is a programand a tree automaton, and the output is an abstract model of the program. These two contrasting abstract interpretations can be used in a wide range of analysis and verication problems.

AB - The eld of nite tree automata provides fundamental notations and tools for reasoning about set of terms called regular or recognizable tree languages. We consider two kinds of analysis using regular tree languages, applied to logic programs. The rst approach is to try to discover automatically a tree automaton from a logic program, approximating its minimal Herbrand model. In this case the input for the analysis is a program, and the output is a tree automaton. The second approach is to expose or check properties of the program that can beexpressed by a given tree automaton. The input to the analysis is a programand a tree automaton, and the output is an abstract model of the program. These two contrasting abstract interpretations can be used in a wide range of analysis and verication problems.

M3 - Conference article

VL - 7225

SP - 1

EP - 3

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -