The coroutine model of computation

Authors:
Chris Shaver;Edward A. Lee
Affiliations:
EECS Department, University of California, Berkeley;EECS Department, University of California, Berkeley
Venue:
MODELS'12 Proceedings of the 15th international conference on Model Driven Engineering Languages and Systems
Year:
2012

Citing 5
Cited 0

Statecharts: A visual formalism for complex systems

Science of Computer Programming
Reactive C: an extension of C to program reactive systems

Software—Practice & Experience
A denotational semantics for stateflow

Proceedings of the 5th ACM international conference on Embedded software
42: programmable models of computation for a component-based approach to heterogeneous embedded systems

GPCE '07 Proceedings of the 6th international conference on Generative programming and component engineering
Computing SyncCharts Reactions

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a general denotational formalism called the Coroutine Model of Computation for control-oriented computational models. This formalism characterizes atomic elements with control behavior as Continuation Actors, giving them a static semantics with a functional interface. Coroutine Models are then defined as networks of Continuation Actors, representing a set of control locations between which control traverses during execution. This paper gives both a strict and non-strict denotational semantics for Coroutine Models in terms of compositions of Continuation Actors and their interfaces. In the strict form, the traversal of control locations forms a control path producing output values, whereas in the non-strict form, execution traverses a tree of potential control locations producing partial information about output values. Furthermore, the given non-strict form of these semantics is claimed to have useful monotonicity properties.