On the CRON conjecture

Authors:
Tom J. Ameloot;Jan Van den Bussche
Affiliations:
Hasselt University, Hasselt, Belgium,Transnational University of Limburg, Belgium;Hasselt University, Hasselt, Belgium,Transnational University of Limburg, Belgium
Venue:
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Year:
2012

Citing 16
Cited 1

Fairness

Fairness
Stable models and non-determinism in logic programs with negation

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Distributed Computing: Fundamentals, Simulations and Advanced Topics

Distributed Computing: Fundamentals, Simulations and Advanced Topics
Fairness and hyperfairness

Distributed Computing
Verification of communicating data-driven web services

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Operational Semantics for Declarative Networking

PADL '09 Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages
Declarative networking

Communications of the ACM - Scratch Programming for All
Datalog redux: experience and conjecture

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The declarative imperative: experiences and conjectures in distributed logic

ACM SIGMOD Record
A rule-based language for web data management

Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Relational transducers for declarative networking

Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Netlog, a rule-based language for distributed programming

PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
Dedalus: datalog in time and space

Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Deciding eventual consistency for a simple class of relational transducer networks

Proceedings of the 15th International Conference on Database Theory
Win-move is coordination-free (sometimes)

Proceedings of the 15th International Conference on Database Theory

Relational transducers for declarative networking

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

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 when messages can be sent into the past.