[PRL] Reminder: Torture Chamber TODAY @ 1pm in 366 WVH

[Jonathan Schuster]

Please come torture me this afternoon at 1 in 366.

Abstract:

Programmers often code up asynchronous message-passing systems as
communicating finite-state actors. An actor in some state listens for
messages, responds to those messages, and transitions to another state.
Most of these systems allow messages to carry actor addresses.

This paper presents a kernel language for implementing and specifying such
systems. A specification consists of finite-state machines, expressing what
kind of messages each component should expect and what kind of actions it
should take in response. In addition, a specification may prescribe how a
component may use an address received from a message as well as how a
component handles inputs on addresses that it sends out. Finally, a
conformance relation articulates when an implementation meets such a
specification.
-------------- next part --------------
HTML attachment scrubbed and removed