Treating control and data in an integrated way is an important issue in system development. We discuss a compositional approach for specifying concurrent behavior of components with data states on the basis of interface theories. The dynamic aspects of a system are specified by modal I/O-transition systems, whereas changes of data states are specified by preand postconditions. In this setting w...

Networks have received widespread attention in recent years as a target for domain-specific language design. The emergence of software-defined networking (SDN) as a popular paradigm for network programming has led to the appearance of a number of SDN programming languages seeking to provide high-level abstractions to simplify the task of specifying the packet-processing behavior of a network. P...

The fundamental theorem of the classical serializability theory states the necessary and suucient conditions for the connict serializability of an execution. In this paper, we extend the correctness criteria of the classical theory by presenting a deenition of connict serializability for concurrency control of nested transactions. We deene a serialization graph for nested transactions and we pr...

The purpose of this paper is to collect the homotopical methods used in the development of the theory of flows initialized by author’s paper “A model category for the homotopy theory of concurrency”. It is presented generalizations of the classical Whitehead theorem inverting weak homotopy equivalences between CW-complexes using weak factorization systems. It is also presented methods of calcul...

Directed Algebraic Topology is a recent field, deeply linked with Category Theory. A ‘directed space’ has directed homotopies (generally non reversible), directed homology groups (enriched with a preorder) and fundamental n-categories (replacing the fundamental ngroupoids of the classical case). On the other hand, directed homotopy can give geometric models for lax higher categories. Applicatio...

“How can we make sure our students learn what we want them to?” is the number one question in teaching. This paper is intended to provide the reader with: i) a general answer to this question based on The Theory of Constructive Alignment by John Biggs; ii) relevant insights for bringing this answer from theory to practice; and iii) specific insights and experiences from using constructive align...

We develop a 2-categorical theory for recursively defined domains. In particular, we generalise the traditional approach based on order-theoretic structures to categorytheoretic ones. A motivation for this development is the need of a domain theory for concurrency, with an account of bisimulation. Indeed, the leading examples throughout the paper are provided by recursively defined presheaf mod...

Adhesive categories have recently been proposed as a categorical foundation for facets of the theory of graph transformation, and have also been used to study techniques from process algebra for reasoning about concurrency. Here we continue our study of adhesive categories by showing that toposes are adhesive. The proof relies on exploiting the relationship between adhesive categories, Brown an...

HOLCF is the de nitional extension of Church s Higher Order Logic with Scott s Logic for Computable Functions that has been implemented in the theorem prover Isabelle This results in a exible setup for reasoning about functional programs HOLCF supports stan dard domain theory in particular xpoint reasoning and recursive domain equations but also coinductive arguments about lazy datatypes This p...

This paper introduces a new direction in formalizing sociological models. Sociological theories are a field of application for computer science, hence sociologists describe a theory in informal ways. These theories are transformed into computational models which can be studied and investigated with formal methods. We have chosen to formalize a common model of sociological theory, the Garbage Ca...