Manolis Gergatsoulis, Maria Katzouraki. Unfold/fold Transformations for definite clause Programs. In M. Hermenegildo, and J. Penjam (eds.), Proceedings of the International Conference on Programming Language Implementation and Logic Programming (PLILP' 94), Lecture Notes in Computer Science, Vol. 844, pp. 340-354, Springer-Verlag, 1994.

CITATIONS

  1. Alberto Pettorossi, Maurizio Proietti, and Valerio Senni. Constraint-based correctness proofs for logic program transformations. Formal Aspects of  Computing, 24(4-6):569-594, 2012.

  2. Hirohisa Seki. On Inductive Proofs by Extended Unfold/Fold Transformation Rules. In M. Alpuente (Ed.): Logic-Based Program Synthesis and Transformation - 20th International Symposium, LOPSTR 2010, Hagenberg, Austria, July 23-25, 2010, Revised Selected Papers. Lecture Notes in Computer Science, Volume 6564,  pp. 117–132, Springer 2011.

  3. Manuel Hernández. A Taxonomy of Some Right-to-Left String-Matching Algorithms. In Santiago Escobar (Ed.): Functional and Constraint Logic Programming, 18th International Workshop, WFLP 2009, Brasilia, Brazil, June 28, 2009, Revised Selected Papers. Lecture Notes in Computer Science, Vol. 5979, pages 79-95, Springer 2010.

  4. Emmanouil Marakakis, Kostas Vassilakis, Nikos Papadakis. A Tool for Removing Unused Arguments from Logic Programs Automatically. International Journal on Artificial Intelligence Tools (IJAIT), 19(1):39-63, 2010.

  5. Manuel Hernández. A Taxonomy of Some Right-to-Left String-Matching Algorithms. In Santiago Escobar (ed.), Functional and (Constraint) Logic Programming, 18th International Workshop, WFLP' 09 (part of the Federated Conference on Rewriting, Deduction, and Programming (RDP' 09)), (Informal Proceedings) pages 45-62, Brasilia, Brazil, June 28, 2009.

  6. Valerio Senni. Transformation Techniques for Constraint Logic Programs with Applications to Protocol Verification. Ph.D .Thesis. University of Roma "Tor Vergata", Italy, 2008.

  7. Javier Álvez, Paqui Lucio. A Generalization of the Folding Rule for the Clark-Kunen Semantics. In J. Garrigue and M.Hermenegildo (eds.), Functional and Logic Programming, 9th International Symposium, FLOPS 2008, Ise, Japan, April 14-16, 2008, Proceedings, Lecture Notes in Computer Science, Volume 4989, pages 180-194, Springer-Verlag 2008.

  8. Alberto Pettorossi, Maurizio Proietti. Totally Correct Logic Program Transformations Via Well-Founded Annotations. Higher-Order and Symbolic Computation, 21(1-2):193-235, June 2008.

  9. Alberto Pettorossi, Maurizio Proietti, and Valerio Senni. Automatic Correctness Proofs for Logic Program Transformations.  In V. Dahl and I. Niemelä (eds.), Logic Programming, 23rd International Conference, ICLP 2007, Porto, Portugal, September 8-13, 2007, Proceedings, Lecture Notes in Computer Science, Volume 4670, pages 364-379, Springer-Verlag 2007.

  10. David Rosenblueth. A multiple-clause folding rule using instantiation and generalization. Fundamenta Informaticae, 69(1-2):219-249, 2006.

  11. Petros Potikas. Program transformations in deductive databases using Intensional Logic Programming. Ph.D. Thesis. Department of Electrical and Computer Engineering National Technical University of Athens (NTUA), Greece, June 2006.

  12. Alberto Pettorossi, Maurizio Proietti, Sophie Renault. Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism. Higher-Order and Symbolic Computation,  18(1-2):121-210, Special Issue in memory of Bob Paige, 2005.

  13. Alberto Pettorossi, Maurizio Proietti. A Theory of Totally Correct Logic Program Transformations. In Nevin Heintze and Peter Sestoft (eds.), Proceedings of the 2004 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation, 2004, Verona, Italy, August 24-25, 2004, pages 159-168, ACM 2004.

  14. Alberto Pettorossi, Maurizio Proietti. Totally Correct Logic Program Transformations Using Well-Founded Annotations. In Elio Panegai and Gianfranco Rossi (eds.), Proceedings of the Italian Conference on Computational Logic (CILC '04), June16-17, 2004, Parma, Italy, pages 325-329, 2004.

  15. Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan. An Unfold/Fold Transformation Framework for Definite Logic Programs. ACM Transactions on Programming Languages  and Systems (TOPLAS), 26(3):464-509, 2004.

  16. Abhik Roychoudhury, C. R. Ramakrishnan. Unfold/Fold Transformation for Automatic Verification of Parameterized Concurrent Systems.  In Maurice Bruynooghe and Kung-Kiu Lau (eds.), Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development, Lecture Notes in Computer Science, Volume 3049, pages 261-290, Springer-Verlag 2004.

  17. Fabio Fioravanti,  Alberto Pettorossi, Maurizio Proietti. Transformation Rules for Locally Stratified Constraint Logic Programs. In Maurice Bruynooghe and Kung-Kiu Lau (eds.), Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development, Lecture Notes in Computer Science, Volume 3049, pages 291-339, Springer-Verlag 2004.

  18. Manuel Hernández Gutiérrez. Transformatión de programas lógicos: algoritmos de casamiento de cadenas. Tesis  que para obtener el grado de Doctor en Sciencias, Universidad National Autónoma de México, Junio de 2003.

  19.  Fabio Fioravanti,  Alberto Pettorossi, Maurizio Proietti. A Specialization Technique For Deriving Deterministic Constraint Logic Programs and Its Application to Pattern Matching.  In Proceedings of AGP'02, 2002 Joint Conference on Declarative Programming, pages 241-257, Madrid, Spain,16 - 18 September 2002.

  20. Fabio Fioravanti,  Alberto Pettorossi, Maurizio Proietti. Specialization with Clause Splitting For Deriving Deterministic Constraint Logic Programs.  In Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics (SMC'02), Volume 1, pages 188-193, Hammamet, Tunisia, 6 - 9 October, 2002, IEEE Computer Society Press 2002.

  21. Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan. Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs. International Journal on Foundations of Computer Science, 13(3):387-403, 2002.

  22. Manuel Hernandez, David A. Rosenblueth. Development reuse and the logic programming derivation of two string-matching algorithms. In Proceedings of 3rd ACM SIGPLAN International Conference on Principle and Practice of Declarative Programming, pages 38-48, Florence, Italy, 2001. ACM Press.

  23. Abhik Roychoudhury. Program Transformations for Verifying Parameterized Concurrent Systems. Ph.D. Thesis. Department of Computer Science, State University of New York at Stony Brook, USA, December 2000.

  24. Alberto Pettorossi, Maurizio Proietti. Automatic Derivation of Logic Programs by Transformation. Lecture notes of the 2000 European Summer School on Logic, Language and Information (ESSLLI' 2000), Birmingham U. K., 6-18 August, 2000.

  25. Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan. Beyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs. In P. S. Thiagarajan and Roland H. C. Yap (eds.), Advances in Computing Science - ASIAN'99, 5th Asian Computing Science Conference, Phuket, Thailand, December 10-12, 1999, Proceedings, Lecture Notes in Compute Science, Volume 1742, pages 322-333, Springer-Verlag 1999.

  26.  Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan. A Parameterized Unfold/Fold Transformation Framework for Definite Clause Programs. In Gopalan Nadathur (ed.), Principles and Practice of Declarative Programming, International Conference PPDP'99, Paris, France, September 29 - October 1, 1999, Proceedings, Lecture Notes in Compute Science, Volume 1702, pages 396-413, Springer-Verlag 1999.

  27. Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan. Proofs by Program Transformation. In Pre-Proceedings of Logic-Program Synthesis and Transformation (LOPSTR'99), 1999.

  28. Alberto Pettorossi, Maurizio Proietti. Synthesis and Transformation of Logic Programs using Unfold/Fold Proofs. Journal of Logic Programming, 41(2 & 3):197-230, November 1999.

  29. Alberto Pettorossi, Maurizio Proietti. Transformation of Logic Programs. In D. Gabbay, C. J. Hogger, and J. A. Robinson (eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 5, pages 697-787, Oxford University Press, 1998.

  30. Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I. V. Ramakrishnan. A Generalized Unfold/Fold Transformation System for Definite Logic Programs. Technical Report 98/37. Department of Computer Science, SUNY at Stony Brook, December 1998.

  31. Alberto Pettorossi, Maurizio Proietti, Sophie Renault. Reducing Mondeterminism while Specializing Logic Programs. In Proceedings of the 24th Annual ACM Symposium on Principles of Programming Languages, pages 414-427, Paris, France, January 15-17, ACM Press 1997.

  32. Alberto Pettorossi, Maurizio Proietti, Sophie Renault. Enhancing Partial Deduction via Unfold/Fold Rules. In J. Gallagher (ed.) Proceedings of the Sixth International Workshop on Logic Program Synthesis and Transformation (LOPSTR'96), Lecture Notes in Computer Science, vol. 1207, pages 146-168, Springer-Verlag, 1997.

  33. Henning Niss. An Unfold/Fold Framework for First-Order Hereditary Harrop Formulas: Transformations and Correctness Proofs. Master Thesis. Department of Computer Science, University of Copenhagen (DIKU), August 1997.

  34. Alberto Pettorossi, Maurizio Proietti. Synthesis and Transformation of Logic Programs using Unfold/Fold Proofs. Technical report, R. 457. IASI-CNR, Roma, Italy, June 1997.

  35. Kung-Kiu Lau, Mario Ornaghi, Alberto Pettorossi, Maurizio Proietti. Correctness of Logic Program Transformations Based on Existential Termination. In J. W. Lloyd (ed.), Logic Programming: Proceedings of the 1995 International Symposium, pages 480-494, MIT Press 1995.