Research

Interests: program verification, static analysis, termination, non-termination, partial correctness, logic programming, constraints, constraint logic programming
My DBLP entry, thanks to Michael Ley
Some papers available on-line
Top 10 of my most cited papers, according to Google Scholar
Designer and developper of cTI, the first tool for inferring universal left termination conditions of ISO-Prolog. The latest sources are available here.
Some links about Prolog
Some research prototypes

Julia + BinTerm, an automatic termination prover for Java and Java bytecode:

2009:
- Java Bytecode: Julia arrives second official url local copy
- Java Bytecode Recursive: Julia arrives first official url local copy

Conferences:
VLP'99, PC member. JFPLC'01, PC member. JFPLC'02, PC member. JFPLC'03, PC member. WLPE'03, co-organizer and PC co-chair. WST'04, PC member. JFPLC'04, PC chair, proceedings, cover. JNPC'04, PC member. WLPE'04, PC member. JFPC'05, PC member. LOPSTR'05, PC member. WLPE'05, PC member. JFPC'06, PC member. WLPE'06, PC member. LOPSTR'06, PC member. CSTVA'06, PC member. JFPC'07, PC member. ACM SAC - SV'08, PC member. LOPSTR'09, PC member.
Cooperation:
- Roberto Bagnara, Università degli studi di Parma, Italy, PPL
- Ulrich Neumerkel, T. U. Wien, Austria, GUPU
- Salvatore Ruggieri, Università di Pisa, Italy, CLPT
- Alexander Serebrenik, T. U. Eindhoven, the Netherlands
- Fausto Spoto, Università di Verona, Italy, Java Bytecode analyzers for nullness and termination