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 …

A new notion of generalized rewrite theory suitable for symbolic reasoning and generalizing
the standard notion in [19] is motivated and defined. Also, new requirements for symbolic …

A concurrent program with semaphore-based exclusive control can be modeled by a
logically constrained term rewrite system. In this paper, we first propose a framework to …

An all-path reachability problem of a logically constrained term rewrite system is a pair of
constrained terms representing state sets, and is demonically valid if every finite execution …

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 …

While automated verification of imperative programs has been studied intensively, proving
termination of programs with explicit pointer arithmetic fully automatically was still an open …

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 …

In this paper, as a first step of modeling concurrent programs by logically constrained term
rewrite systems (LCTRSs, for short), we show transformations of concurrent programs with …

This paper discusses Ctrl, a tool to analyse–both automatically and manually–term rewriting
with logical constraints. Ctrl can be used with TRSs on arbitrary underlying logics, and …

Regression verification is a form of software verification based on formal static analysis of
code, which is used, since recently, in several domains. In this paper we examine potentials …