A promising new application domain for coordination languages is programming protocols among threads in multi-core programs: coordination languages typically provide high-level constructs and abstractions that more easily compose into correct---with respect to a programmer's intentions---protocol specifications than do low-level synchronization constructs provided by conventional languages (e.g., locks, semaphores, etc …
read moreOther presentations
Code Generation for Reo: Dealing with data constraints (work-in-progress)
In ongoing work, we develop a code generator for Reo connectors. Our current tool works by computing the formal semantics of a connector as a constraint automaton (CA) and then translating that CA to Java code. This approach requires us to deal with data constraints (i.e., transition labels of …
read moreModularizing and Specifying Protocols among Threads
We identify two problems with general-purpose programming languages: (i) they do not enforce separation of computations and protocols and (ii) they do not provide an appropriate level of abstraction to implement protocols. To mend these deficiencies, we argue for the use of domain-specific languages (DSL). A concrete instance then demonstrates …
read moreReo: Basics and Semantics
Over the past decades, coordination languages have emerged for the specification and implementation of interaction protocols for communicating software entities. This class of languages includes Reo, a platform for compositional construction of connectors. This talk comprises an introduction to Reo. It starts with an example that motivates the use of …
read moreModel checking GOAL agents
As the theoretical foundations of agent-oriented programming became better understood by the end of the 1990s, researchers became interested in model checking agent programs. Model checking, introduced by the late 1970s, is a technique for establishing automatically whether a system satisfies a given specification. Although progress has been made over …
read more
Page 1 / 1