M. Leuschel and D. De Schreye. Creating specialised integrity checks through partial evaluation of meta-interpreters. Technical Report CW 237, Departement Computerwetenschappen, K.U. Leuven, Belgium, July 1996. Submitted for Publication. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Homeomorphic Embedding for Online Termination - Leuschel (1998) (2 citations) (Correct)
.... under a particular encoding enc( if whenever it admits a sequence of calls o 1 ; o 2 ; o n then it also admits enc(o 1 ) enc(o 2 ) enc(o n ) Solving the representation problem then amounts to finding For a more detailed discussion we refer the reader to [21] 45] 22, 6] [37, 36, 33]. 20 an adequate wfo or wbr which is invariant under a given encoding and powerful enough at the object level (obviously the total relation with s t is a wqo which is invariant under any encoding enc( We conjecture (prove ) that Theta solves the representation problem for any vanilla ....
M. Leuschel and D. De Schreye. Creating specialised integrity checks through partial evaluation of meta-interpreters. The Journal of Logic Programming, 36:149-- 193, 1998.
Infinite State Model Checking using Partial Evaluation and.. - Leuschel (Correct)
.... and of code and search explosion, and efficiency gains have been obtained [17, 27, 21] Several fully automated systems (sp, sage, paddy, mixtus, ecce) as well as semi automated ones (logimix, leupel, logen) have been developed and successfully applied to at least medium size applications [25, 15]. 1 Another recent line of research has focussed on overcoming some of the inherent limitations of partial evaluation, 24] 26, 14] 23, 22] integrating ideas from constraint logic programming, unfold fold program transformation, and abstract interpretation respectively while keeping the ....
M. Leuschel and D. De Schreye. Creating specialised integrity checks through partial evaluation of meta-interpreters. The Journal of Logic Programming, 36(2):149--193, 1998.
Bottom-up Partial Deduction of Logic Programs - Vanhoof, De Schreye, Martens (1999) (1 citation) Self-citation (De schreye) (Correct)
....decisions, others control the specialisation process solely by observing characteristics of the program to be specialised. Partial deduction (and partial evaluation in general) has been applied to a lot of application domains, such as theorem proving (e.g. dG94] deductive databases (e.g. LD98] and compiler generation (e.g. JGS93] Perhaps the most noteworthy application domain of partial deduction is the specialisation of metainterpreters [LS90, SB89] Specialising a metainterpreter with respect to an object program thus removing the interpretation overhead always has been one of ....
M. Leuschel and D. De Schreye. Creating specialised integrity checks through partial evaluation of meta-interpreters. Journal of Logic Programming, 36(2):149-193, 1998.
Completeness of Partial Deduction for Coverability Problems.. - Leuschel, Lehmann (2000) Self-citation (Leuschel) (Correct)
....also define the set of leaves, leaves(#) to be the leaf goals of # . Given closedness (all leaves are an instance of an specialised atom) and independence (no two specialised atoms have a common instance) correctness of the specialised program is guaranteed [39] Independence is usually (e.g. [16, 34, 35, 10]) ensured by a renaming transformation. Closedness is more di#cult to ensure, but can be satisfied using the following generic algorithm based upon [41, 35] This algorithm structures the atoms to be specialised in a global tree: i.e. a tree whose nodes are labeled by atoms and where A is a ....
M. Leuschel and D. De Schreye. Creating specialised integrity checks through partial evaluation of meta-interpreters. The Journal of Logic Programming, 36(2):149-- 193, August 1998.
Efficient Specialisation in Prolog Using a Hand-Written.. - Leuschel, Jørgensen (1999) Self-citation (Leuschel) (Correct)
....predicate definition will be generated) Under the conditions stated in [52] namely closedness (all leaves are an instance of an atom in S) and independence (no two atoms in S have a common instance) correctness of the specialised program is guaranteed. In a lot of practical approaches (e.g. [18, 19, 21, 42, 45, 39, 49]) independence is ensured by using a renaming transformation which maps dependent atoms to new predicate symbols. Adapted correctness results can be found in [4] 49] and [46] Renaming is often combined with argument filtering to improve the efficiency of the specialised program (see e.g. 20, 4] ....
M. Leuschel and D. De Schreye. Creating specialised integrity checks through partial evaluation of meta-interpreters. The Journal of Logic Programming, 36(2):149--193, August 1998.
Homeomorphic Embedding for Online Termination - Leuschel (1998) (2 citations) Self-citation (Leuschel) (Correct)
....[struct(p; struct(q; Figure 4: A ground representation 10 Usually one does not use the representation p(var(1) a) because then one cannot use the function symbol var=1 at the object level. 11 For a more detailed discussion we refer the reader to [28] 54] 29, 7] [45, 44, 41]. solve(true) solve(A B) solve(A) solve(B) solve(H) clause(H; B) solve(B) Figure 5: The vanilla metainterpreter Of course, one is not restricted to just one level of meta interpretation; one can have a whole hierarchy of metainterpretation [19] where each layer adds its own ....
M. Leuschel and D. De Schreye. Creating specialised integrity checks through partial evaluation of meta-interpreters. The Journal of Logic Programming, 36(2):149--193, August 1998.
Advanced Techniques for Logic Program Specialisation - Leuschel (1997) (10 citations) (Correct)
No context found.
M. Leuschel and D. De Schreye. Creating specialised integrity checks through partial evaluation of meta-interpreters. Technical Report CW 237, Departement Computerwetenschappen, K.U. Leuven, Belgium, July 1996. Submitted for Publication.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC