Please use this identifier to cite or link to this item:
|Title:||A Declarative Semantics for Dedalus||Authors:||Alvaro, Peter
Ameloot, Tom J.
Hellerstein, Joseph M.
Marczak, William R.
Van den Bussche, Jan
|Issue Date:||2013||Abstract:||The language Dedalus is a Datalog-like language in which distributed computations and networking protocols can be programmed, in the spirit of the Declarative Networking paradigm. Whereas recently formal operational semantics for Dedalus-like languages have been developed, a purely declarative semantics has been lacking so far. The challenge is to capture precisely the amount of nondeterminism that is inherent to distributed computations due to concurrency, networking delays, and asynchronous communication. This paper shows how a declarative semantics can be obtained by simply using the well-known stable model semantics for Datalog with negation. This semantics is applied to the Dedalus rules after they are modified to account for nondeterministic arrival times of messages, and augmented with control rules which model causality. The main result then is that, as far as fair operational runs are concerned, the proposed declarative semantics matches exactly the previously proposed formal operational semantics.||Keywords:||Dedalus; Datalog; distributed system; asynchronous communication; causality; operational semantics; declarative semantics;||Document URI:||http://hdl.handle.net/1942/14572||Category:||R2||Type:||Research Report|
|Appears in Collections:||Research publications|
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.