Publications of S. Renault

This page shows all publications that appeared in the IASI annual research reports. Authors currently affiliated with the Institute are always listed with the full name.

You can browse through them using either the links of the following line or those associated with author names.

Show all publications of the year  ALL, with author Renault S., in the category ALL (or show them all):   (Items found: 9)


2008 | 2005 | 2003 | 2001 | 1998 | 1997 | 1996

2008  [top]
  • Alberto Pettorossi, Maurizio Proietti, Renault S.: Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism, Henglein F., Danvy O., Pettorossi A., Mairson H. eds., Automatic Program Development, Springer Heidelberg, 130-177, 2008

2005  [top]

2003  [top]

2001  [top]

1998  [top]

1997  [top]
  • Alberto Pettorossi, Maurizio Proietti, Renault S.: Enhancing Partial Deduction via Unfold/Fold Rules, in the Proceedings of Logic Program Synthesis and Transformation, 6th International Workshop, Stockholm, Sweden, Gallagher J. ed., Lecture Notes in Computer Science, 1207, Springer-Verlag, 147-168, 1997
  • Alberto Pettorossi, Maurizio Proietti, Renault S.: Reducing Nondeterminism while Specializing Logic Programs, in the Proceedings of 24th ACM Symposium on Principles of Programming Languages, La Sorbonne, Paris, France, SIGPLAN Notices, 1997

1996  [top]
  • Alberto Pettorossi, Maurizio Proietti, Renault S.: How to Extend Partial Deduction to Derive the KMP String-Matching Algorithm from a Naive Specification, in the Proceedings of Joint International Conference and Symposium on Logic Programming, Bonn, Germany, Maher M. ed., Logic Programming Series, 1996
  • Alberto Pettorossi, Maurizio Proietti, Renault S.: Enhancing Partial Deduction via Unfold/Fold Rules, in the Proceedings of Logic Program Synthesis and Transformation, Proceedings LOPSTR '96, Stockholm, Sweden., Gallagher J. ed., 101-112, 1996
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -