1. Paolo Pilozzi and Danny De Schreye. Improved termination analysis of CHR using self-sustainability analysis. In German Vidal, editor, LOPSTR '11: 21st Intl. Symp. Logic-Based Program Synthesis and Transformation, Revised Selected Papers, Lecture Notes in Computer Science, 2011. Keyword(s): termination. [bibtex-entry]



2. Paolo Pilozzi and Danny De Schreye. Scaling termination proofs by a characterization of cycles in CHR. In Peter Schneider-Kamp, editor, 11th International Workshop on Termination, Edinburgh, United Kingdom, July 2010. Keyword(s): termination. [bibtex-entry]



3. Paolo Pilozzi, Tom Schrijvers, and Maurice Bruynooghe. A transformational approach for proving properties of the CHR constraint store. In Danny De Schreye, editor, LOPSTR '09: 19th Intl. Symp. Logic-Based Program Synthesis and Transformation, Revised Selected Papers, volume 6037 of Lecture Notes in Computer Science, pages 22-36, 2010. Springer-Verlag. [doi:10.1007/978-3-642-12592-8_3] Keyword(s): termination. [Abstract] [bibtex-entry]



4. Paolo Pilozzi. Automating termination proofs for CHR. In Patricia M. Hill and David S. Warren, editors, ICLP '09: Proc. 25th Intl. Conf. Logic Programming, volume 5649 of Lecture Notes in Computer Science, pages 504-508, July 2009. Springer-Verlag. [doi:10.1007/978-3-642-02846-5_43] Keyword(s): termination. [bibtex-entry]



5. Paolo Pilozzi. Proving termination by invariance relations. In Patricia M. Hill and David S. Warren, editors, ICLP '09: Proc. 25th Intl. Conf. Logic Programming, volume 5649 of Lecture Notes in Computer Science, pages 499-503, July 2009. Springer-Verlag. [doi:10.1007/978-3-642-02846-5_42] Keyword(s): termination. [bibtex-entry]



6. Paolo Pilozzi. Research Summary: Termination of CHR. In Patricia M. Hill and David S. Warren, editors, ICLP '09: Proc. 25th Intl. Conf. Logic Programming, volume 5649 of Lecture Notes in Computer Science, pages 534-535, July 2009. Springer-Verlag. [doi:10.1007/978-3-642-02846-5_51] Keyword(s): termination. [bibtex-entry]



7. Paolo Pilozzi and Danny De Schreye. Termination Analysis of CHR Revisited. In M. Garcìa de la Banda and E. Pontelli, editors, ICLP '08: Proc. 24rd Intl. Conf. Logic Programming, volume 5366 of Lecture Notes in Computer Science, pages 501-515, December 2008. Springer-Verlag. [doi:10.1007/978-3-540-89982-2_43] Keyword(s): termination. [Abstract] [bibtex-entry]



8. Paolo Pilozzi and Danny De Schreye. Termination Analysis of CHR revisited. In T. Schrijvers, F. Raiser, and T. Frühwirth, editors, CHR '08: Proc. 5th Workshop on Constraint Handling Rules, pages 35-50, 2008. RISC Report Series 08-10, University of Linz, Austria. [PDF] Keyword(s): CHR 2008, termination, CHR 2008, CHR 2008. [Abstract] [bibtex-entry]



9. Dean Voets, Paolo Pilozzi, and Danny De Schreye. A new approach to termination analysis of CHR. In M. Hanus, editor, LOPSTR '08: 18th Intl. Symp. Logic-Based Program Synthesis and Transformation, Pre-Proceedings, 2008. [WWW] [PDF] Keyword(s): termination. [Abstract] [bibtex-entry]



10. Paolo Pilozzi, Tom Schrijvers, and Danny De Schreye. Proving termination of CHR in Prolog: A transformational approach. In WST '07: 9th Intl. Workshop on Termination, June 2007. Keyword(s): termination. [bibtex-entry]



11. Dean Voets, Paolo Pilozzi, and Danny De Schreye. A new approach to termination analysis of Constraint Handling Rules. In K. Djelloul, G. J. Duck, and M. Sulzmann, editors, CHR '07: Proc. 4th Workshop on Constraint Handling Rules, pages 77-89, September 2007. [PDF] Keyword(s): CHR 2007, termination, CHR 2007, CHR 2007. [Abstract] [bibtex-entry]

1. Paolo Pilozzi and Danny De Schreye. Scaling termination proofs by a characterization of cycles in CHR. Technical report CW 541, K.U.Leuven, Department of Computer Science, Leuven, Belgium, April 2009. [WWW] Keyword(s): termination . [Abstract] [bibtex-entry]



2. Dean Voets, Paolo Pilozzi, and Danny De Schreye. A new approach to termination analysis of CHR. Technical report CW 506, K.U.Leuven, Department of Computer Science, Leuven, Belgium, January 2008. [WWW] Keyword(s): termination. [Abstract] [bibtex-entry]



3. Paolo Pilozzi, Tom Schrijvers, and Danny De Schreye. Proving termination of CHR in Prolog: A transformational approach. Technical report CW 487, K.U.Leuven, Department of Computer Science, Leuven, Belgium, April 2007. [WWW] Keyword(s): termination. [Abstract] [bibtex-entry]

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

The contents of this webpage is provided by the authors stated below. KU Leuven is not bound by the information provided. It is possible that the information is not or no longer completely accurate. Where necessary, the authors can adjust and update faulty information. The authors have taken all reasonable care to ensure that all information available on this website is accurate at the time of publication and on the basis of the current state of knowledge. KU Leuven nor the authors are responsible for the content of any links to external organisations that are referred to on this website.

• Peter Van Weert [home, mail]
• Jon Sneyers [home, mail]
• Tom Schrijvers [home, mail]
• Leslie De Koninck

This document was translated from BibT_EX by bibtex2html