Other presentations

  1. Well-Founded Unions

    Given two or more well-founded binary relations, when can one be certain that their union is likewise well-founded? We provide conditions for an arbitrary number of relations, generalizing known conditions for two relations, along with counterexamples to several potential weakenings. Such conditions may be useful for proving termination of rewrite …

    read more
  2. Reproducible Simulations, Trace Visualization and Model Exploration with Dynamic Partial Order Reduction in Real-Time ABS

    Local traces are our means for recording and (deterministically) replaying Real-Time ABS models. The traces capture communication between actors in a model, and a tool has been developed for visualizing them. From a given trace, we can generate new traces, that can be executed by the Real-Time ABS simulator; doing …

    read more
  3. Formalizing the Semantics of Concurrent Revisions

    Concurrent revisions is a concurrency control model developed by Microsoft Research. It has many interesting properties that distinguish it from other well-known models such as transactional memory. One of these properties is determinacy: programs written within the model always produce the same outcome, independent of scheduling. The concurrent revisions model …

    read more
  4. Nerve Nets, Omega-regular Languages, and Reo

    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
  5. A Scala Library for Actor-Based Cooperative Scheduling

    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
  6. Compilation of Reo protocols

    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

Page 1 / 29 »

hosted by