At a high-level Reo can be seen as a graphical language for specifying a number of properties of component connectors: synchronisation and exclusion constraints between components; protocols or schedules by which components abide; and data flow between the components. Unfortunately, Reo itself is not flexible enough to use as the …
read moreInnovation in the Practice of Computer Science Education to follow Bologna
The "adoption of a system of easily readable and comparable degrees" stated in the Bologna declaration, requires, from higher education institutions, a move towards innovative student-centred approaches which align course units planning, teaching and assessment. This presentation, by a member of the staff team -- the students tutor, reports and reviews …
read morePointwise-Pointfree Transformations
There are several programming styles in functional programming, and none is considered to be the best. Two opposite styles are, for example, pointwise and pointfree, that can be differentiated mainly by the use of variables in the first case, and their inexistence in the second one. In this project a …
read moreMoCha-pi, an Exogenous Coordination Calculus (SAC try-out)
This talk is a try-out for the coordination-track session of the SAC2005 conference in Santa Fe,NM,USA. Therefore, we give a 20 minutes talk (which for sure will be extended by the many questions from the audience), plus that we hand out a copy of the paper.
A short …
read moreClosure Properties of Coalgebra Automata
Coalgebra automata are finite automata that operate on (possibly) infinite objects which are represented as pointed coalgebras. Examples from the literature such as automata on infinite words, trees and graphs can be seen as coalgebra automata.
In my talk I will first recall the definition of a coalgebra automaton. Then …
read moreReo Engine - Implementable Semantics for Reo
We have been developing a semantic model for Reo that allows us to calculate the behaviour of general Reo circuits. The resulting semantic model can also be used to capture the behaviour of circuits which express priority or other context sensitive behaviour.
The semantic model will be presented using an …
read moreOMEGA case study: Mission-critical air-borne system, UML modelling, and formal verification experiments
Within the scope of the OMEGA project several industrial case studies are being performed in order to apply the OMEGA techniques and tools to UML modelling and specification of the real-time embedded systems to enable formal verification of the UML models. In this talk the case study of the mission-critical …
read moreWeb Service - Current technological and market situation
Major players in the software industry push Web Services as the next de-facto standard for doing e-business. In this talk I will make an overview of the market and technological maturity of Web Services at the moment. I will also discuss some projections about the direction developments in Web Service …
read moreApplications of XML transformations
In this ACG presentation we will show how we applied XML transformation techniques to models. There will be example models from Enterprise Architectures and from UML.
First we will show a transformation technique developed at CWI: the Rule Markup Language (RML) and its tools.
After that there will be 2 …
read moreReasoning about Reo's Reconfiguration Mechanisms
From a semantic perspective, the reconfiguration features of Reo have not yet been explored. This talk presents their semantics in terms of sequences of constraint automata. In addition, a logic for reasoning about Reo connectors in the presence of reconfiguration is described. Interestingly, the logic is decideable, although its underlying …
read more