Hubert Comon - RankMe

56 papers A* 15A 3B 4Journal 17Unranked 12

Year	Rank	Type	Title / Venue / Authors
2020	A*	`conf`	Oracle Simulation: A Technique for Protocol Composition with Long Term Shared Secrets. CCS Hubert Comon, Charlie Jacomme, Guillaume Scerri
2017	A	`conf`	Formal Computational Unlinkability Proofs of RFID Protocols. CSF Hubert Comon, Adrien Koutsos
2017	J	`jnl`	Formal Computational Unlinkability Proofs of RFID Protocols. CoRR Hubert Comon, Adrien Koutsos
2005	J	`jnl`	Tree automata with one memory set constraints and cryptographic protocols. Theor. Comput. Sci. Hubert Comon, Véronique Cortier
2003	J	`jnl`	Deciding the confluence of ordered term rewrite systems. ACM Trans. Comput. Log. Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch
2003	J	`jnl`	Ground reducibility is EXPTIME-complete. Inf. Comput. Hubert Comon, Florent Jacquemard
2001	A*	`ed.`	Computer Aided Verification, 13th International Conference, CAV 2001, Paris, France, July 18-22, 2001, Proceedings CAV Gérard Berry, Hubert Comon, Alain Finkel
2001	—	`ed.`	Constraints in Computational Logics: Theory and Applications, International Summer School, CCL'99 Gif-sur-Yvette, France, September 5-8, 1999, Revised Lectures CCL Hubert Comon, Claude Marché, Ralf Treinen
2001	—	`ch.`	Inductionless Induction. Handbook of Automated Reasoning Hubert Comon
2001	A*	`conf`	The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time. FOCS Hubert Comon, Guillem Godoy, Robert Nieuwenhuis
2001	A*	`conf`	Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols. ICALP Hubert Comon, Véronique Cortier, John Mitchell
2000	B	`conf`	Flatness Is Not a Weakness. CSL Hubert Comon, Véronique Cortier
2000	J	`jnl`	Induction=I-Axiomatization+First-Order Consistency. Inf. Comput. Hubert Comon, Robert Nieuwenhuis
2000	J	`jnl`	Sequentiality, Monadic Second-Order Logic and Tree Automata. Inf. Comput. Hubert Comon
1999	J	`jnl`	A Methodological View of Constraint Solving. Constraints An Int. J. Hubert Comon, Mehmet Dincbas, Jean-Pierre Jouannaud, Claude Kirchner
1999	—	`conf`	Constraint Solving on Terms. CCL Hubert Comon, Claude Kirchner
1999	B	`conf`	Timed Automata and the Theory of Real Numbers. CONCUR Hubert Comon, Yan Jurski
1998	—	`conf`	About Proofs by Consistency (Abstract). RTA Hubert Comon
1998	J	`jnl`	Completion of Rewrite Systems with Membership Constraints. Part I: Deduction Rules. J. Symb. Comput. Hubert Comon
1998	J	`jnl`	Completion of Rewrite Systems with Membership Constraints. Part II: Constraint Solving. J. Symb. Comput. Hubert Comon
1998	A*	`conf`	Decision Problems in Ordered Rewriting. LICS Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch
1998	A*	`conf`	Multiple Counters Automata, Safety Analysis and Presburger Arithmetic. CAV Hubert Comon, Yan Jurski
1997	A*	`conf`	Ground Reducibility is EXPTIME-Complete. LICS Hubert Comon, Florent Jacquemard
1997	B	`conf`	Higher-Order Matching and Tree Automata. CSL Hubert Comon, Yan Jurski
1997	—	`ed.`	Rewriting Techniques and Applications, 8th International Conference, RTA-97, Sitges, Spain, June 2-5, 1997, Proceedings RTA Hubert Comon
1997	J	`jnl`	The First-Order Theory of Lexicographic Path Orderings is Undecidable. Theor. Comput. Sci. Hubert Comon, Ralf Treinen
1996	—	`conf`	Diophantine Equations, Presburger Arithmetic and Finite Automata. CAAP Alexandre Boudet, Hubert Comon
1995	—	`conf`	Linear diophantine equations, Presburger arithmetic and finite automata. UNIF Hubert Comon
1995	J	`jnl`	On Unification of Terms with Integer Exponents. Math. Syst. Theory Hubert Comon
1995	A*	`conf`	Orderings, AC-Theories and Symbolic Constraint Solving (Extended Abstract) LICS Hubert Comon, Robert Nieuwenhuis, Albert Rubio
1995	A*	`conf`	Sequentiality, Second Order Monadic Logic and Tree Automata LICS Hubert Comon
1995	—	`ed.`	Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course Term Rewriting Hubert Comon, Jean-Pierre Jouannaud
1994	—	`conf`	Constraints in Term Algebras: An Overview of Constraint Solving Techniques Constraint Programming Hubert Comon
1994	J	`jnl`	Equational Formulae with Membership Constraints Inf. Comput. Hubert Comon, Catherine Delor
1994	A	`conf`	Ground Reducibility and Automata with Disequality Constraints. STACS Hubert Comon, Florent Jacquemard
1994	—	`conf`	Ordering Constraints on Trees. CAAP Hubert Comon, Ralf Treinen
1994	A*	`conf`	Pumping, Cleaning and Symbolic Constraints Solving. ICALP Anne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard
1994	J	`jnl`	Syntacticness, Cycle-Syntacticness, and Shallow Theories Inf. Comput. Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud
1993	—	`conf`	About the Theory of Tree Embedding. TAPSOFT Alexandre Boudet, Hubert Comon
1993	J	`jnl`	Complete Axiomatizations of Some Quotient Term Algebras. Theor. Comput. Sci. Hubert Comon
1993	—	`conf`	Constraints in Term Algebras (Short Survey). AMAST Hubert Comon
1992	A*	`conf`	Completion of Rewrite Systems with Membership Constraints. ICALP Hubert Comon
1992	A*	`conf`	Decidable Problems in Shallow Equational Theories (Extended Abstract) LICS Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud
1992	B	`conf`	Negation Elimination in Equational Formulae. MFCS Hubert Comon, Maribel Fernández
1991	J	`jnl`	A Rewrite-Based Type Discipline for a Subset of Computer Algebra. J. Symb. Comput. Hubert Comon, Denis Lugiez, Philippe Schnoebelen
1991	A*	`conf`	Complete Axiomatizations of Some Quotient Term Algebras. ICALP Hubert Comon
1991	—	`conf`	Disunification: A Survey. Computational Logic - Essays in Honor of Alan Robinson Hubert Comon
1990	A*	`conf`	Equational Formulas in Order-Sorted Algebras. ICALP Hubert Comon
1990	A*	`conf`	Solving Inequations in Term Algebras (Extended Abstract) LICS Hubert Comon
1990	J	`jnl`	Solving Symbolic Ordering Constraints. Int. J. Found. Comput. Sci. Hubert Comon
1989	J	`jnl`	Equational Problems and Disunification. J. Symb. Comput. Hubert Comon, Pierre Lescanne
1989	—	`conf`	Inductive Proofs by Specification Transformation. RTA Hubert Comon
1988	—	`conf`	An Effective Method for Handling Initial Algebras. ALP Hubert Comon
1988	—	`—`	Unification et disunification : théorie et applications. (Unification and disunification in free algebras and in initial algebras : theory and applications). Hubert Comon
1986	A	`conf`	Sufficient Completness, Term Rewriting Systems and "Anti-Unification". CADE Hubert Comon
1986	—	`conf`	Type Inference Using Unification in Computer Algebra. AAECC Jacques Calmet, Hubert Comon, Denis Lugiez