Variants of Kleene algebra have been used to provide foundations of reasoning about
programs, for instance by representing Hoare Logic (HL) in algebra. That work has generally …

Kleene algebra with tests (KAT) is a foundational equational framework for reasoning about
programs, which has found applications in program transformations, networking and …

Experience from recent years has shown that it is often advantageous not to build a single
product but rather a family of similar products that share at least one common functionality …

Based on experience from the hardware industry, product families have entered the software
development process as well, since software developers often prefer not to build a single …

The work presented here investigates the combination of Kleene algebra with the synchrony
model of concurrency from Milner's SCCS calculus. The resulting algebraic structure is …

Five algebraic notions of termination are formalised, analysed and compared:
wellfoundedness or Noetherity, Löb's formula, absence of infinite iteration, absence of …

Hoare and He's unifying theories of programming (UTP) provide a collection of relational
models that can be used to study and compare several programming paradigms. In this …

This work is a case study in program verification: We have written a simple parser and a
corresponding pretty-printer in a non-strict functional programming language with lifted pairs …

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 …

The family of domain algebras provide an elegant formal system for automated reasoning
about programme verification. Their primary models are algebras of relations, viz …