A comprehensive introduction to the foundations of model checking, a fully automated
technique for finding flaws in hardware and software; with extensive examples and both …

This text is based on the chapter Domain Theory in the Handbook for Logic in Computer
Science, volume 3, edited by S. Abramsky, Dov M. Gabbay, and TS E. Maibaum, published …

In the semantics of programming, finite data types such as finite lists, have traditionally been
modelled by initial algebras. Later final coalgebras were used in order to deal with infinite …

A theory of lazy λ-calculus is developed as a basis for lazy functional programming
languages. This is motivated by a mismatch between the" standard"(ie, sensible) theory of …

Semantics of Programming Languages exposes the basic motivations and philosophy
underlying the applications of semantic techniques in computer science. It introduces the …

Abramsky, S., Domain theory in logical form, Annals of Pure and Applied Logic 51 (1991) 1–
77.• Domain theory, the mathematical theory of computation introduced by Scott as a …

We present an actor language which is an extension of a simple functional language, and
provide an operational semantics for this extension. Actor configurations represent open …

We present a categorical theory of'well-behaved'operational semantics which aims at
complementing the established theory of domains and denotational semantics to form a …

In the concurrent language CCS, two programs are considered the same if they are
bisimilar. Several years and many researchers have demonstrated that the theory of …

The area of coalgebra has emerged within theoretical computer science with a unifying
claim: to be the mathematics of computational dynamics. It combines ideas from the theory of …