One of the authors introduced in [Santocanale, FoSSaCS, 2002] a calculus of circular proofs
for studying the computability arising from the following categorical operations: finite …

Induction is a well-established proof principle that is taught in most undergraduate programs
in mathematics and computer science. In computer science, it is used primarily to reason …

The endless transformation of technological innovation requires greater collaboration of
Information Communication and Technology (ICT) in various areas especially in public …

Matching logic was recently proposed as a unifying logic for specifying and reasoning about
static structure and dynamic behavior of programs. In matching logic, patterns 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 …

Session types statically describe communication protocols between concurrent message-
passing processes. Unfortunately, parametric polymorphism even in its restricted prenex …

Invariants are the predominant approach to verify the correctness of loops. As an alternative,
loop contracts, which make explicit the premise and conclusion of the underlying induction …

Induction and coinduction are two complementary techniques used in mathematics and
computer science. These techniques occur together, for example, in control systems: On the …

This paper presents a formalized framework for defining corecursive functions safely in a
total setting, based on corecursion up-to and relational parametricity. The end product is a …

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 …