[prev in list] [next in list] [prev in thread] [next in thread] 

List:       e-lang
Subject:    [e-lang] Establishing data race and deadlock freedom for communicating event loops
From:       Tom Van Cutsem <tomvc.be () gmail ! com>
Date:       2014-05-21 19:35:44
Message-ID: CAKDfNj8F-nFjmKzhP8Ym5QCNEg+=TaBTVRjNdO6crUFvEt1O-w () mail ! gmail ! com
[Download RAW message or body]

[Attachment #2 (multipart/alternative)]


Hi,

Some of you may have heard of AmbientTalk, an actor language I designed
with colleagues at the university of Brussels that was strongly inspired by
E, but with a focus on ad hoc wireless networks.

We recently published a new article on AmbientTalk with what we believe is
the first formal account of the communicating event loops model, upon which
both E and AmbientTalk are based.
The article gives a comprehensive overview of AmbientTalk's roots, the
language itself, and introduces a "featherweight AmbientTalk" calculus with
an operational semantics. We use it to establish data race freedom
(actors/vats have isolated memory) and deadlock freedom (assuming all event
loop turns are finite, all asynchronous messages will eventually be
processed, or translated to E: eventually sent messages never get stuck in
a vat's event loop queue).
For those interested, a preprint of the article is available here:<
http://soft.vub.ac.be/Publications/2014/vub-soft-tr-14-06.pdf>
Cheers,Tom

[Attachment #5 (text/html)]

<div dir="ltr">Hi,<div><br></div><div>Some of you may have heard of AmbientTalk, an \
actor language I designed with colleagues at the university of Brussels that was \
strongly inspired by E, but with a focus on ad hoc wireless networks.</div> \
<div><br>We recently published a new article on AmbientTalk with what we believe is \
the first formal account of the communicating event loops model, upon which both E \
and AmbientTalk are based.<br>The article gives a comprehensive overview of \
AmbientTalk's roots, the language itself, and introduces a "featherweight \
AmbientTalk" calculus with an operational semantics. We use it to establish data race \
freedom (actors/vats have isolated memory) and deadlock freedom (assuming all event \
loop turns are finite, all asynchronous messages will eventually be processed, or \
translated to E: eventually sent messages never get stuck in a vat&#39;s event loop \
queue).<br> For those interested, a preprint of the article is available here:&lt;<a \
href="http://soft.vub.ac.be/Publications/2014/vub-soft-tr-14-06.pdf">http://soft.vub.ac.be/Publications/2014/vub-soft-tr-14-06.pdf</a>&gt;<br>Cheers,Tom</div>
 </div>



_______________________________________________
e-lang mailing list
e-lang@mail.eros-os.org
http://www.eros-os.org/mailman/listinfo/e-lang


[prev in list] [next in list] [prev in thread] [next in thread]