A. Pettorossi and M. Proietti. A Theory of Logic Program Specialization and Generalization for Dealing with Input Data Properties. In Proc. of the 1996 Dagstuhl Seminar on Partial Evaluation, LNCS 1110: 386-408. Springer-Verlag, Berlin, 1996.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... that we specialize this program for the call (applast ys z) last (append ys (z:nil) which appends an element z at the end of a given list ys and then returns the last element, z, of the resulting list (the example is borrowed from DPPD library of benchmarks [24] and was also considered in [23, 33] for logic program specialization) Commonly, the optimized program Work partially supported by CICYT TIC2001 2705 C03 01, Acciones Integradas HI2000 0161, HA2001 0059, HU2001 0019, and Generalitat Valenciana GV01 424. which can be obtained by using an automatic specializer of functional ....

A. Pettorossi and M. Proietti. A Theory of Logic Program Specialization and Generalization for Dealing with Input Data Properties. In Proc. of the 1996 Dagstuhl Seminar on Partial Evaluation, LNCS 1110: 386-408. Springer-Verlag, Berlin, 1996.

....a more efficient program which behaves as the original one on the considered subdomain. In the field of logic programming, the narrowed context is usually described by means of a set of queries of interest. Specialisation methods are based on the idea of partially evaluating program clauses [5, 16, 20, 21] with respect to this set of queries. The goal is to detect clauses which are redundant in the restricted context, or to specialise them preventing costly failing derivations. If the original program is correct with respect to a pre post specification [4, 9, 10, 2] and the considered queries ....

A. Pettorossi and M. Proietti. A theory of logic program specialization and generalization for dealing with input data properties. In Proceedings of Partial Evaluation, International Seminar, volume 1110 of Lecture Notes in Computer Science. Springer-Verlag, 1996.

....and for automatic specializations based on the parameterized strategy presented in Section 2.5. The MAP system is described in Appendix A. The source code for the examples can be found in Appendix B. There are various methods for specializing programs w.r.t. properties of their input data [10, 16, 53, 61, 66]. Contextual specialization can be viewed as one of these methods. In this chapter we have presented a set of transformation rules and an automated strategy for the contextual specialization of constraint logic programs over a domain For our specialization strategy we have assumed the existence ....

PETTOROSSI, A., AND PROIETTI, M. A theory of logic program special- ization and generalization for dealing with input data properties. In Pro- ceedings of the Dagstuhl Seminar on Partial Evaluation (1996), O. Danvy, R. Gliick, and P. Thiemann, Eds., Lecture Notes in Computer Science 1110, Springer-Verlag, pp. 386-408.

....instead of a single value. Indeed, our specialization method belongs to a family of methods which can be used for the specialization of programs w.r.t. properties of their context of use. Among these methods we would like to mention: i) the methods for specializing logic programs presented in [2,15], ii) the method for multiple specialization of logic programs presented in [19] iii) the method for reducing the workload of the constraint solving engine presented in [14] and (iv) the method for parameterized partial evaluation of functional programs presented in [3] In [2,15] the authors ....

.... presented in [2,15] ii) the method for multiple specialization of logic programs presented in [19] iii) the method for reducing the workload of the constraint solving engine presented in [14] and (iv) the method for parameterized partial evaluation of functional programs presented in [3] In [2,15] the authors present very general approaches to the specialization of definite logic programs w.r.t. properties which, however, do not seem to be amenable to full mechanization. In particular, most of the basic trans11 Fioravanti, Pettorossi, and Proietti formation rules introduced in [2] cannot ....

A. Pettorossi and M. Proietti. A theory of logic program specialization and generalization for dealing with input data properties. In O. Danvy, R. Gluck, and P. Thiemann, editors, Proceedings of the Dagstuhl Seminar on Partial Evaluation, Lecture Notes in Computer Science 1110, pages 386--408. SpringerVerlag, 1996.

....instead of a single value. Indeed, our specialization method belongs to a family of methods which can be used for the specialization of programs w.r.t. properties of their context of use. Among these methods we would like to mention: i) the methods for specializing logic programs presented in [2, 14], ii) the method for multiple specialization of logic programs based on abstract interpretation presented in [18] and (iii) the method for parameterized partial evaluation of functional programs presented in [3] In [2, 14] the authors present very general approaches to the specialization of ....

.... to mention: i) the methods for specializing logic programs presented in [2, 14] ii) the method for multiple specialization of logic programs based on abstract interpretation presented in [18] and (iii) the method for parameterized partial evaluation of functional programs presented in [3] In [2, 14] the authors present very general approaches to the specialization of logic programs w.r.t. properties which, however, do not seem to be amenable to full mechanization. In particular, most of the basic transformation rules introduced in [2] cannot be easily automated because their applicability ....

A. Pettorossi and M. Proietti. A theory of logic program specialization and generalization for dealing with input data properties. In O. Danvy, R. Glck, and P. Thiemann, editors, Proceedings of the Dagstuhl Seminar on Partial Evaluation, Lecture Notes in Computer Science 1110, pages 386408. Springer-Verlag, 1996.

....in nite set of values, instead of a single value. Indeed, our specialization method belongs to the family of methods for the specialization of program w.r.t. properties of the context. Among these, we would like to mention: 1) the methods for specializing logic programs presented in [2] and [16] and (2) the method for parametrized partial evaluation of functional programs presented in [4] The works [2] and [16] present very general approaches which, however, do not seem to be amenable to full mechanization. In particular, in [2] most of the basic transformation rules cannot be easily ....

....for the specialization of program w.r.t. properties of the context. Among these, we would like to mention: 1) the methods for specializing logic programs presented in [2] and [16] and (2) the method for parametrized partial evaluation of functional programs presented in [4] The works [2] and [16] present very general approaches which, however, do not seem to be amenable to full mechanization. In particular, in [2] most of the basic transformation rules cannot be easily automated because their applicability conditions depend on undecidable properties of the programs to be transformed. In ....

A. Pettorossi and M. Proietti. A theory of logic program specialization and generalization for dealing with input data properties. In O. Danvy, R. Gluck, and P. Thiemann, editors, Proceedings of the Dagstuhl Seminar on Partial Evaluation, Lecture Notes in Computer Science 1110, pages 386-408. Springer-Verlag, 1996.

....and disjunctions of goals (instead of atomic goals only) by incorporating more powerful transformation rules [34, 43] and ii) to specialize programs w.r.t. a class of input data satisfying some properties (instead of particular input data) by using either more powerful transformation rules [4, 42] (possibly based on theorem proving techniques) or abstract interpretation [24] 5 Program Transformation and Logic based Software Engineering: Achievements and Future Developments In the previous sections we have presented through some simple examples, some techniques for logic program ....

A. Pettorossi and M. Proietti. A theory of logic program specialization and generalization for dealing with input data properties. In Proceedings of the Dagstuhl Seminar on Partial Evaluation. Springer-Verlag, 1996. (To appear).

.... traversals of data structures, vi) UDF [Proietti and Pettorossi 1995] which eliminates unnecessary data structures from logic programs, vii) the strategy proposed in [Pettorossi et al. 1997] which avoids redundant nondeterminism while specializing logic programs, and (viii) the techniques of [Pettorossi and Proietti 1996] for specializing programs when their context of use is given by properties, rather than values, of the input data. We believe that an important topic for research in the forthcoming years is the development of a unifying framework for comparing, combining, and extending the above mentioned ....

Pettorossi, A. and Proietti, M. 1996. A theory of logic program specializationand generalization for dealing with input data properties. In O. Danvy, R. Gl uck, and P. Thiemann Eds., Partial Evaluation, Lecture Notes in Computer Science 1110 (1996), pp. 386--408. Springer-Verlag.

No context found.

A. Pettorossi and M. Proietti. A theory of logic program specialization and generalization for dealing with input data properties. In Proceedings of Partial Evaluation, International Seminar, volume 1110 of Lecture Notes in Computer Science. Springer-Verlag, 1996.

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