For every finite model M and an LTL property ϕ, there exists a number CT (the
Completeness Threshold) such that if there is no counterexample to ϕ in M of length CT or …

This paper focuses on the integration of reachability and observability concepts within an
algebraic, institution-based framework. In the first part of this work, we develop the essential …

The present article describes a method for proving Downward Löwenheim–Skolem
Theorem within an arbitrary institution satisfying certain logic properties. In order to …

Many computer science applications concern properties that are true for a restricted class of
models. In this paper, a couple of constructor-based institutions are presented. These …

This paper gives a precise characterization for the complexity of the problem of proving
equal two streams defined with a finite number of equations: Π0 over 2. Since the Π 0 over 2 …

The requirements engineering process is primarily useful for complex software that controls
industrial processes. Requirements for control software suppose a description of the change …

The proof scores method is an interactive verification method in algebraic specification that
combines manual proof planning and reduction (automatic inference by rewriting). The proof …

The constructor-based logics constitute the logical foundation of the so-called OTS/CafeOBJ
method, a modelling, specification and verification method of the observational transition …

We present a generic method for establishing the interpolation property by borrowing it
across the logical systems from a base institution to prove it for its constructor-based variant …

We introduce CoCasl as a simple coalgebraic extension of the algebraic specification
language Casl. CoCasl allows the nested combination of algebraic datatypes and …