Positive Dedalus programs tolerate non-causality

作者：

Highlights：

• We provide an initial investigation of the CRON conjecture by J.M. Hellerstein.

• This conjecture relates causality of message delivery to program monotonicity.

• We formalize the conjecture for the language Dedalus, that is inspired by Datalog.

• We show that positive programs remain correct when messages are sent into the past.

摘要

•We provide an initial investigation of the CRON conjecture by J.M. Hellerstein.•This conjecture relates causality of message delivery to program monotonicity.•We formalize the conjecture for the language Dedalus, that is inspired by Datalog.•We show that positive programs remain correct when messages are sent into the past.

论文关键词：Declarative networking,Causality,Asynchronous communication

论文评审过程：Received 11 February 2013, Revised 7 January 2014, Accepted 24 January 2014, Available online 3 February 2014.

论文官网地址：https://doi.org/10.1016/j.jcss.2014.01.005