Search in ATOLL bibliography

all | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 2000 | 1999 | 1998 | 1997 | 1996 | 1995 | 1994 | 1993 | 1992 | 1991 | 1990 | 1989 | PS|PDF|HTML BIB|Raw BIB|Submit

Year:

Type:

Search: (please use the notation of Alta Vista simple queries)

Key search


Année 1993

Thèses et habilitations à diriger des recherches

[182]
Automates à piles et programmation dynamique. DyALog : Une application à la programmation en logique. PhD thesis, Université Paris 7, 1993.
Éric Villemonte de La Clergerie.
[BibTeX] [URL]

Communications à des congrés, colloques, etc.

[183]
Layer sharing : an improved structure–sharing framework. In Proc. of POPL'93, pages 345–356, 1993.
Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]
We present in this paper a structure–sharing framework originally developed for a Dynamic Programming interpreter of Logic Programs called DyALog. This mechanism should be of interest for alternative execution models of PROLOG which maintain multiple computation branches and reuse sub–computations in various contexts (computation sharing). This category includes, besides our Dynamic Programming model, the tabular models (OLDT, SLDAL, XWAM), the “magic-set” models, and the independent AND and OR parallelism with solution sharing models. These models raise the problem of storing vast amount of data, motivating us to discard copying mechanisms in favor of structure–sharing mechanisms. Unfortunately, computation sharing requires joining computation branches and possibly renaming some variables, which generally leads to complex structure–sharing mechanisms. The proposed “layer–sharing” framework succeeds however in remaining understandable and easy to implement.


[184]
How to build quickly an efficient implementation of the domain Prop with DyALog. In Proc. of the 5th workshop on Logic Programming Environments, ILPS'93, 1993.
Philippe Lefèbvre and Éric Villemonte de La Clergerie.
[BibTeX] [PS Compressed]
DyALog, a tabular logic program evaluator with a modular architecture, is used to develop quickly an efficient interpreter for logic programs with boolean constraints [CLP(Bool) programs]. This is done by a coupling DyALOg with PECOS, a constraint solver over finite domains. This experiment, done in the context of Abstract Interpretation of logic programs, illustrates the “genericity” of our approach for developing interpretations on various abstract domains and for various semantics.

Eric de la Clergerie
Home Page