This paper proposes rewriting modulo SMT, a new technique that combines the power of
SMT solving, rewriting modulo theories, and model checking. Rewriting modulo SMT is …

This article aims to develop a verification method for procedural programs via a
transformation into logically constrained term rewriting systems (LCTRSs). To this end, we …

This paper presents new results on the decidability of inductive validity of conjectures. For
these results, a class of term rewrite systems (TRSs) with built-in linear integer arithmetic is …

The HOM-problem asks whether the image of a regular tree language under a given tree
homomorphism is again regular. It was recently shown to be decidable by Godoy, Gim\'enez …

This paper proposes rewriting modulo SMT, a new technique that combines the power of
SMT solving, rewriting modulo theories, and model checking. Rewriting modulo SMT is …

This dissertation presents a significant step forward in automatic and semi-automatic
reasoning for reachability properties of rewriting logic specifications, a major research goal …

We present a procedure for checking sufficient completeness of conditional and constrained
term rewriting systems containing axioms for constructors which may be constrained (by eg …

We start from the set theory axioms and we represent sets by monotone lists (sorted lists
without duplications). For this, we define a representation function R and its reverse S and …

The construction of a theory for binary trees is presented, based on the systematic
exploration of the properties necessary for the proof-based synthesis and certification of …

In this paper, we propose methods for proving termination of constrained term rewriting
systems, where constraints are interpreted by built-in semantics given by users, and rewrite …