Christophe Ringeissen

Orcid: 0000-0002-5937-6059

Affiliations:
  • INRIA, France


According to our database1, Christophe Ringeissen authored at least 82 papers between 1992 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Knowledge Problems in Protocol Analysis: Extending the Notion of Subterm Convergent.
CoRR, 2024

Combined Abstract Congruence Closure for Theories with Associativity or Commutativity.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2024

Deciding Knowledge Problems Modulo Classes of Permutative Theories.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2024

2023
Combining Stable Infiniteness and (Strong) Politeness.
J. Autom. Reason., December, 2023

Knowledge Problems in Security Protocols: Going Beyond Subterm Convergent Theories.
Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2022
Polite Combination of Algebraic Datatypes.
J. Autom. Reason., 2022

Combined Hierarchical Matching: the Regular Case.
Proceedings of the 7th International Conference on Formal Structures for Computation and Deduction, 2022

2021
Politeness for the Theory of Algebraic Datatypes (Extended Abstract).
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Non-disjoint Combined Unification and Closure by Equational Paramodulation.
Proceedings of the Frontiers of Combining Systems - 13th International Symposium, 2021

Politeness and Stable Infiniteness: Stronger Together.
Proceedings of the Automated Deduction - CADE 28, 2021

2020
Computing knowledge in equational extensions of subterm convergent theories.
Math. Struct. Comput. Sci., 2020

Politeness and Combination Methods for Theories with Bridging Functions.
J. Autom. Reason., 2020

Terminating Non-Disjoint Combined Unification (Extended Abstract).
Proceedings of the 34th International Workshop on Unification, 2020

Terminating Non-disjoint Combined Unification.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2020

Politeness for the Theory of Algebraic Datatypes.
Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

2019
Rule-Based Unification in Combined Theories and the Finite Variant Property.
Proceedings of the Language and Automata Theory and Applications, 2019

Building and Combining Matching Algorithms.
Proceedings of the Description Logic, Theory Combination, and All That, 2019

Theory Combination: Beyond Equality Sharing.
Proceedings of the Description Logic, Theory Combination, and All That, 2019

2017
Notions of Knowledge in Combinations of Theories Sharing Constructors.
Proceedings of the Automated Deduction - CADE 26, 2017

2016
Satisfiability Modulo Free Data Structures Combined with Bridging Functions.
Proceedings of the 14th International Workshop on Satisfiability Modulo Theories affiliated with the International Joint Conference on Automated Reasoning, 2016

2015
A rule-based system for automatic decidability and combinability.
Sci. Comput. Program., 2015

Unification and Matching in Hierarchical Combinations of Syntactic Theories.
Proceedings of the Frontiers of Combining Systems - 10th International Symposium, 2015

A Rewriting Approach to the Combination of Data Structures with Bridging Theories.
Proceedings of the Frontiers of Combining Systems - 10th International Symposium, 2015

A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited.
Proceedings of the Automated Deduction - CADE-25, 2015

2014
Hierarchical Combination of Matching Algorithms (Extended Abstract).
Proceedings of the 28th International Workshop on Unification, 2014

On Asymmetric Unification and the Combination Problem in Disjoint Theories (Extended Abstract).
Proceedings of the 28th International Workshop on Unification, 2014

On Asymmetric Unification and the Combination Problem in Disjoint Theories.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

A Gentle Non-disjoint Combination of Satisfiability Procedures.
Proceedings of the Automated Reasoning - 7th International Joint Conference, 2014

2013
Automatic Decidability: A Schematic Calculus for Theories with Counting Operators.
Proceedings of the 24th International Conference on Rewriting Techniques and Applications, 2013

Hierarchical Combination of Unication Algorithms (Extended Abstract).
Proceedings of the 27th International Workshop on Unification, 2013

Hierarchical Combination.
Proceedings of the Automated Deduction - CADE-24, 2013

2012
A Rule-Based Framework for Building Superposition-Based Decision Procedures.
Proceedings of the Rewriting Logic and Its Applications - 9th International Workshop, 2012

2011
Automatic decidability and combinability.
Inf. Comput., 2011

Modular Termination and Combinability for Superposition Modulo Counter Arithmetic.
Proceedings of the Frontiers of Combining Systems, 8th International Symposium, 2011

2010
Combination of convex theories: Modularity, deduction completeness, and explanation.
J. Symb. Comput., 2010

Combining Satisfiability Procedures for Unions of Theories with a Shared Counting Operator.
Fundam. Informaticae, 2010

2009
Satisfiability Procedures for Combination of Theories Sharing Integer Offsets.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2009

Data Structures with Arithmetic Constraints: A Non-disjoint Combination.
Proceedings of the Frontiers of Combining Systems, 7th International Symposium, 2009

Combinable Extensions of Abelian Groups.
Proceedings of the Automated Deduction, 2009

Raisonnement équationnel et méthodes de combinaison: de la programmation à la preuve. (Equational reasoning and combination methods: from programs to proofs).
, 2009

2008
Modelando la composición de servicios web con restricciones.
Rev. Avances en Sistemas Informática, 2008

A Mediator Based Approach For Services Composition.
Proceedings of the 6th ACIS International Conference on Software Engineering Research, 2008

Dynamic Web Services Provisioning with Constraints.
Proceedings of the On the Move to Meaningful Internet Systems: OTM 2008, 2008

2007
Timed Specification For Web Services Compatibility Analysis.
Proceedings of the 3rd International Workshop on Automated Specification and Verification of Web Systems, 2007

Combining Proof-Producing Decision Procedures.
Proceedings of the Frontiers of Combining Systems, 6th International Symposium, 2007

2006
Special issue on combining logical systems.
Inf. Comput., 2006

Automatic Combinability of Rewriting-Based Satisfiability Procedures.
Proceedings of the Logic for Programming, 2006

Decision Procedures for the Formal Analysis of Software.
Proceedings of the Theoretical Aspects of Computing, 2006

2005
On Superposition-Based Satisfiability Procedures and Their Combination.
Proceedings of the Theoretical Aspects of Computing, 2005

Combining Data Structures with Nonstably Infinite Theories Using Many-Sorted Logic.
Proceedings of the Frontiers of Combining Systems, 5th International Workshop, 2005

2004
Manipulating algebraic specifications with term-based and graph-based representations.
J. Log. Algebraic Methods Program., 2004

Preface.
Proceedings of the 5th International Workshop on Rule-Based Programming, 2004

Nelson-Oppen, Shostak and the Extended Canonizer: A Family Picture with a Newborn.
Proceedings of the Theoretical Aspects of Computing, 2004

2003
Unions of non-disjoint theories and combinations of satisfiability procedures.
Theor. Comput. Sci., 2003

A Tool Support for Reusing ELAN Rule-Based Components.
Proceedings of the 4th International Workshop on Rule-Based Programming, 2003

A Rule Language for Interaction.
Proceedings of the Recent Advances in Constraints, 2003

A Pattern Matching Compiler for Multiple Target Languages.
Proceedings of the Compiler Construction, 12th International Conference, 2003

Matching in a Class of Combined Non-disjoint Theories.
Proceedings of the Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28, 2003

2002
The ELAN Environment: a Rewriting Logic Environment based on ASF+SDF Technology - System Demonstration.
Proceedings of the Second Workshop on Language Descriptions, Tools and Applications, 2002

Improving Symbolic Model Checking by Rewriting Temporal Logic Formulae.
Proceedings of the Rewriting Techniques and Applications, 13th International Conference, 2002

2001
Rewriting with Strategies in ELAN: A Functional Semantics.
Int. J. Found. Comput. Sci., 2001

Pattern-Matching Compiler.
Proceedings of the First Workshop on Language Descriptions, Tools and Applications, 2001

Matching with Free Function Symbols - A Simple Extension of Matching?
Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

2000
Handling Relations over Finite Domains in the Rule-Based System ELAN.
Proceedings of the 3rd International Workshop on Rewriting Logic and its Applications, 2000

ASF+SDF parsing tools applied to ELAN.
Proceedings of the 3rd International Workshop on Rewriting Logic and its Applications, 2000

1999
An Open Automated Framework for Constraint Solver Extension: the SoleX Approach.
Fundam. Informaticae, 1999

Generating Propagation Rules for Finite Domains: A Mixed Approach.
Proceedings of the New Trends in Contraints, 1999

1998
Rule-Based Constraint Programming.
Fundam. Informaticae, 1998

An overview of ELAN.
Proceedings of the 1998 International Workshop on Rewriting Logic and its Applications, 1998

Handling ELAN rewrite programs via an exchange format.
Proceedings of the 1998 International Workshop on Rewriting Logic and its Applications, 1998

SoleX: A Domain-Independent Scheme for Constraint Solver Extension.
Proceedings of the Artificial Intelligence and Symbolic Computation, 1998

1997
Prototyping Combination of Unification Algorithms with the ELAN Rule-Based Programming Language.
Proceedings of the Rewriting Techniques and Applications, 8th International Conference, 1997

Higher-Order Equational Unification via Explicit Substitutions.
Proceedings of the Algebraic and Logic Programming, 6th International Joint Conference, 1997

1996
Combining Decision Algorithms for Matching in the Union of Disjoint Equational Theories.
Inf. Comput., 1996

Cooperation of Decision Procedures for the Satisfiability Problem.
Proceedings of the Frontiers of Combining Systems, 1996

1994
Combining Symbolic Constraint Solvers on Algebraic Domains.
J. Symb. Comput., 1994

Combination of Matching Algorithms.
Proceedings of the STACS 94, 1994

Constraint Solving by Narrowing in Combined Algebraic Domains.
Proceedings of the Logic Programming, 1994

Combination Techniques for Non-Disjoint Equational Theories.
Proceedings of the Automated Deduction - CADE-12, 12th International Conference on Automated Deduction, Nancy, France, June 26, 1994

1993
Combinaison de résolutions de contraintes. (Combination of constraint solvers).
PhD thesis, 1993

1992
Unification in a Combination of Equational Theories with Shared Constants and its Application to Primal Algebras.
Proceedings of the Logic Programming and Automated Reasoning, 1992

A Constraint Solver in Finite Algebras and Its Combination with Unification Algorithms.
Proceedings of the Logic Programming, 1992


  Loading...