Network segmentation or compartmentalization, and layered protection are two strategies
that are critical in building a secure network. In the literature, layered protection has been …

Modal Kleene algebras are Kleene algebras enriched by forward and backward box and
diamond operators. We formalise the symmetries of these operators as Galois connections …

We present an algebraic approach to separation logic. In particular, we give an algebraic
characterisation for assertions of separation logic, discuss different classes of assertions and …

We study the problem of hardening the security of existing networks. Dynamic and static
analysis are two main approaches that are used to address this problem. Dynamic analysis …

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 …

Computer networks are getting more and more complex with enormous number of
resources, diverse access control policies, and spanning over different platforms and …

We study Hoare-like logics, including partial and total correctness Hoare logic, incorrectness
logic, Lisbon logic, and many others through the lens of predicate transformers\a la Dijkstra …

We generalise the designs of the Unifying Theories of Programming (UTP) by defining them
as matrices over semirings with ideals. This clarifies the algebraic structure of designs and …

In relational semantics, the input-output semantics of a program is a relation on its set of
states. We generalise this in considering elements of Kleene algebras as semantical values …

We give axioms for an operation that describes iteration in various relational models of
computations. The models differ in their treatment of finite, infinite and aborting executions …