Deciding eventual consistency for a simple class of relational transducer networks

Authors:
Tom J. Ameloot;Jan Van den Bussche
Affiliations:
Hasselt University & Transnational University of Limburg, Diepenbeek, Belgium;Hasselt University & Transnational University of Limburg, Diepenbeek, Belgium
Venue:
Proceedings of the 15th International Conference on Database Theory
Year:
2012

Citing 14
Cited 3

Relational transducers for electronic commerce

Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Verification of relational transducers for electronic commerce

Journal of Computer and System Sciences - Special issue on PODS 2000
Verification of communicating data-driven web services

Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Specification and verification of data-driven Web applications

Journal of Computer and System Sciences
Eventually consistent

Communications of the ACM - Rural engineering development
Operational Semantics for Declarative Networking

PADL '09 Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages
Automatic verification of data-centric business processes

Proceedings of the 12th International Conference on Database Theory
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

Win-move is coordination-free (sometimes)

Proceedings of the 15th International Conference on Database Theory
On the CRON conjecture

Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Relational transducers for declarative networking

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Networks of relational transducers can serve as a formal model for declarative networking, focusing on distributed database querying applications. In declarative networking, a crucial property is eventual consistency, meaning that the final output does not depend on the message delays and re-orderings caused by the network. Here, we show that eventual consistency is decidable when the transducers satisfy some syntactic restrictions, some of which have also been considered in earlier work on automated verification of relational transducers. This simple class of transducer net-works computes exactly all distributed queries expressible by unions of conjunctive queries with negation.