Generic Computation and its complexity
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Fundamental properties of deterministic and nondeterministic extensions of Datalog
Selected papers of the workshop on Deductive database theory
Datalog extensions for database queries and updates
Journal of Computer and System Sciences
Finite representation of infinite query answers
ACM Transactions on Database Systems (TODS)
Computing with first-order logic
Selected papers of the 23rd annual ACM symposium on Theory of computing
On Datalog vs. polynomial time
Journal of Computer and System Sciences
Languages, automata, and logic
Handbook of formal languages, vol. 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
Abstract state machines and computationally complete query languages
Information and Computation
Verification of relational transducers for electronic commerce
Journal of Computer and System Sciences - Special issue on PODS 2000
Distributed Computing: Fundamentals, Simulations and Advanced Topics
Distributed Computing: Fundamentals, Simulations and Advanced Topics
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
Automatic verification of data-centric business processes
Proceedings of the 12th International Conference on Database Theory
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
Recent advances in declarative networking
PADL'12 Proceedings of the 14th international conference on Practical Aspects of Declarative Languages
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
BloomUnit: declarative testing for distributed programs
DBTest '12 Proceedings of the Fifth International Workshop on Testing Database Systems
Logic and lattices for distributed programming
Proceedings of the Third ACM Symposium on Cloud Computing
Distributed programming and consistency: principles and practice
Proceedings of the Third ACM Symposium on Cloud Computing
Datalog 2.0'12 Proceedings of the Second international conference on Datalog in Academia and Industry
Confluence analysis for distributed programs: a model-theoretic approach
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)
Proceedings of the 4th annual Symposium on Cloud Computing
Hi-index | 0.00 |
Motivated by a recent conjecture concerning the expressiveness of declarative networking, we propose a formal computation model for "eventually consistent" distributed querying, based on relational transducers. A tight link has been conjectured between coordination-freeness of computations, and monotonicity of the queries expressed by such computations. Indeed, we propose a formal definition of coordination-freeness and confirm that the class of monotone queries is captured by coordination-free transducer networks. Coordination-freeness is a semantic property, but the syntactic class of "oblivious" transducers we define also captures the same class of monotone queries. Transducer networks that are not coordination-free are much more powerful.