Results 11  20
of
21
Partial Deduction System
 In Proc. of the ILPS'97 Workshop on Tools and Environments for (Constraint) Logic Programming, U.P
, 1997
"... We present the fully automatic partial deduction system ecce, which can be used to specialise and optimise logic programs. We describe the underlying principles of ecce and illustrate some of the potential application areas. Interesting possibilites of crossfertilisation with other fields such as r ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We present the fully automatic partial deduction system ecce, which can be used to specialise and optimise logic programs. We describe the underlying principles of ecce and illustrate some of the potential application areas. Interesting possibilites of crossfertilisation with other fields such as reachability analysis of concurrent systems and inductive theorem proving are highlighted and substantiated. 1 Introduction Program specialisation, also called partial evaluation or partial deduction, is an automatic technique for program optimisation. The central idea is to specialise a given source program for a particular application domain. Program specialisation encompasses traditional compiler optimisation techniques, such as constant folding and inlining, but uses more aggressive transformations, yielding both the possibility of obtaining (much) greater speedups and more difficulty in controlling the transformation process. In addition to achieving important speedups, program special...
Some Achievements and Prospects in Partial Deduction
 Electronic Section)(3es):4
, 1998
"... Interpretation ". Danny De Schreye is Senior Research Associate of the Fund for Scientific Research  Flanders Belgium. Authors' addresses: M. Leuschel, B. Martens and D. De Schreye, Departement Computerwetenschappen, K.U.Leuven, Celestijnenlaan 200A, B3001 Heverlee, Belgium. Email : ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Interpretation ". Danny De Schreye is Senior Research Associate of the Fund for Scientific Research  Flanders Belgium. Authors' addresses: M. Leuschel, B. Martens and D. De Schreye, Departement Computerwetenschappen, K.U.Leuven, Celestijnenlaan 200A, B3001 Heverlee, Belgium. Email : fmichael,bern,dannydg@cs.kuleuven.ac.be Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works, requires prior specific permission and/or a fee. Permissions may be requested from Publicati...
Constrained partial deduction
 Proceedings of the 12th Workshop Logische Programmierung (WLP'97
, 1997
"... Partial deduction based upon the Lloyd and Shepherdson framework generates a specialised program given a set of atoms. Each such atom represents all its instances. This can severely limit the specialisation potential of partial deduction. We therefore extend the precision the Lloyd and Shepherdson a ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Partial deduction based upon the Lloyd and Shepherdson framework generates a specialised program given a set of atoms. Each such atom represents all its instances. This can severely limit the specialisation potential of partial deduction. We therefore extend the precision the Lloyd and Shepherdson approach by integrating ideas from constraint logic programming. We formally prove correctness of this new framework of constrained partial deduction and illustrate its potential on some examples.
ABSTRACT QuasiTermination Analysis of Logic Programs Using SizeChange Graphs ∗
"... A logic program is quasiterminating when only a finite number of different calls—up to variable renaming—are derivable from any given goal. Ensuring the quasitermination of programs w.r.t. a class of goals is a relevant problem in several areas, like tabled evaluation or partial evaluation, where ..."
Abstract
 Add to MetaCart
A logic program is quasiterminating when only a finite number of different calls—up to variable renaming—are derivable from any given goal. Ensuring the quasitermination of programs w.r.t. a class of goals is a relevant problem in several areas, like tabled evaluation or partial evaluation, where quasitermination implies the full termination of the specialization process. In this work, we adapt the notion of sizechange graph to provide sufficient conditions for both termination and quasitermination of logic programs. Then, we illustrate the usefulness of our results by designing a simple partial evaluator of logic programs in which global termination is always ensured offline (i.e., statically). A prototype implementation demonstrates the viability of our approach.
Advanced Analysis and Specialization for Pervasive Systems Integrated Abstract Interpretation and Deliverable number: D4 Online Specialization
, 2003
"... Project funded by the European Community under the “Information Society Tech ..."
Abstract
 Add to MetaCart
Project funded by the European Community under the “Information Society Tech
Under consideration for publication in Theory and Practice of Logic Programming 1 Logic program specialisation through partial deduction: Control issues
"... Program specialisation aims at improving the overall performance of programs by performing source to source transformations. A common approach within functional and logic programming, known respectively as partial evaluation and partial deduction, is to exploit partial knowledge about the input. It ..."
Abstract
 Add to MetaCart
Program specialisation aims at improving the overall performance of programs by performing source to source transformations. A common approach within functional and logic programming, known respectively as partial evaluation and partial deduction, is to exploit partial knowledge about the input. It is achieved through a wellautomated application of parts of the BurstallDarlington unfold/fold transformation framework. The main challenge in developing systems is to design automatic control that ensures correctness, efficiency, and termination. This survey and tutorial presents the main developments in controlling partial deduction over the past 10 years and analyses their respective merits and shortcomings. It ends with an assessment of current achievements and sketches some remaining research challenges.
Infinite State Model Checking using Partial Evaluation and Abstract Interpretation
"... Interpretation Michael Leuschel Department of Electronics and Computer Science University of Southampton, Southampton SO17 1BJ Part 1: Previous Track Record Logic programming originated from the discovery that a subset of predicate logic could be given a procedural interpretation which was firs ..."
Abstract
 Add to MetaCart
Interpretation Michael Leuschel Department of Electronics and Computer Science University of Southampton, Southampton SO17 1BJ Part 1: Previous Track Record Logic programming originated from the discovery that a subset of predicate logic could be given a procedural interpretation which was first embodied in the programming language Prolog. The unique features of logic programming make it appealing for numerous applications in artificial intelligence, computeraided verification, databases, and operations research as well as to explore parallel and concurrent computing. The last two decades have witnessed substantial developments (not the least of which originated in the U.K.) in this field from its foundation to implementation, applications, and the exploration of new language designs.
Completeness of Partial Deduction for Coverability Problems of Petri Nets
, 2000
"... In recent work it has been shown that infinite state model checking can be performed by a combination of partial deduction of logic programs and abstract interpretation. This paper characterises some classes of problems which can be decided by this approach. In particular, we show that a restricted ..."
Abstract
 Add to MetaCart
In recent work it has been shown that infinite state model checking can be performed by a combination of partial deduction of logic programs and abstract interpretation. This paper characterises some classes of problems which can be decided by this approach. In particular, we show that a restricted form of partial deduction is already powerful enough to decide all coverability properties of Petri Nets. We also prove that two particular instances of partial deduction can be used to exactly compute the KarpMiller tree as well as Finkel's minimal coverability set. We thus establish a quite surprising link between algorithms for Petri nets and logic program specialisation.