Problem statements often resort to superlatives such as in eg “… the smallest such
number”,“… the best approximation”,“… the longest such list” which lead to specifications …

Relational algebra offers to software engineering the same degree of conciseness and
calculational power as linear algebra in other engineering disciplines. Binary relations play …

The pointfree transform offers to the predicate calculus what the Laplace transform offers to
the differential/integral calculus: the possibility of changing the underlying mathematical …

Galois connections are a foundational tool for structuring abstraction in semantics and their
use lies at the heart of the theory of abstract interpretation. Yet, mechanization of Galois …

Cryptographic software development is a challenging field: high performance must be
achieved, while ensuring correctness and compliance with low-level security policies. CAO …

It is important when develo** software to verify the absence of undesirable behavior such
as crashes, bugs and security vulnerabilities. Some settings require high assurance in …

Abstract Design patterns represent a highly successful technique in software engineering,
giving a reusable 'best practice'solution to commonly occurring problems in software design …

Galois connections are a foundational tool for structuring abstraction in semantics, and their
use lies at the heart of the theory of abstract interpretation. Yet, mechanization of Galois …

We calculate two iterative, polynomial-time graph algorithms from the literature: a
dominance algorithm and an algorithm for the single-source shortest path problem. Both …

Many programming tasks can be specified as optimisation problems in which a relation is
used to generate all possible solutions, from which we wish to choose an optimal one. A …