After a number of success stories in safety‐critical domains, we are starting to witness
applications of formal methods in contemporary systems and software engineering …

In cloud computing environment, task scheduling is one of the most critical issues to be
solved. Efficient task scheduling mechanism not only meets users' requirements but also …

Structures of Computing explains the behavioral meaning of fundamental concepts of
computing from a practical viewpoint and in generic terms, unrestricted by specific …

A concurrent system can be characterised by autonomously acting agents, where each
agent executes its own program, uses shared resources and communicates with the others …

The share of formal methods is still marginal in contemporary systems and software
engineering. One of the reasons is the absence of systematic guidelines and evaluation …

We develop a behavioural theory of reflective sequential algorithms (RSAs), ie sequential
algorithms that can modify their own behaviour. The theory comprises a set of language …

We present Executable Abstract Programs and analyse their role for software development
and documentation. The intuitive understanding of these programs fits the computational …

Abstract “What is an algorithm?” is a fundamental question of computer science. Gurevich's
behavioural theory of sequential algorithms (aka the sequential ASM thesis) gives a partial …

We develop a logic which enables reasoning about single steps of non-deterministic and
parallel Abstract State Machines (ASMs). Our logic builds upon the unifying logic introduced …

The bulk synchronous parallel (BSP) bridging model is a model for concurrent computations
with alternating computation and communication phases between programs running on …