Denis Lugiez

Publication Activity (10 Years)

Years Active: 1984-2017
Publications (10 Years): 1

Top Venues

FSTTCS

Grenoble Institute of Technology, France (PHD)

Education History

Grenoble Institute of Technology, France

PHD

Publications

Stéphane Demri, Étienne Lozes, Denis Lugiez
On Symbolic Heaps Modulo Permission Theories. FSTTCS (2017)
Denis Lugiez
Forward Analysis of Dynamic Network of Pushdown Systems is Easier without Order. Int. J. Found. Comput. Sci. 22 (4) (2011)
Stéphane Demri, Denis Lugiez
Complexity of modal logics with Presburger constraints. J. Appl. Log. 8 (3) (2010)
Stéphane Martin, Denis Lugiez
Fixing Collaborative Edition on Typed Documents. CDVE (2010)
Denis Lugiez
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order. RP (2009)
Denis Lugiez, Stéphane Martin
Peer to Peer Optimistic Collaborative Editing on XML-like trees CoRR (2009)
Stéphane Martin, Denis Lugiez
Collaborative peer to peer edition: Avoiding conflicts is better than solving conflicts. IADIS AC (2) (2009)
Stéphane Martin, Denis Lugiez
Research report : Collaborative Peer 2 Peer Edition: Avoiding Conflicts is Better than Solving Conflicts CoRR (2009)
Stéphanie Delaune, Pascal Lafourcade, Denis Lugiez, Ralf Treinen
Symbolic protocol analysis for monoidal equational theories. Inf. Comput. 206 (2-4) (2008)
Yannick Chevalier, Denis Lugiez, Michaël Rusinowitch
Verifying Cryptographic Protocols with Subterms Constraints. LPAR (2007)
Pascal Lafourcade, Denis Lugiez, Ralf Treinen
Intruder deduction for the equational theory of Abelian groups with distributive encryption. Inf. Comput. 205 (4) (2007)
Yannick Chevalier, Denis Lugiez, Michaël Rusinowitch
Towards an Automatic Analysis of Web Service Security. FroCoS (2007)
Stéphane Demri, Denis Lugiez
Presburger Modal Logic Is PSPACE-Complete. IJCAR (2006)
Stéphanie Delaune, Pascal Lafourcade, Denis Lugiez, Ralf Treinen
. ICALP (2) (2006)
Denis Lugiez, Peter Niebert, Sarah Zennou
A partial order semantics approach to the clock explosion problem of timed automata. Theor. Comput. Sci. 345 (1) (2005)
Denis Lugiez
Multitree automata that count. Theor. Comput. Sci. 333 (1-2) (2005)
Denis Lugiez, Philippe Schnoebelen
Decidable first-order transition logics for PA-processes. Inf. Comput. 203 (1) (2005)
Pascal Lafourcade, Denis Lugiez, Ralf Treinen
-Like Equational Theories with Homomorphisms. RTA (2005)
Denis Lugiez, Peter Niebert, Sarah Zennou
A Partial Order Semantics Approach to the Clock Explosion Problem of Timed Automata. TACAS (2004)
Denis Lugiez
From Automata to Semilinear Sets: A Logical Solution for Sets L(C, P). CIAA (2004)
Silvano Dal-Zilio, Denis Lugiez, Charles Meyssonnier
A logic you can count on. POPL (2004)
Denis Lugiez
Counting and Equality Constraints for Multitree Automata. FoSSaCS (2003)
Roberto M. Amadio, Denis Lugiez, Vincent Vanackère
On the symbolic reduction of processes with cryptographic functions. Theor. Comput. Sci. 290 (1) (2003)
Silvano Dal-Zilio, Denis Lugiez
XML Schema, Tree Logic and Sheaves Automata. RTA (2003)
Denis Lugiez, Peter Niebert, Sarah Zennou
Dynamic Bounds and Transition Merging for Local First Search. SPIN (2002)
Denis Lugiez, Philippe Schnoebelen
The regular viewpoint on PA-processes. Theor. Comput. Sci. 274 (1-2) (2002)
Peter Niebert, Michaela Huhn, Sarah Zennou, Denis Lugiez
Local First Search - A New Paradigm for Partial Order Reductions. CONCUR (2001)
Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez
Algorithms and Reductions for Rewriting Problems. Fundam. Informaticae 46 (3) (2001)
Denis Lugiez, Philippe Schnoebelen
Decidable First-Order Transition Logics for PA-Processes. ICALP (2000)
Roberto M. Amadio, Denis Lugiez
On the Reachability Problem in Cryptographic Protocols. CONCUR (2000)
Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez
Algorithms and Reductions for Rewriting Problems. RTA (1998)
Denis Lugiez, Philippe Schnoebelen
The Regular Viewpoint on PA-Processes. CONCUR (1998)
Denis Lugiez
A Good Class of Tree Automata and Application to Inductive Theorem Proving. ICALP (1998)
Ali Amaniss, Miki Hermann, Denis Lugiez
Set Operations for Recurrent Term Schematizations. TAPSOFT (1997)
Denis Lugiez
Positive and Negative Results for Higher-Order Disunification. J. Symb. Comput. 20 (4) (1995)
Denis Lugiez
Undecidability of second-order complement problems. UNIF (1995)
Denis Lugiez
Higher Order Disunification: Some decidable cases. CCL (1994)
Denis Lugiez, J. L. Moysset
Tree Automata Help One To Solve Equational Formulae In AC-Theories. J. Symb. Comput. 18 (4) (1994)
Denis Lugiez, J. L. Moysset
Complement Problems and Tree Automata in AC-like Theories (Extended Abstract). STACS (1993)
Hubert Comon, Denis Lugiez, Philippe Schnoebelen
A Rewrite-Based Type Discipline for a Subset of Computer Algebra. J. Symb. Comput. 11 (4) (1991)
Emmanuel Kounalis, Denis Lugiez
Compilation of Pattern Matching with Associative-Commutative Functions. TAPSOFT, Vol.1 (1991)
Emmanuel Kounalis, Denis Lugiez, Loic Pottier
A Solution of the Complement Problem in Associative-Commutative Theories. MFCS (1991)
Emmanuel Kounalis, Denis Lugiez, Loic Pottier
A Solution of the Complement Problem in Associative-Commutative Theories. IWWERT (1991)
Denis Lugiez
A Deduction Procedure for First Order Programs. ICLP (1989)
Jacques Calmet, Denis Lugiez
A knowledge-based system for computer algebra. SIGSAM Bull. 21 (1) (1987)
Jacques Calmet, Hubert Comon, Denis Lugiez
Type Inference Using Unification in Computer Algebra. AAECC (1986)
Denis Lugiez
Heuristic Bivariate Lifting. AAECC (1985)
Denis Lugiez
A New Lifting Process for the Multivariate Polynomial Factorization. EUROSAM (Computation) (1984)
Denis Lugiez
Multivariate polynomial factoring and detection of true factors. AAECC (1984)

Denis Lugiez.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Denis Lugiez