2011

Modular Termination and Combinability for Superposition Modulo Counter Arithmetic, FroCoS 2011, Saarbrücken, Germany, October 2011.

Improving Reachability Analysis of Infinite-State Systems by Specialization, LIFC, Université de Franche-Comté, France.

Improving Reachability Analysis of Infinite-State Systems by Specialization, Reachability Problems 2011, Genova, Italy, September 2011.

Using Real Relaxations During Program Specialization, LOPSTR 2011, Odense, Denmark, July 18-20, 2011.

Modular Termination and Combinability for Superposition Modulo Counter Arithmetic, FTP 2011, Bern, Switzerland, July 4, 2011.

Program Specialization for Verifying Infinite State Systems, MT-lab Centre of Exellence, Danish Technical University, Copenhagen, Denmark, March 2011. Abstract

2010

Optimizing Test Generation Programs, meeting CASSIS, Val d'Ajol, France, September 2010.

Program Transformation for Verification and Synthesis, LARA group, EPFL, August 23, 2010, Lausanne, Switzerland.

Program Transformation for Verification and Synthesis, LORIA and INRIA Grand Est, May 27, 2010, Nancy, France.

2008

A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs, ICLP'08, December 9-13, 2008, Udine, Italy.

Transformation Techniques for Constraint Logic Programs with Applications to Protocol Verification, PhD defense, Department of Computer Science, Systems, and Production of the University of Rome "Tor Vergata", Italy, May 28, 2008, Rome, Italy.