Speculative execution is a well-known technique that allows for the optimization of concurrent systems. In this talk, we explore an extension to Reo that allows reasoning about speculations, and introduce a semantics based on a logical framework with data types and data streams. Our semantics has the capability to detect …read more
In this talk we relate Reo to some fundamental results in computer science.
In 1951, S.C. Kleene detailed the construction of nerve nets, and characterized their behavior in terms of events occurring within a finite frame of time. He then proved that regular events are exactly the events generated …read more
Gossip protocols are concerned with the spread of knowledge in a social network. They aim at arriving, by means of point-to-point or group communications, at a situation in which all agents know each other secrets.
We consider distributed gossip protocols that are expressed in a simple programming language that employs …read more
Actor-based models of computation in general assume a run-to-completion mode of execution of the messages. The Abstract Behavioral Specification (ABS) Language extends the Actor-based model with a high-level synchronization mechanism which allows actors to suspend the execution of the current message and schedule in a cooperative manner another queued message …read more
Reo is an interaction-centric model of concurrency for compositional specification of communication and coordination protocols. Recently, Jongmans developed techniques to compile Reo protocols into executable code. Benchmarks show that compilation of Reo protocols can produce code whose performance is comparable or even beats that of hand-crafted programs. Unfortunately, Jongmans' techniques …read more
In this talk we will combine the study of NetKAT with the study of dynamic gossip. The talk is largely based on my master thesis, but as I am currently working on this will also contain some work in progress and loose ends. NetKAT is a sound and complete network …read more
Today's formal methods are proof and type systems.read more
As appetite, we give a very broad outline of interactive theorem proving and a perspective on software correctness of distributed systems.
As starter, we consider freely generated algebraic structures, such as (several varieties of) monoids: CM, PCM, ICM.
The main course of …
The actor-based language studied in this research features asynchronous method calls and supports coroutines which allow for the cooperative scheduling of the method invocations belonging to an actor. We model the local behavior of an actor as a well-structured transition system by means of predicate abstraction and derive the decidability …read more
Most parallel applications leave the scheduling problem of their constituent processes to a general purpose scheduler, such as an operating system scheduler. Generally, constituent processes of a parallel application interact. For example, one process interacts with another by using its produced data. These interactions of processes introduce dependencies amongst them …read more
Page 1 / 29 »