| 2010 | CDVE | Fixing Collaborative Edition on Typed Documents. | Stphane Martin, Denis Lugiez |
| 2007 | LPAR | Verifying Cryptographic Protocols with Subterms Constraints. | Yannick Chevalier, Denis Lugiez, Michal Rusinowitch |
| 2006 | CADE | Presburger Modal Logic Is PSPACE-Complete. | Stphane Demri, Denis Lugiez |
| 2006 | ICALP | Symbolic Protocol Analysis in Presence of a Homomorphism Operator and | Stphanie Delaune, Pascal Lafourcade, Denis Lugiez, Ralf Treinen |
| 2004 | POPL | A logic you can count on. | Silvano Dal-Zilio, Denis Lugiez, Charles Meyssonnier |
| 2004 | TACAS | A Partial Order Semantics Approach to the Clock Explosion Problem of Timed Automata. | Denis Lugiez, Peter Niebert, Sarah Zennou |
| 2003 | FOSSACS | Counting and Equality Constraints for Multitree Automata. | Denis Lugiez |
| 2001 | CONCUR | Local First Search - A New Paradigm for Partial Order Reductions. | Peter Niebert, Michaela Huhn, Sarah Zennou, Denis Lugiez |
| 2000 | CONCUR | On the Reachability Problem in Cryptographic Protocols. | Roberto M. Amadio, Denis Lugiez |
| 2000 | ICALP | Decidable First-Order Transition Logics for PA-Processes. | Denis Lugiez, Philippe Schnoebelen |
| 1998 | CONCUR | The Regular Viewpoint on PA-Processes. | Denis Lugiez, Philippe Schnoebelen |
| 1998 | ICALP | A Good Class of Tree Automata and Application to Inductive Theorem Proving. | Denis Lugiez |
| 1993 | STACS | Complement Problems and Tree Automata in AC-like Theories (Extended Abstract). | Denis Lugiez, J. L. Moysset |
| 1991 | MFCS | A Solution of the Complement Problem in Associative-Commutative Theories. | Emmanuel Kounalis, Denis Lugiez, Loic Pottier |
| 1989 | ICLP | A Deduction Procedure for First Order Programs. | Denis Lugiez |