Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/14567
Title: | On the CRON Conjecture | Authors: | AMELOOT, Tom VAN DEN BUSSCHE, Jan |
Issue Date: | 2012 | Publisher: | Springer | Source: | Barceló, Pablo; Pichler, Reinhard (Ed.). Datalog in Academia and Industria, p. 44-55 | Series/Report: | Lecture Notes in Computer Science | Abstract: | Declarative networking is a recent approach to programming distributed applications with languages inspired by Datalog. A recent conjecture posits that the delivery of messages should respect causality if and only if they are used in non-monotone derivations. We present our results about this conjecture in the context of Dedalus, a Datalog-variant for distributed programming. We show that both directions of the conjecture fail under a strong semantical interpretation. But on a more syntactical level, we can show that positive Dedalus programs can tolerate non-causal messages, in the sense that they compute the correct answer even when messages can be sent into the past. | Keywords: | Dedalus; Datalog; CRON conjecture; non-causality | Document URI: | http://hdl.handle.net/1942/14567 | ISBN: | 978-3-642-32924-1 | DOI: | 10.1007/978-3-642-32925-8_6 | Category: | C1 | Type: | Proceedings Paper |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
cron.pdf | Peer-reviewed author version | 578.91 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
4
checked on Sep 2, 2020
Page view(s)
20
checked on Sep 6, 2022
Download(s)
12
checked on Sep 6, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.