Matching logic is a logic for specifying and reasoning about structure by means of patterns
and pattern matching. This paper makes two contributions. First, it proposes a sound and …

This paper shows that an SMT-based program verifier can support reasoning about co-
induction—handling infinite data structures, lazy function calls, and user-defined properties …

Several algorithmic variants of circular coinduction have been proposed and implemented
during the last decade, but a proof theoretical foundation of circular coinduction in its full …

Automation of fixpoint reasoning has been extensively studied for various mathematical
structures, logical formalisms, and computational domains, resulting in specialized fixpoint …

Streams, or infinite sequences, are infinite objects of a very simple type, yet they have a rich
theory partly due to their ubiquity in mathematics and computer science. Stream differential …

Program equivalence checking is the task of confirming that two programs have the same
behavior on corresponding inputs. We develop a calculus based on symbolic execution and …

We present in this paper an interpreter implemented in Maude for non-behavioral CafeOBJ
specifications. This alternative implementation poses a number of advantages:(1) it allows …

CIRC is a tool for automated inductive and coinductive theorem proving. It includes an
engine based on circular coinduction, which makes CIRC particularly well-suited for proving …

Several dynamical systems, such as deterministic automata and labelled transition systems,
can be described as coalgebras of so-called Kripke polynomial functors, built up from …

Streams are infinite sequences over a given data type. A stream specification is a set of
equations intended to define a stream. We propose a transformation from such a stream …