: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
Boolean expression simplification is a well-known problem in the history of Computer Science. The problem of determining prime implicates from an arbitrary Boolean expression has...
Abstract. The resource calculus is an extension of the λ-calculus allowing to model resource consumption. Namely, the argument of a function comes as a finite multiset of resourc...
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
We propose a new look at one of the most fundamental types of behavioral interfaces: discrete time specifications of communication--directly related to the work of de Alfaro and H...
Kim Guldstrand Larsen, Ulrik Nyman, Andrzej Wasows...