Mathematics never saw much of a reason to deal with something called nondeterminism. It
works with values, functions, sets, and relations. In computing science, however …

A survey is given of work performed by the authors in recent years concerning the semantics
of imperative concurrency. Four sample languages are presented for which a number of …

A general framework for the denotational treatment of concurrency is introduced. The key
idea is the notion of process which is element of a domain obtained as solution of a domain …

Formal methods have already been shown to improve the development process and quality
assurance in system design and implementation. This volume examines whether these …

Our focus is on the semantics of programming and specification languages. Over the years,
different approaches to give semantics to these languages have been put forward. We …

We present a general method to achieve modularity of semantic definitions of programming
languages specified as rewrite theories. This provides modularity for a language …

In this paper we describe a validation process for graphical user interfaces based on
existing toolkits and higher-order logic as mechanized in the HOL system. The underlying …

Dijkstra and Scholten (1990) present an axiomatic semantics for Dijkstra's guarded
command language through the notions of weakest precondition and weakest liberal …

Abstract In [6], Dijkstra and Scholten present an axiomatic semantics for Dijkstra's guarded
command language through the notions of weakest precondition and weakest liberal …

Two denotational semantics for a language with simple concurrency are presented. The
language has parallel composition in the form of the shuffle operation, in addition to the …