Denis Lugiez

Denis Lugiez: Forward Analysis of Dynamic Network of Pushdown Systems is Easier without Order. Int. J. Found. Comput. Sci. 22(4): 843-862 (2011)

Stéphane Demri, Denis Lugiez: Complexity of modal logics with Presburger constraints. J. Applied Logic 8(3): 233-252 (2010)

Stéphane Martin, Denis Lugiez: Fixing Collaborative Edition on Typed Documents. CDVE 2010: 19-26

Stéphane Martin, Denis Lugiez: Collaborative peer to peer edition: Avoiding conflicts is better than solving conflicts. IADIS AC (2) 2009: 124-128

Denis Lugiez: Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order. RP 2009: 127-140

Denis Lugiez, Stéphane Martin: Peer to Peer Optimistic Collaborative Editing on XML-like trees. CoRR abs/0901.4201 (2009)

Stéphane Martin, Denis Lugiez: Research report : Collaborative Peer 2 Peer Edition: Avoiding Conflicts is Better than Solving Conflicts. CoRR abs/0911.0838 (2009)

Stéphanie Delaune, Pascal Lafourcade, Denis Lugiez, Ralf Treinen: Symbolic protocol analysis for monoidal equational theories. Inf. Comput. 206(2-4): 312-351 (2008)

Pascal Lafourcade, Denis Lugiez, Ralf Treinen: Intruder deduction for the equational theory of Abelian groups with distributive encryption. Inf. Comput. 205(4): 581-623 (2007)

Yannick Chevalier, Denis Lugiez, Michaël Rusinowitch: Towards an Automatic Analysis of Web Service Security. FroCoS 2007: 133-147

Yannick Chevalier, Denis Lugiez, Michaël Rusinowitch: Verifying Cryptographic Protocols with Subterms Constraints. LPAR 2007: 181-195

Stéphane Demri, Denis Lugiez: Presburger Modal Logic Is PSPACE-Complete. IJCAR 2006: 541-556

Stéphanie Delaune, Pascal Lafourcade, Denis Lugiez, Ralf Treinen: Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or. ICALP (2) 2006: 132-143

Denis Lugiez, Ph. Schnoebelen: Decidable first-order transition logics for PA-processes. Inf. Comput. 203(1): 75-113 (2005)

Denis Lugiez: Multitree automata that count. Theor. Comput. Sci. 333(1-2): 225-263 (2005)

Denis Lugiez, Peter Niebert, Sarah Zennou: A partial order semantics approach to the clock explosion problem of timed automata. Theor. Comput. Sci. 345(1): 27-59 (2005)

Pascal Lafourcade, Denis Lugiez, Ralf Treinen: Intruder Deduction for AC-Like Equational Theories with Homomorphisms. RTA 2005: 308-322

Silvano Dal-Zilio, Denis Lugiez, Charles Meyssonnier: A logic you can count on. POPL 2004: 135-146

Denis Lugiez, Peter Niebert, Sarah Zennou: A Partial Order Semantics Approach to the Clock Explosion Problem of Timed Automata. TACAS 2004: 296-311

Denis Lugiez: From Automata to Semilinear Sets: A Logical Solution for Sets L(C, P). CIAA 2004: 321-322

Roberto M. Amadio, Denis Lugiez, Vincent Vanackère: On the symbolic reduction of processes with cryptographic functions. Theor. Comput. Sci. 290(1): 695-740 (2003)

Denis Lugiez: Counting and Equality Constraints for Multitree Automata. FoSSaCS 2003: 328-342

Silvano Dal-Zilio, Denis Lugiez: XML Schema, Tree Logic and Sheaves Automata. RTA 2003: 246-263

Roberto M. Amadio, Denis Lugiez (Eds.): CONCUR 2003 - Concurrency Theory, 14th International Conference, Marseille, France, September 3-5, 2003, Proceedings. Lecture Notes in Computer Science 2761, Springer 2003, isbn 3-540-40753-7

Denis Lugiez, Ph. Schnoebelen: The regular viewpoint on PA-processes. Theor. Comput. Sci. 274(1-2): 89-115 (2002)

Denis Lugiez, Peter Niebert, Sarah Zennou: Dynamic Bounds and Transition Merging for Local First Search. SPIN 2002: 221-229

Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez: Algorithms and Reductions for Rewriting Problems. Fundam. Inform. 46(3): 257-276 (2001)

Peter Niebert, Michaela Huhn, Sarah Zennou, Denis Lugiez: Local First Search - A New Paradigm for Partial Order Reductions. CONCUR 2001: 396-410

Roberto M. Amadio, Denis Lugiez: On the Reachability Problem in Cryptographic Protocols. CONCUR 2000: 380-394

Denis Lugiez, Ph. Schnoebelen: Decidable First-Order Transition Logics for PA-Processes. ICALP 2000: 342-353

Denis Lugiez, Ph. Schnoebelen: The Regular Viewpoint on PA-Processes. CONCUR 1998: 50-66

Denis Lugiez: A Good Class of Tree Automata and Application to Inductive Theorem Proving. ICALP 1998: 409-420

Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez: Algorithms and Reductions for Rewriting Problems. RTA 1998: 166-180

Ali Amaniss, Miki Hermann, Denis Lugiez: Set Operations for Recurrent Term Schematizations. TAPSOFT 1997: 333-344

Denis Lugiez: Positive and Negative Results for Higher-Order Disunification. J. Symb. Comput. 20(4): 431-470 (1995)

Denis Lugiez, J. L. Moysset: Tree Automata Help One To Solve Equational Formulae In AC-Theories. J. Symb. Comput. 18(4): 297-318 (1994)

Denis Lugiez: Higher Order Disunification: Some decidable cases. CCL 1994: 121-135

Denis Lugiez, J. L. Moysset: Complement Problems and Tree Automata in AC-like Theories (Extended Abstract). STACS 1993: 515-524

Hubert Comon, Denis Lugiez, Ph. Schnoebelen: A Rewrite-Based Type Discipline for a Subset of Computer Algebra. J. Symb. Comput. 11(4): 349-368 (1991)

Emmanuel Kounalis, Denis Lugiez, Loic Pottier: A Solution of the Complement Problem in Associative-Commutative Theories. IWWERT 1991: 197-214

Emmanuel Kounalis, Denis Lugiez, Loic Pottier: A Solution of the Complement Problem in Associative-Commutative Theories. MFCS 1991: 287-297

Emmanuel Kounalis, Denis Lugiez: Compilation of Pattern Matching with Associative-Commutative Functions. TAPSOFT, Vol.1 1991: 57-73

Denis Lugiez: A Deduction Procedure for First Order Programs. ICLP 1989: 585-599

Jacques Calmet, Hubert Comon, Denis Lugiez: Type Inference Using Unification in Computer Algebra. AAECC 1986: 25-28

Denis Lugiez: Heuristic Bivariate Lifting. AAECC 1985: 385-391

Denis Lugiez: Multivariate polynomial factoring and detection of true factors. AAECC 1984: 169-177

Denis Lugiez: A New Lifting Process for the Multivariate Polynomial Factorization. EUROSAM 1984: 297-309