Denis Lugiez

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