We propose an algebraic semantics for the temporal logic CTL* and simplify it for its
sublogics CTL and LTL. We abstractly represent state and path formulas over transition …

Alloy is a specification language based on a relational first-order logic with built-in operators
for transitive closure, set cardinality, and integer arithmetic. The Alloy Analyzer checks Alloy …

Abstract Concurrent Kleene Algebras (CKAs) serve to describe general concurrent systems
in a unified way at an abstract algebraic level. Recently, a graph-based model for CKA has …

Logic has proved essential for formally modeling software based systems. Such formal
descriptions, frequently called specifications, have served not only as requirements …

Algebraization of computational logics in the theory of fork algebras has been a research
topic for a while. This research allowed us to interpret classical first-order logic, several …

Describing systems through the specification of different views is a well accepted practice in
modern software engineering. In this paper we show how to reason across behavioral …

Fork algebras are an extension of relation algebras obtained by extending the set of logical
symbols with a binary operator called fork. This class of algebras was introduced by …

The theory of institutions, introduced by Goguen and Burstall in 1984, can be thought of as
an abstract formulation of model theory. This theory has been shown to be particularly useful …

The world of software development has become intrinsically heterogeneous. Many formal
languages have been made available to help analysts and designers model different …

In previous articles we presented A rg entum, a tool for reasoning across heterogeneous
specifications based on the language of fork algebras. A rg entum's foundations were …