We introduce Isabelle/UTP, a novel mechanisation of Hoare and He's Unifying Theories of
Programming (UTP) in Isabelle/HOL. UTP is a framework for the study, formalisation, and …

Most verification approaches embed a model of program state into their semantic treatment.
Though a variety of heterogeneous state-space models exists, they all possess common …

Practice nursing in N ew Z ealand is not well described in the literature. One survey
illustrated that most of the N ew Z ealand practice nurses sampled did not know of the …

We present a reflexive tactic for deciding the equational theory of Kleene algebras in the
Coq proof assistant. This tactic relies on a careful implementation of efficient finite automata …

These theory files are only sparsely commented. Additional information on the hierarchy of
Kleene algebras and its formalisation in Isabelle/HOL can be found in a tutorial paper [12] or …

We implement a large Isabelle/HOL repository of algebras for application in modelling
computing systems. They subsume computational logics such as dynamic and Hoare logics …

Software verification is essential for safety-critical systems. In this paper, we illustrate that
some verification tasks can be done fully automatically. We show how to automatically verify …

We provide a finite set of axioms for identity-free Kleene lattices, which we prove sound and
complete for the equational theory of their relational models. Our proof builds on the …

In this paper, we present how algebraic structures and morphisms can be modelled in the
ACL2 theorem prover. Namely, we illustrate a methodology for implementing a set of tools …

We extend a large Isabelle/HOL repository for regular algebras towards higher-order
variants based on directed sets and quantales, including reasoning based on general …