{"id":13,"date":"2015-06-15T10:26:53","date_gmt":"2015-06-15T08:26:53","guid":{"rendered":"http:\/\/members.loria.fr\/thierrygartiser\/?page_id=13"},"modified":"2026-09-09T15:33:01","modified_gmt":"2026-09-09T13:33:01","slug":"publications","status":"publish","type":"page","link":"https:\/\/members.loria.fr\/CRingeissen\/publications\/","title":{"rendered":"Publis"},"content":{"rendered":"

Recent publications<\/h4>\n
\n
Carter Bunch, Saraid Dwyer Satterfield, Serdar Erbatur, Andrew M. Marshall and Christophe Ringeissen. Knowledge Problems in Protocol Analysis: Extending the Notion of Subterm Convergent. Logical Methods in Computer Science, 22(2), 2026, DOI<\/a>.<\/li>\n
Rodrigo Raya, Christophe Ringeissen. Modular derivation of decision procedures for extensions of the algebraic theory of arrays. Journal of Logical and Algebraic Methods in Programming, 151:101132, 2026, DOI<\/a>.<\/li>\n<\/ul>\n
Some representative publications<\/h4>\n
\n
Cesare Tinelli,\u00a0Christophe Ringeissen.\u00a0Unions of non-disjoint theories and combinations of satisfiability procedures.<\/span> Theoretical. Computer Science, 290(1): 291-353, 2003, DOI<\/a>. Authors’ PDF<\/a>.<\/span><\/li>\n
Paula Chocron, Pascal Fontaine, Christophe Ringeissen. Politeness and Combination Methods for Theories with Bridging Functions. Journal of Automated Reasoning<\/span>, 64(1):97-134, 2020, DOI<\/a>. Also available here<\/a>.<\/span><\/li>\n
Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen. Combined Hierarchical Matching: the Regular Case. FSCD 2025, volume 228 of LIPIcs, 6:1–6:22, 2022<\/span>, DOI<\/a>.<\/span><\/li>\n<\/ol>\n
Theses<\/h4>\n
\n
Combinaison de R\u00e9solution de Contraintes<\/a>, PhD thesis defended on December 21, 1993.<\/li>\n
Raisonnement \u00e9quationnel et m\u00e9thodes de combinaison: de la programmation \u00e0 la preuve (Equational Reasoning and Combination Methods: from Programs to Proofs)<\/a>, Habilitation thesis defended on November 27, 2009.<\/li>\n<\/ul>\n
Publications (from HAL<\/a>)<\/h4>\n