Alberto Pettorossi, Maurizio Proietti  @ NUS Home/Search
Context
Related
| iasi.rm.cnr.it/~pr...Pro_ESSLLI00.ps.gz Cached: PS.gz PS PDF Image Update Help From: iasi.rm.cnr.it/~proiett...reports (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present the program transformation methodology for the automatic development of logic programs based on the rules + strategies approach. We consider both definite programs and normal programs and we present the basic transformation rules and strategies which are described in the literature. To illustrate the power of the program transformation approach we also give some examples of program development. Finally, we show how to use program transformations for proving properties of predicates... (Update)
Similar documents (at the sentence level):
18.7%: Perfect Model Checking via Unfold/Fold Transformations - Pettorossi, Proietti (2000) (Correct)
8.8%: Transformation of Logic Programs - Pettorossi, Proietti (1998) (Correct)
7.0%: Synthesis And Transformation Of Logic Programs Using.. - Pettorossi, Proietti (1997) (Correct)
Active bibliography (related documents): More All
3.7: Rules and Strategies for Transforming Functional and Logic.. - Pettorossi, Proietti (1996) (Correct)
2.5: Program Derivation = Rules + Strategies - Pettorossi, Proietti (2001) (Correct)
1.5: Developing Correct and Efficient Logic Programs by.. - Pettorossi, Proietti (1996) (Correct)
Similar documents based on text: More All
0.9: Transformations of Logic Programs with Goals as Arguments - Pettorossi, Proietti (2002) (Correct)
0.7: Derivation of Efficient Logic Programs by.. - Pettorossi, Proietti, .. (2002) (Correct)
0.7: Combining Logic Programs and Monadic Second Order.. - Fioravanti.. (Correct)
BibTeX entry: (Update)
@misc{ pettorossi-automatic,
author = "Alberto Pettorossi and Maurizio Proietti",
title = "Automatic Derivation of Logic Programs by Transformation",
url = "citeseer.comp.nus.edu.sg/380001.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987
759 Negation as failure (context) - Clark - 1978
725 Temporal and modal logic (context) - Emerson - 1990
638 Partial Evaluation and Automatic Program Generation (context) - Jones, Gomard et al. - 1993
392 A Computational Logic (context) - Boyer, Moore - 1979
385 A transformation system for developing recursive programs - Burstall, Darlington - 1977
347 Fast pattern matching in strings (context) - Knuth, Morris et al. - 1977
324 Deforestation: Transforming programs to eliminate trees - Wadler - 1990
266 Information and Computation (context) - Coquand, Huet et al. - 1988
241 Decidability of second-order theories and automata on in nit.. (context) - Rabin - 1969
224 Partial evaluation in logic programming (context) - Lloyd, Shepherdson - 1991
212 Abductive logic programming - Kakas, Kowalski et al. - 1992
180 Logic programming and negation: A survey - Apt, Bol - 1994
142 Tabled evaluation with delaying for general logic programs - Chen, Warren - 1996
139 fold transformation of logic programs (context) - Tamaki, Sato - 1984
138 Abstract Interpretation of Declarative Languages (context) - Abramsky, Hankin - 1987
129 Transformation of logic programs: Foundations and techniques (context) - Pettorossi, Proietti - 1994
121 Proving and applying program transformations expressed with .. (context) - Huet, Lang - 1978
104 Algebra of Programming (context) - Bird, De Moor - 1996
94 A deductive approach to program synthesis (context) - Manna, Waldinger - 1980
88 Model checking in CLP - Delzanno, Podelski - 1999
81 The promotion and accumulation strategies in transformationa.. (context) - Bird - 1984
79 Logic Programming: Systematic Program Development (context) - Deville - 1990
74 Computer Science Department (context) - Cai, Paige et al. - 1990
72 The Formal Semantics of Programming Languages: An Introducti.. (context) - Winskel - 1993
70 Average-case analysis of algorithms and data structures - Vitter, Flajolet - 1990
68 Proofs by induction in equational theories with constructors (context) - Huet, Hullot - 1982
67 Program transformation systems (context) - Partsch, Steinbrggen - 1983
64 Communications of the ACM (context) - Kowalski, Logic - 1979
62 the declarative and procedural semantics of logic programs - Przymusinski - 1989
58 Inductive assertion method for logic programs - Drabent, Mauszyski - 1988
57 The concept of a supercompiler (context) - Turchin - 1986
54 Rules and strategies for transforming functional and logic p.. - Pettorossi, Proietti - 1996
51 Automatic mode inference for logic programs - Debray, Warren - 1988
50 Derivation of logic programs (context) - Hogger - 1981
50 On proving inductive properties of abstract data types (context) - Musser - 1980
47 Continuation-based program transformation strategies (context) - Wand - 1980
46 Mixtus: An automatic partial evaluator for full Prolog (context) - Sahlin - 1993
44 Total correctness by local improvement in the transformation.. - Sands - 1996
44 The derivation of an algorithm for program specialisation (context) - Gallagher, Bruynooghe - 1991
43 Data Structures = Programs (context) - Wirth - 1976
42 Verifying correctness of logic programs (context) - Bossi, Cocco - 1989
40 Science of Computer Programming (context) - Smith, of et al. - 1985
38 Applying techniques to skeletons - Sterling, Kirschenbaum - 1993
37 Occam's razor in metacomputation: the notion of a perfect pr.. (context) - Glck, Klimov - 1993
36 Schema-based transformations of logic programs - Fuchs, Fromherz - 1992
35 ACM Transactions on Programming Languages and Systems (context) - Paige, Koenig et al. - 1982
34 Automatic proofs by induction in theories without constructo.. (context) - Jouannaud, Kounalis - 1989
32 Deduction revision by intelligent backtracking (context) - Bruynooghe, Pereira - 1984
32 A transformation system for deductive database modules with .. (context) - Maher - 1993
30 The synthesis of logic programs from inductive proofs (context) - Bundy, Smaill et al. - 1990
30 Reducing nondeterminism while specializing logic programs - Pettorossi, Proietti et al. - 1997
28 Logic program synthesis - Deville, Lau - 1994
28 Information and Computation (context) - Comon, Nieuwenhuis et al. - 1999
27 Mixed computation: Potential applications and problems for s.. (context) - Ershov - 1982
27 Equivalences and Transformations of Regular Systems Applic.. (context) - Courcelle - 1986
27 A synthesis of several sorting algorithms (context) - Darlington - 1978
27 Conjunctive partial deduction: Foundations (context) - De Schreye, Glck et al. - 1999
26 Correctness of a logic program transformation system (context) - Maher - 1987
25 Basic transformation operations which preserve computed answ.. (context) - Bossi, Cocco - 1993
24 Preservation of stronger equivalence in unfold/fold logic pr.. (context) - Kawamura, Kanamori - 1990
23 Transforming constraint logic programs (context) - Bensaou, Guessarian - 1994
23 Extracting logic programs from proofs that use extended Prol.. (context) - Fribourg - 1990
23 Semantics preserving transformation rules for Prolog (context) - Proietti, Pettorossi - 1991
22 Preserving universal termination through unfold/fold (context) - Bossi, Cocco - 1994
21 Comparative schematology (context) - Paterson, Hewitt - 1970
20 cient model checking using tabled resolution (context) - Ramakrishna, Ramakrishnan et al. - 1997
20 Lecture Notes in Computer Science (context) - Naish, Control - 1985
19 Proving theorems about Lisp functions - Boyer, Moore - 1975
19 Online partial deduction of large programs (context) - Prestwich - 1993
19 Composing Prolog meta-interpreters (context) - Sterling, Lakhotia - 1988
19 Synthesis of eureka predicates for developing logic programs (context) - Proietti, Pettorossi - 1990
18 Comparison of abstract interpretations (context) - Cortesi, Fil et al. - 1992
17 Synthesis by completion (context) - Dershowitz - 1985
17 fold transformations and loop optimization of logic programs (context) - Debray - 1988
16 Algebraic properties of program integration (context) - Reps - 1990
16 logic programs based on partial evaluation (context) - Brass, Dix et al. - 1999
16 ACM Transactions on Programming Languages and Systems (context) - Consel, Khoo et al. - 1993
16 The memory management of Prolog implementations (context) - Bruynooghe - 1982
16 Some techniques for recursion removal from recursive functio.. (context) - Arsac, Kodrato - 1982
15 A system for assisting program transformation (context) - Feather - 1982
15 Transformation rules for GHC programs - Ueda, Furukawa - 1988
15 Tutorial on specialization of logic programs (context) - Gallagher - 1993
15 Theoretical Computer Science (context) - Etalle, Gabbrielli et al. - 1996
15 Proofs as programs (context) - Bates, Constable - 1985
14 A generalized correctness proof of the unfold/fold logic pro.. (context) - Tamaki, Sato - 1986
14 volume 1110 of Lecture Notes in Computer Science (context) - Danvy, Glck et al. - 1996
14 Composing recursive logic programs with clausal join (context) - Lakhotia, Sterling - 1988
14 Skeletons and techniques for Prolog programming (context) - Kirschenbaum, Lakhotia et al. - 1989
14 Two exercises found in a book on algorithmics (context) - Bird, Meertens - 1987
14 Predicate logic: A calculus for deriving programs (context) - Clark, Sickel - 1977
13 Synthesis and transformation of logic programs using unfold .. - Pettorossi, Proietti - 1999
13 Program transformation by data structure mapping (context) - Trnlund - 1982
13 POPART: Producer of parser and related tools (context) - Wile - 1982
12 The use of metasystem transition in theorem proving and prog.. (context) - Turchin - 1980
12 Compiling associativity into logic programs (context) - Brough, Hogger - 1987
12 Synthesis of programs from unfold/fold proofs (context) - Proietti, Pettorossi - 1994
12 Specifying logic programs in controlled natural language - Fuchs, Schwitter - 1995
12 fold transformations of logic programs using extended OLDT-b.. (context) - Boulanger, Bruynooghe - 1993
12 Grammar-related transformations of logic programs (context) - Brough, Hogger - 1991
11 An algorithm for partial evaluation with constraints (context) - Fujita - 1987
11 Optimizing almost-tail-recursive Prolog programs (context) - Debray - 1985
11 Notes on transformation techniques for generate and test log.. (context) - Seki, Furukawa - 1987
11 A Semantic Approach to Automatic Program Improvement (context) - Darlington - 1972
11 Towards unifying partial evaluation (context) - Srensen, Glck et al. - 1994
11 A roadmap to metacomputation by supercompilation (context) - Glck, Srensen - 1996
10 the mechanics of metasystem hierarchies in program transform.. (context) - Glck - 1996
10 Towards the partial evaluation of CLP languages (context) - Hickey, Smith - 1991
10 Transformation of programs and use of tupling strategy (context) - Pettorossi - 1977
10 A technique for doing lazy evaluation in logic (context) - Narain - 1986
9 Proofs by program transformation - Roychoudhury, Kumar et al. - 1999
9 Department of Computer Science (context) - Engelfriet, Tree et al. - 1975
9 fold program transformation (context) - Kott - 1985
8 An experimental program transformation system (context) - Darlington - 1981
7 Source-to-source transformations of logic programs (context) - Bloch - 1984
6 Some achievements and prospects in partial deduction - Leuschel, Martens et al. - 1998
6 fold transformations of CCP programs (context) - Etalle, Gabbrielli et al. - 1998
6 Spes: A system for logic program transformation (context) - Alexandre, Bsaes et al. - 1992
5 a COMPrehensive Algebraic approach to System Speci cation an.. (context) - Krieg-Brckner, COMPASS - 1989
5 nition-folding (context) - Proietti, Pettorossi - 1995
5 The McCarthy's induction principle: `oldy' but `goody (context) - Kott - 1982
4 Abstract interpretation: A uni ed lattice model for static a.. (context) - Cousot, Cousot - 1977
4 Proof methods of declarative properties of logic programs (context) - Deransart - 1989
4 Recursion induction principle revisited (context) - Boudol, Kott - 1983
4 How powerful are folding / unfolding transformations (context) - Zhu - 1994
4 Compiling bottom-up and mixed derivations into top-down exec.. (context) - De Schreye, Martens et al. - 1991
3 Proving safety properties of in nite state systems by compil.. (context) - Fribourg, Olsn - 1997
3 rst order theory of data and programs (context) - Clark, Trnlund - 1977
3 Transition system speci cation with negative premises (context) - Groote - 1993
3 Schema-based tod-down design of logic programs using abstrac.. (context) - Marakakis, Gallagher - 1994
3 list transformation algorithm for Prolog programs (context) - Zhang - 1987
3 Special Issue of the Journal of Logic Programming on Abstrac.. (context) - Debray - 1992
3 fold transformation of strati ed programs (context) - Seki - 1991
3 Automating the design of algorithms (context) - Smith - 1993
3 Correctness of logic program transformation based on existen.. - Lau, Ornaghi et al. - 1995
2 Journal of Logic Programming (context) - Bruynooghe, De Schreye et al. - 1989
2 the generic development language Deva (context) - Sintzo, Weber et al. - 1989
2 A survey and classi cation of some program transformation te.. (context) - Feather - 1987
2 Deterministic transformation and deterministic synthesis (context) - Sato, Tamaki - 1988
2 Autolap: A system for transforming logic programs (context) - Aerts, Van Besien - 1991
2 Louvain-la-Neuve (context) - Galmiche, program et al. - 1991
2 TREQUASI: Un systme pour la transformation automatique de pr.. (context) - Azibi - 1987
2 nite clause programs (context) - Gergatsoulis, Katzouraki et al. - 1994
1 nite programs based on termination analysis (context) - Cook, Gallagher et al. - 1994
1 Static analysis for the synthesis of eureka properties for t.. (context) - Bsaes - 1992
1 Edinburgh University (context) - Burstall, project et al. - 1991
1 Derivation of logic programs from implicit de nition (context) - Kanamori, Maeji - 1986
1 Logic program synthesis from incomplete speci cations (context) - Flener, Deville - 1993
1 Lisp to Fortran program transformation applied (context) - Boyle - 1984
1 owchartable recursions (context) - Walker, Strong - 1972
1 Volume II: The Transformation System CIP-S (context) - Group, Project - 1987
1 Transforming inductive de nitions (context) - Proietti, Pettorossi - 1999
1 cation and Transformation of Programs (context) - Partsch - 1990
1 Lecture Notes of 12th ESSLLI School (context) - Hofmann, for - 2000
1 the transformation of logic programs with instantiation base.. (context) - De Schreye, Bruynooghe - 1989
Documents on the same site (http://www.iasi.rm.cnr.it/~proietti/reports.html): More
Program Specialization via Algorithmic Unfold/Fold.. - Pettorossi, Proietti (1998) (Correct)
Developing Correct and Efficient Logic Programs by.. - Pettorossi, Proietti (1996) (Correct)
Future Directions in Program Transformation - Pettorossi, Proietti (Correct)
Online articles have much greater impact More about CiteSeer.IST at NUS Add search form to your site Submit documents Feedback
CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.