Denis Lugiez

According to our database1, Denis Lugiez authored at least 44 papers between 1984 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
On Symbolic Heaps Modulo Permission Theories.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2011
Forward Analysis of Dynamic Network of Pushdown Systems is Easier without Order.
Int. J. Found. Comput. Sci., 2011

2010
Complexity of modal logics with Presburger constraints.
J. Appl. Log., 2010

Fixing Collaborative Edition on Typed Documents.
Proceedings of the Cooperative Design, Visualization, and Engineering, 2010

2009
Research report : Collaborative Peer 2 Peer Edition: Avoiding Conflicts is Better than Solving Conflicts
CoRR, 2009

Peer to Peer Optimistic Collaborative Editing on XML-like trees
CoRR, 2009

Collaborative peer to peer edition: Avoiding conflicts is better than solving conflicts.
Proceedings of the IADIS International Conference Applied Computing 2009, 2009

2008
Symbolic protocol analysis for monoidal equational theories.
Inf. Comput., 2008

2007
Intruder deduction for the equational theory of Abelian groups with distributive encryption.
Inf. Comput., 2007

Verifying Cryptographic Protocols with Subterms Constraints.
Proceedings of the Logic for Programming, 2007

Towards an Automatic Analysis of Web Service Security.
Proceedings of the Frontiers of Combining Systems, 6th International Symposium, 2007

2006
Symbolic Protocol Analysis in Presence of a Homomorphism Operator and <i>Exclusive Or</i>.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Presburger Modal Logic Is PSPACE-Complete.
Proceedings of the Automated Reasoning, Third International Joint Conference, 2006

2005
A partial order semantics approach to the clock explosion problem of timed automata.
Theor. Comput. Sci., 2005

Multitree automata that count.
Theor. Comput. Sci., 2005

Decidable first-order transition logics for PA-processes.
Inf. Comput., 2005

Intruder Deduction for <i>AC</i>-Like Equational Theories with Homomorphisms.
Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

2004
From Automata to Semilinear Sets: A Logical Solution for Sets L(C, P).
Proceedings of the Implementation and Application of Automata, 2004

A logic you can count on.
Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2004

2003
On the symbolic reduction of processes with cryptographic functions.
Theor. Comput. Sci., 2003

XML Schema, Tree Logic and Sheaves Automata.
Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

Counting and Equality Constraints for Multitree Automata.
Proceedings of the Foundations of Software Science and Computational Structures, 2003

2002
The regular viewpoint on PA-processes.
Theor. Comput. Sci., 2002

Dynamic Bounds and Transition Merging for Local First Search.
Proceedings of the Model Checking of Software, 2002

2001
Algorithms and Reductions for Rewriting Problems.
Fundam. Informaticae, 2001

Local First Search - A New Paradigm for Partial Order Reductions.
Proceedings of the CONCUR 2001, 2001

2000
On the Reachability Problem in Cryptographic Protocols.
Proceedings of the CONCUR 2000, 2000

1998
A Good Class of Tree Automata and Application to Inductive Theorem Proving.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997
Set Operations for Recurrent Term Schematizations.
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

1995
Positive and Negative Results for Higher-Order Disunification.
J. Symb. Comput., 1995

Undecidability of second-order complement problems.
Proceedings of the 9th International Workshop on Unification, 1995

1994
Tree Automata Help One To Solve Equational Formulae In AC-Theories.
J. Symb. Comput., 1994

Higher Order Disunification: Some decidable cases.
Proceedings of the Constraints in Computational Logics, First International Conference, 1994

1993
Complement Problems and Tree Automata in AC-like Theories (Extended Abstract).
Proceedings of the STACS 93, 1993

1991
A Rewrite-Based Type Discipline for a Subset of Computer Algebra.
J. Symb. Comput., 1991

Compilation of Pattern Matching with Associative-Commutative Functions.
Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

A Solution of the Complement Problem in Associative-Commutative Theories.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

1989
A Deduction Procedure for First Order Programs.
Proceedings of the Logic Programming, 1989

1987
A knowledge-based system for computer algebra.
SIGSAM Bull., 1987

1986
Type Inference Using Unification in Computer Algebra.
Proceedings of the Applied Algebra, 1986

1985
Heuristic Bivariate Lifting.
Proceedings of the Algebraic Algorithms and Error-Correcting Codes, 1985

1984
Algorithmes de factorisation de polynômes. (Algorithms for factoring polynomials).
PhD thesis, 1984

A New Lifting Process for the Multivariate Polynomial Factorization.
Proceedings of the EUROSAM 84, 1984

Multivariate polynomial factoring and detection of true factors.
Proceedings of the Applied Algebra, 1984


  Loading...