The notion of Abstract Data Type (ADT) has served as a foundation model for structured and object-oriented programming for some thirty years. An ADT defines an algebra of operations with well-defined semantics, without specifying any detail about the implementation of those operations or the data structures they operate on to …
read moreCombining the Activator, Manifold, and... A Road to the future?
Very recently, Adaptive Planet (AP), a privately owned company, teamed up with CWI to combine AP's technology, the Activator, with the work done by Dr. Farhad Arbab and his team, Manifold.
In the first part of this talk the Activator technology will be presented. The Acticator is a strict and …
read more(Co-)Algebraic semantics of Modal Logic
The main part of the talk will be an overview over some basic notions of modal logic. This will include Kripke semantics, algebraic semantics and a comparison of the two. The notion of a (descriptive) general frame is used to combine these two approaches. We then will show how one …
read moreVerification of Sequential Java Programs: A Computer-Aided Approach
In this talk, I will present joined work with Frank de Boer on the verification of Java Programs. After an introduction in the theory of verification for object-oriented programs, I will demonstrate a tool that supports the verification of Java programs.
read moreCoordination-Based Cooperation of Constraint Solvers in DICE
DICE (DIstributed Constraint Environment) is a software framework, implemented using the Manifold coordination language, for constructing distributed constraint solvers from software components in a number of predefined categories. One of these component categories contains incomplete constraint solvers, that can act as a domain reduction operator inside a constraint propagation algorithm …
read moreProbabilistic GSOS
In this talk we present the content of a forthcoming CWI technical report, which introduces and discusses an operator specification format for labelled probabilistic transition systems. Because of its similarity to the known GSOS rules for nondeterministic systems, the format is called probabilistic GSOS. Early this year, we have already …
read moreFully abstract semantics for OO
The presentation is a part of the MobiJ project meeting.
In this talk we will discuss our ongoing work concerning the problem of a fully abstract semantics for object-oriented languages and its relation with components.
read moreA Framework for Visualizing and Simulating Reo
In this talk we present a tool designed to simulate Reo, a channel-based coordination calculus for component composition. We begin with a short recapitulation of Reo, and discuss the fundamental issues that define it. Then we explain the structure of the tool; particularly the separation between the GUI- and the …
read moreThe OMEGA Component Model - part 2
CWI defined a formal model of components in terms of the basic object-oriented concepts of the OMEGA kernel language. More specifically, the CWI developed a representation in the OMEGA kernel model of both the internal and the external view of a component. With the external or blackbox view of a …
read moreO2C: A Semantic Thread From Objects to Components
In this tutorial we present the basic concepts that underlie object oriented and component based software engineering and their semantic justifications. We start with the basic concepts such as abstract data types and inheritance, as used in the object oriented paradigm to enhance reuse, modularity, and maintenance of software. We …
read more