Publications : Hubert COMON

[CJS20]

H. Comon, C. Jacomme, and G. Scerri. Oracle simulation: a technique for protocol composition with long term shared secrets. In Proceedings of the 27th ACM Conference on Computer and Communications Security (CCS'20), pages 1427--1444, Orlando, USA, November 2020. ACM Press.
doi: 10.1145/3372297.3417229.
[ BibTex | DOI ]

[CK17]

H. Comon and A. Koutsos. Formal Computational Unlinkability Proofs of RFID Protocols. In Proceedings of the 30th IEEE Computer Security Foundations Symposium (CSF'17), pages 100--114, Santa Barbara, California, USA, August 2017. IEEE Computer Society Press.
doi: 10.1109/CSF.2017.9.
[ BibTex | DOI | Web page | PDF ]

[CCD17]

V. Cheval, H. Comon-Lundh, and S. Delaune. A procedure for deciding symbolic equivalence between sets of constraint systems. Information and Computation, 255:94--125, 2017.
doi: 10.1016/j.ic.2017.05.004.
[ BibTex | DOI | Web page ]

[BC14]

G. Bana and H. Comon-Lundh. A Computationally Complete Symbolic Attacker for Equivalence Properties. In Proceedings of the 21st ACM Conference on Computer and Communications Security (CCS'14), pages 609--620, Scottsdale, Arizona, USA, November 2014. ACM Press.
doi: 10.1145/2660267.2660276.
[ BibTex | DOI | Web page | PDF ]

[BCD14]

S. Bursuc, H. Comon-Lundh, and S. Delaune. Deducibility constraints and blind signatures. Information and Computation, 238:106--127, November 2014.
doi: 10.1016/j.ic.2014.07.006.
[ BibTex | DOI | Web page | PDF ]

[CCS13]

H. Comon-Lundh, V. Cortier, and G. Scerri. Tractable inference systems: an extension with a deducibility predicate. In Proceedings of the 24th International Conference on Automated Deduction (CADE'13), volume 7898 of Lecture Notes in Artificial Intelligence, pages 91--108, Lake Placid, New York, USA, June 2013. Springer.
doi: 10.1007/978-3-642-38574-2_6.
[ BibTex | DOI | Web page | PDF ]

[CD12]

H. Comon-Lundh and S. Delaune. Formal Security Proofs. In Software Safety and Security, volume 33 of NATO Science for Peace and Security Series -- D: Information and Communication Security, pages 26--63. IOS Press, May 2012.
[ BibTex | Web page | PDF ]

[CHKS12]

H. Comon-Lundh, M. Hagiya, Y. Kawamoto, and H. Sakurada. Computational Soundness of Indistinguishability Properties without Computable Parsing. In Proceedings of the 8th International Conference on Information Security Practice and Experience (ISPEC'12), volume 7232 of Lecture Notes in Computer Science, pages 63--79, Hangzhou, China, April 2012. Springer.
doi: 10.1007/978-3-642-29101-2_5.
[ BibTex | DOI | Web page | PDF ]

[BC12]

G. Bana and H. Comon-Lundh. Towards Unconditional Soundness: Computationally Complete Symbolic Attacker. In Proceedings of the 1st International Conference on Principles of Security and Trust (POST'12), volume 7215 of Lecture Notes in Computer Science, pages 189--208, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28641-4_11.
[ BibTex | DOI | Web page | PDF ]

[CCS12]

H. Comon-Lundh, V. Cortier, and G. Scerri. Security proof with dishonest keys. In Proceedings of the 1st International Conference on Principles of Security and Trust (POST'12), volume 7215 of Lecture Notes in Computer Science, pages 149--168, Tallinn, Estonia, March 2012. Springer.
doi: 10.1007/978-3-642-28641-4_9.
[ BibTex | DOI | Web page | PDF ]

[CCD11]

V. Cheval, H. Comon-Lundh, and S. Delaune. Trace Equivalence Decision: Negative Tests and Non-determinism. In Proceedings of the 18th ACM Conference on Computer and Communications Security (CCS'11), pages 321--330, Chicago, Illinois, USA, October 2011. ACM Press.
doi: 10.1145/2046707.2046744.
[ BibTex | DOI | Web page | PDF ]

[CC11]

H. Comon-Lundh and V. Cortier. How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones. In Proceedings of the 28th Annual Symposium on Theoretical Aspects of Computer Science (STACS'11), volume 9 of Leibniz International Proceedings in Informatics, pages 29--44, Dortmund, Germany, March 2011. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2011.29.
[ BibTex | DOI | Web page | PDF ]

[CDM11]

H. Comon-Lundh, S. Delaune, and J. K. Millen. Constraint solving techniques and enriching the model with equational theories. In Formal Models and Techniques for Analyzing Security Protocols, volume 5 of Cryptology and Information Security Series, pages 35--61. IOS Press, 2011.
[ BibTex | Web page | PDF ]

[CCD10]

V. Cheval, H. Comon-Lundh, and S. Delaune. Automating security analysis: symbolic equivalence of constraint systems. In Proceedings of the 5th International Joint Conference on Automated Reasoning (IJCAR'10), volume 6173 of Lecture Notes in Artificial Intelligence, pages 412--426, Edinburgh, Scotland, UK, July 2010. Springer-Verlag.
doi: 10.1007/978-3-642-14203-1_35.
[ BibTex | DOI | Web page | PDF ]

[CCZ10]

H. Comon-Lundh, V. Cortier, and E. Zălinescu. Deciding security properties for cryptographic protocols. Application to key cycles. ACM Transactions on Computational Logic, 11(2), January 2010.
doi: 10.1145/1656242.1656244.
[ BibTex | DOI | Web page | PDF ]

[BDC09]

S. Bursuc, S. Delaune, and H. Comon-Lundh. Deducibility constraints. In Proceedings of the 13th Asian Computing Science Conference (ASIAN'09), volume 5913 of Lecture Notes in Computer Science, pages 24--38, Seoul, Korea, December 2009. Springer.
doi: 10.1007/978-3-642-10622-4_3.
[ BibTex | DOI | Web page | PS | PDF ]

[CCD09]

V. Cheval, H. Comon-Lundh, and S. Delaune. A decision procedure for proving observational equivalence. In Preliminary Proceedings of the 7th International Workshop on Security Issues in Coordination Models, Languages and Systems (SecCo'09), Bologna, Italy, October 2009.
[ BibTex | Web page | PDF ]

[ABC09]

M. Abadi, B. Blanchet, and H. Comon-Lundh. Models and Proofs of Protocol Security: A Progress Report. In Proceedings of the 21st International Conference on Computer Aided Verification (CAV'09), volume 5643 of Lecture Notes in Computer Science, pages 35--49, Grenoble, France, June-July 2009. Springer.
doi: 10.1007/978-3-642-02658-4_5.
[ BibTex | DOI | Web page | PDF ]

[BC09a]

S. Bursuc and H. Comon-Lundh. Protocol security and algebraic properties: decision results for a bounded number of sessions. In Proceedings of the 20th International Conference on Rewriting Techniques and Applications (RTA'09), volume 5595 of Lecture Notes in Computer Science, pages 133--147, Brasília, Brazil, June-July 2009. Springer.
doi: 10.1007/978-3-642-02348-4_10.
[ BibTex | DOI | Web page | PDF ]

[AC09]

R. Affeldt and H. Comon-Lundh. Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables. In Formal to Practical Security, volume 5458 of Lecture Notes in Computer Science, pages 1--20. Springer, May 2009.
doi: 10.1007/978-3-642-02002-5_1.
[ BibTex | DOI | Web page | PDF ]

[BC09b]

S. Bursuc and H. Comon-Lundh. Protocols, insecurity decision and combination of equational theories. Research Report LSV-09-02, Laboratoire Spécification et Vérification, ENS Cachan, France, February 2009. 43 pages.
[ BibTex | Web page | PDF ]

[Com08a]

H. Comon-Lundh. About models of security protocols. In Proceedings of the 28th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'08), volume 2 of Leibniz International Proceedings in Informatics, Bangalore, India, December 2008. Leibniz-Zentrum für Informatik.
[ BibTex | Web page | PDF ]

[CC08]

H. Comon-Lundh and V. Cortier. Computational Soundness of Observational Equivalence. In Proceedings of the 15th ACM Conference on Computer and Communications Security (CCS'08), pages 109--118, Alexandria, Virginia, USA, October 2008. ACM Press.
doi: 10.1145/1455770.1455786.
[ BibTex | DOI | Web page | PDF ]

[Com08b]

H. Comon-Lundh. Challenges in the Automated Verification of Security Protocols. In Proceedings of the 4th International Joint Conference on Automated Reasoning (IJCAR'08), volume 5195 of Lecture Notes in Artificial Intelligence, pages 396--409, Sydney, Australia, August 2008. Springer-Verlag.
doi: 10.1007/978-3-540-71070-7_34.
[ BibTex | DOI | Web page | PDF ]

[CJP08]

H. Comon-Lundh, F. Jacquemard, and N. Perrin. Visibly Tree Automata with Memory and Constraints. Logical Methods in Computer Science, 4(2:8), June 2008.
doi: 10.2168/LMCS-4(2:8)2008.
[ BibTex | DOI | Web page | PDF ]

[BC08]

V. Bernat and H. Comon-Lundh. Normal proofs in intruder theories. In Revised Selected Papers of the 11th Asian Computing Science Conference (ASIAN'06), volume 4435 of Lecture Notes in Computer Science, pages 151--166, Tokyo, Japan, January 2008. Springer.
doi: 10.1007/978-3-540-77505-8_12.
[ BibTex | DOI | Web page | PDF ]

[CDG⁺07]

H. Comon-Lundh, M. Dauchet, R. Gilleron, C. Löding, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. November 2007.
[ BibTex | Web page ]

[BCD07b]

S. Bursuc, H. Comon-Lundh, and S. Delaune. Deducibility Constraints, Equational Theory and Electronic Money. In Rewriting, Computation and Proof --- Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of his 60th Birthday, volume 4600 of Lecture Notes in Computer Science, pages 196--212, Cachan, France, June 2007. Springer.
doi: 10.1007/978-3-540-73147-4_10.
[ BibTex | DOI | Web page | PS ]

[CJP07]

H. Comon-Lundh, F. Jacquemard, and N. Perrin. Tree Automata with Memory, Visibility and Structural Constraints. In Proceedings of the 10th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'07), volume 4423 of Lecture Notes in Computer Science, pages 168--182, Braga, Portugal, March 2007. Springer.
doi: 10.1007/978-3-540-71389-0_13.
[ BibTex | DOI | Web page | PDF ]

[BCD07a]

S. Bursuc, H. Comon-Lundh, and S. Delaune. Associative-Commutative Deducibility Constraints. In Proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science (STACS'07), volume 4393 of Lecture Notes in Computer Science, pages 634--645, Aachen, Germany, February 2007. Springer.
doi: 10.1007/978-3-540-70918-3_54.
[ BibTex | DOI | Web page | PS | PDF ]

[Com07]

H. Comon-Lundh. Soundness of abstract cryptography, 2007. Course notes (part 1), Symposium on Cryptography and Information Security (SCIS2008), Tokai, Japan.
[ BibTex | Web page | PDF ]

[CD05]

H. Comon-Lundh and S. Delaune. The finite variant property: How to get rid of some algebraic properties. In Proceedings of the 16th International Conference on Rewriting Techniques and Applications (RTA'05), volume 3467 of Lecture Notes in Computer Science, pages 294--307, Nara, Japan, April 2005. Springer.
doi: 10.1007/b135673.
[ BibTex | DOI | Web page | PS | PDF ]

[CC05]

H. Comon and V. Cortier. Tree Automata with One Memory, Set Constraints and Cryptographic Protocols. Theoretical Computer Science, 331(1):143--214, February 2005.
doi: 10.1016/j.tcs.2004.09.036.
[ BibTex | DOI | Web page | PS ]

[BCC⁺04]

V. Bernat, H. Comon-Lundh, V. Cortier, S. Delaune, F. Jacquemard, P. Lafourcade, Y. Lakhnech, and L. Mazaré. Sufficient conditions on properties for an automated verification: theoretical report on the verification of protocols for an extended model of the intruder. Technical Report 4, projet RNTL PROUVÉ, December 2004. 33 pages.
[ BibTex | Web page | PS ]

[CC04]

H. Comon-Lundh and V. Cortier. Security Properties: Two Agents are Sufficient. Science of Computer Programming, 50(1-3):51--71, March 2004.
[ BibTex | Web page | PS ]

[Com04]

H. Comon-Lundh. Intruder Theories (Ongoing Work). In Proceedings of the 7th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'04), volume 2987 of Lecture Notes in Computer Science, pages 1--4, Barcelona, Spain, March 2004. Springer. Invited talk.
[ BibTex ]

[CJ03]

H. Comon and F. Jacquemard. Ground Reducibility is EXPTIME-complete. Information and Computation, 187(1):123--153, November 2003.
[ BibTex | Web page | PS | PDF ]

[CC03a]

H. Comon-Lundh and V. Cortier. New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols. In Proceedings of the 14th International Conference on Rewriting Techniques and Applications (RTA'03), volume 2706 of Lecture Notes in Computer Science, pages 148--164, Valencia, Spain, June 2003. Springer.
[ BibTex | Web page | PS ]

[CS03b]

H. Comon-Lundh and V. Shmatikov. Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive Or. In Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science (LICS'03), pages 271--280, Ottawa, Canada, June 2003. IEEE Computer Society Press.
[ BibTex ]

[CC03b]

H. Comon-Lundh and V. Cortier. Security properties: two agents are sufficient. In Proceedings of the 12th European Symposium on Programming (ESOP'03), volume 2618 of Lecture Notes in Computer Science, pages 99--113, Warsaw, Poland, April 2003. Springer.
[ BibTex | Web page | PS ]

[CT03]

H. Comon-Lundh and R. Treinen. Easy Intruder Deductions. In Verification: Theory and Practice, Essays Dedicated to Zohar Manna on the Occasion of His 64th Birthday, volume 2772 of Lecture Notes in Computer Science, pages 225--242. Springer, February 2003. Invited paper.
[ BibTex | Web page | PS ]

[CNNR03]

H. Comon, P. Narendran, R. Nieuwenhuis, and M. Rusinowitch. Deciding the Confluence of Ordered Term Rewrite Systems. ACM Transactions on Computational Logic, 4(1):33--55, January 2003.
[ BibTex ]

[CS03a]

H. Comon-Lundh and V. Shmatikov. Constraint Solving, Exclusive Or and the Decision of Confidentiality for Security Protocols Assuming a Bounded Number of Sessions. Research Report LSV-03-1, Laboratoire Spécification et Vérification, ENS Cachan, France, January 2003. 17 pages.
[ BibTex | Web page | PS ]

[CS02]

H. Comon and V. Shmatikov. Is it Possible to Decide whether a Cryptographic Protocol is Secure or not? Journal of Telecommunications and Information Technology, 4/2002:5--15, 2002.
[ BibTex | Web page | PDF ]

[CC01]

H. Comon and V. Cortier. Tree Automata with One Memory, Set Constraints and Cryptographic Protocols. Research Report LSV-01-13, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2001. 98 pages.
[ BibTex | Web page | PS ]

[CGN01]

H. Comon, G. Godoy, and R. Nieuwenhuis. The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time. In Proceedings of the 42nd Symposium on Foundations of Computer Science (FOCS'01), pages 298--307, Las Vegas, Nevada, USA, October 2001. IEEE Computer Society Press.
[ BibTex | Web page | PS ]

[CCM01]

H. Comon, V. Cortier, and J. Mitchell. Tree Automata with One Memory, Set Constraints and Ping-Pong Protocols. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP'01), volume 2076 of Lecture Notes in Computer Science, pages 682--693, Heraklion, Crete, Grece, July 2001. Springer.
[ BibTex | Web page | PS ]

[CK01]

H. Comon and C. Kirchner. Constraint Solving on Terms. In Revised Lectures of the International Summer School on Constraints in Computational Logics (CCL'99), volume 2002 of Lecture Notes in Computer Science, pages 47--103, Gif-sur-Yvette, France, 2001. Springer.
[ BibTex ]

[Com01]

H. Comon. Inductionless Induction. In Handbook of Automated Reasoning, volume 1, chapter 14, pages 913--962. Elsevier Science Publishers, 2001.
[ BibTex | Web page | PS ]

[CC00]

H. Comon and V. Cortier. Flatness is not a Weakness. In Proceedings of the 14th International Workshop on Computer Science Logic (CSL 2000), volume 1862 of Lecture Notes in Computer Science, pages 262--276, Fischbachau, Germany, August 2000. Springer.
[ BibTex | Web page | PS ]

[CN00]

H. Comon and R. Nieuwenhuis. Inductive Proofs = I-Axiomatization + First-Order Consistency. Information and Computation, 159(1-2):151--186, May-June 2000.
[ BibTex | Web page | PS ]

[Com00]

H. Comon. Sequentiality, Monadic Second Order Logic and Tree Automata. Information and Computation, 157(1-2):25--51, February-March 2000.
[ BibTex | Web page | PS ]

[CDJK99]

H. Comon, M. Dincbas, J.-P. Jouannaud, and C. Kirchner. A Methodological View of Constraint Solving. Constraints, 4(4):337--361, December 1999.
[ BibTex | Web page | PS ]

[CJ99]

H. Comon and Y. Jurski. Timed Automata and the Theory of Real Numbers. In Proceedings of the 10th International Conference on Concurrency Theory (CONCUR'99), volume 1664 of Lecture Notes in Computer Science, pages 242--257, Eindhoven, The Netherlands, August 1999. Springer.
[ BibTex | Web page | PS ]

[CP99]

H. Comon and V. Padovani. Report on Specification Validation in Telecommunication Services. Contract report, June 1999.
[ BibTex ]

[PCLT99]

V. Padovani, H. Comon, J. Leneutre, and R. Tingaud. A Formal Verification of Telephone Supplementary Service Interactions. Research Report LSV-99-5, Laboratoire Spécification et Vérification, ENS Cachan, France, May 1999.
[ BibTex | Web page | PS ]

[CP98a]

H. Comon and V. Padovani. Specifications Consistency Verification. Final Report. Contract Report MAR/UAO/C/98/0080, December 1998. 280 pages.
[ BibTex ]

[CP98b]

H. Comon and V. Padovani. Specifications Consistency Verification. Intermediate Report. Contract Report MAR/UAO/C/98/0051, September 1998.
[ BibTex ]

[CJ98c]

H. Comon and Y. Jurski. Multiple Counters Automata, Safety Analysis and Presburger Arithmetic. In Proceedings of the 10th International Conference on Computer Aided Verification (CAV'98), volume 1427 of Lecture Notes in Computer Science, pages 268--279, Vancouver, British Columbia, Canada, June 1998. Springer.
[ BibTex | Web page | PS ]

[CNNR98]

H. Comon, P. Narendran, R. Nieuwenhuis, and M. Rusinowitch. Decision Problems in Ordered Rewriting. In Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS'98), pages 276--286, Indianapolis, Indiana, USA, June 1998. IEEE Computer Society Press.
[ BibTex | Web page | PS ]

[Com98b]

H. Comon. Completion of Rewrite Systems with Membership Constraints. Part I: Deduction Rules. Journal of Symbolic Computation, 25(4):397--420, April 1998.
[ BibTex | Web page | PS ]

[Com98c]

H. Comon. Completion of Rewrite Systems with Membership Constraints. Part II: Constraint Solving. Journal of Symbolic Computation, 25(4):421--454, April 1998.
[ BibTex | Web page | PS ]

[Com98a]

H. Comon. About proofs by consistency. In Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA'98), volume 1379 of Lecture Notes in Computer Science, pages 136--137, Tsukuba, Japan, March 1998. Springer. Invited lecture.
[ BibTex ]

[CJ98a]

H. Comon and Y. Jurski. Higher-Order Matching and Tree Automata. In Selected Papers from the 11th International Workshop on Computer Science Logic (CSL'97), volume 1414 of Lecture Notes in Computer Science, pages 157--176, Århus, Denmark, 1998. Springer.
[ BibTex | Web page | PS | PDF ]

[CJ98b]

H. Comon and Y. Jurski. Higher-order matching and tree automata. In Selected Papers from the 11th International Workshop on Computer Science Logic (CSL'97), volume 1414 of Lecture Notes in Computer Science, pages 157--176, Århus, Denmark, 1998. Springer. Invited lecture.
[ BibTex | Web page | PS ]

[CJ97]

H. Comon and F. Jacquemard. Ground Reducibility is EXPTIME-Complete. In Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS'97), pages 26--34, Warsaw, Poland, July 1997. IEEE Computer Society Press.
[ BibTex | Web page | PS | PDF ]

[Com97a]

H. Comon. Applications of Tree Automata in Rewriting and Lambda-Calculus. Invited lecture, 12th Annual IEEE Symposium on Logic in Computer Science (LICS'97), Warsaw, Poland, July 1997.
[ BibTex ]

[Com97b]

H. Comon. Une approche logique des contrôles logiques. Rapport de contrat EDF/DER/MOS--LSV, June 1997.
[ BibTex ]

[CT97]

H. Comon and R. Treinen. The First-Order Theory of Lexicographic Path Orderings is Undecidable. Theoretical Computer Science, 176(1-2):67--87, April 1997.
[ BibTex | Web page | PS | PDF ]

[BCK⁺97]

J.-C. Bajard, H. Comon, C. Kenyon, D. Krob, M. Morvan, J.-M. Muller, A. Petit, and Y. Robert. Exercices d'algorithmique (oraux d'ENS). Vuibert, January 1997.
[ BibTex ]

[BC96]

A. Boudet and H. Comon. Diophantine Equations, Presburger Arithmetic and Finite Automata. In Proceedings of the 21st International Colloquium on Trees in Algebra and Programming (CAAP'96), volume 1059 of Lecture Notes in Computer Science, pages 30--43, Linköping, Sweden, April 1996. Springer.
[ BibTex ]

[Com95b]

H. Comon. Sequentiality, Second-Order Monadic Logic and Tree Automata. In Theory of Rewriting Systems and Its Applications, Kyoto, Japan, August 1995. Research Institute for Mathematical Sciences. Invited talk.
[ BibTex ]

[CNR95]

H. Comon, R. Nieuwenhuis, and A. Rubio. Orderings, AC-Theories and Symbolic Constraint Solving. In Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science (LICS'95), pages 375--385, San Diego, California, USA, June 1995. IEEE Computer Society Press.
[ BibTex | Web page | PS ]

[Com95c]

H. Comon. Sequentiality, Second-Order Monadic Logic and Tree Automata. In Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science (LICS'95), pages 508--517, San Diego, California, USA, June 1995. IEEE Computer Society Press.
[ BibTex | Web page | PS ]

[Com95a]

H. Comon. On Unification of Terms with Integer Exponents. Mathematical Systems Theory, 28(1):67--88, February 1995.
[ BibTex | Web page | PS ]

[BC95]

A. Boudet and H. Comon. Résolution de contraintes symboliques. Notes du cours de DEA d'Informatique de Paris Université Paris-Sud 11, Orsay, France, 1995.
[ BibTex ]

[CJ95]

H. Comon and J.-P. Jouannaud. Les termes en logique et en programmation. Notes du cours de DEA Sémantique, preuves et programmation, 1995.
[ BibTex ]

[CD94]

H. Comon and C. Delor. Equational Formulae with Membership Constraints. Information and Computation, 112(2):167--216, August 1994.
[ BibTex | Web page | PS ]

[CCC⁺94a]

A.-C. Caron, H. Comon, J.-L. Coquidé, M. Dauchet, and F. Jacquemard. Pumping, Cleaning and Symbolic Constraints Solving. In Proceedings of the 21th International Colloquium on Automata, Languages and Programming (ICALP'94), volume 820 of Lecture Notes in Computer Science, pages 436--449, Jerusalem, Israel, July 1994. Springer-Verlag.
[ BibTex ]

[Com94b]

H. Comon. Inductionless Induction. In Lecture Notes of the 2nd International Conference in Logic for Computer Science: Automated Deduction, Université de Savoie, Chambéry, France, July 1994.
[ BibTex | Web page | PS ]

[CHJ94]

H. Comon, M. Haberstrau, and J.-P. Jouannaud. Syntacticness, Cycle-Syntacticness and Shallow Theories. Information and Computation, 111(1):154--191, May 1994.
[ BibTex | Web page | PS ]

[CT94]

H. Comon and R. Treinen. Ordering Constraints on Trees. In Proceedings of the 19th International Colloquium on Trees in Algebra and Programming (CAAP'94), volume 787 of Lecture Notes in Computer Science, pages 1--14, Edinburgh, Scotland, UK, April 1994. Springer-Verlag. Invited paper.
[ BibTex | Web page | PS ]

[CJ94]

H. Comon and F. Jacquemard. Ground Reducibility and Automata with Disequality Constraints. In Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science (STACS'94), volume 775 of Lecture Notes in Computer Science, pages 151--162, Caen, France, February 1994. Springer-Verlag.
[ BibTex ]

[Com94a]

H. Comon. Constraints in Term Algebras (Short Survey). In Proceedings of the 3rd International Conference on Algebraic Methodology and Software Technology (AMAST'93), Workshops in Computing, pages 145--152, Twente, The Netherlands, 1994. Springer-Verlag. Invited paper.
[ BibTex | Web page | PS ]

[CCC94b]

S. Cerrito, H. Comon, and C. Crépeau. Calculabilité et Complexité. Notes du cours de C3, Maîtrise d'Informatique de Université Paris-Sud 11, Orsay, France, 1994.
[ BibTex ]

[Com93]

H. Comon. Complete Axiomatizations of Some Quotient Term Algebras. Theoretical Computer Science, 118(2):167--191, September 1993.
[ BibTex | Web page | PS ]

[BC93]

A. Boudet and H. Comon. About the Theory of Tree Embedding. In Proceedings of the 5th International Joint Conference CAAP/FASE on Theory and Practice of Software Development (TAPSOFT'93), volume 668 of Lecture Notes in Computer Science, pages 376--390, Orsay, France, April 1993. Springer.
[ BibTex | Web page | PS ]

[CF92]

H. Comon and M. Fernández. Negation Elimination in Equational Formulae. In Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science (MFCS'92), volume 629 of Lecture Notes in Computer Science, pages 191--199, Prague, Czechoslovakia, August 1992. Springer-Verlag.
[ BibTex ]

[Com92a]

H. Comon. Completion of Rewrite Systems with Membership Constraints. In Proceedings of the 19th International Colloquium on Automata, Languages and Programming (ICALP'92), volume 623 of Lecture Notes in Computer Science, pages 392--403, Vienna, Austria, July 1992. Springer-Verlag.
[ BibTex ]

[CHJ92]

H. Comon, M. Haberstrau, and J.-P. Jouannaud. Decidable Problems in Shallow Equational Theories. In Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science (LICS'92), pages 255--262, Santa Cruz, California, USA, June 1992. IEEE Computer Society Press.
[ BibTex ]

[Com92c]

H. Comon. Résolution de contraintes dans des algèbres de termes. Mémoire d'habilitation, Laboratoire de Recherche en Informatique, Orsay, France, April 1992.
[ BibTex | Web page | PS ]

[Com92b]

H. Comon. Constraints in Term Algebras. Application to Rewrite Systems. Atti Degli Incontri Di Logica Matematica, 8:5--17, 1992.
[ BibTex ]

[Com91a]

H. Comon. Complete axiomatizations of some quotient term algebras. In Proceedings of the 18th International Colloquium on Automata, Languages and Programming (ICALP'91), volume 510 of Lecture Notes in Computer Science, pages 469--480, Madrid, Spain, July 1991. Springer-Verlag.
[ BibTex | Web page | PDF ]

[CLS91]

H. Comon, D. Lugiez, and Ph. Schnoebelen. A Rewrite-Based Type Discipline for a Subset of Computer Algebra. Journal of Symbolic Computation, 11(4):349--368, April 1991.
[ BibTex ]

[Com91b]

H. Comon. Disunification: a survey. In Computational Logic -- Essays in Honor of Alan Robinson, pages 322--359. MIT Press, 1991.
[ BibTex | Web page | PS ]

[Com91c]

H. Comon. Ground normal forms and inductive proofs. Part I: Complement problems. Research Report 698, Laboratoire de Recherche en Informatique, Orsay, France, 1991.
[ BibTex ]

[Com90c]

H. Comon. Solving symbolic ordering constraints. International Journal of Foundations of Computer Science, 1(4):387--411, December 1990.
[ BibTex | Web page | PS ]

[Com90a]

H. Comon. Equational formulas in order-sorted algebras. In Proceedings of the 17th International Colloquium on Automata, Languages and Programming (ICALP'90), volume 443 of Lecture Notes in Computer Science, pages 674--688, Warwick, UK, July 1990. Springer-Verlag.
[ BibTex ]

[Com90b]

H. Comon. Solving inequations in term algebras. In Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science (LICS'90), pages 62--69, Philadelphia, Pennsylvania, USA, June 1990. IEEE Computer Society Press.
[ BibTex ]

[Com89]

H. Comon. Inductive proofs by specifications transformation. In Proceedings of the 3rd International Conference on Rewriting Techniques and Applications (RTA'89), volume 355 of Lecture Notes in Computer Science, pages 76--91, Chapel Hill, North Carolina, USA, April 1989. Springer.
[ BibTex | Web page | PDF ]

[CL89]

H. Comon and P. Lescanne. Equational problems and disunification. Journal of Symbolic Computation, 7(3-4):371--425, March-April 1989.
[ BibTex | Web page | PDF ]

[SLC88]

Ph. Schnoebelen, D. Lugiez, and H. Comon. A Semantics for Polymorphic Subtypes in Computer Algebra. Research Report 711, Laboratoire d'Informatique Fondamentale et d'Intelligence Artificielle, Grenoble, France, March 1988.
[ BibTex ]

This file was generated by bibtex2html 1.98.