Confluence analysis for distributed programs: a model-theoretic approach

Datalog, pp. 135-147, 2012.

Cited by: 18|Bibtex|Views19|DOI:https://doi.org/10.1007/978-3-642-32925-8_14
EI
Other Links: dblp.uni-trier.de|dl.acm.org|academic.microsoft.com

Abstract:

Building on recent interest in distributed logic programming, we take a model-theoretic approach to analyzing confluence of asynchronous distributed programs. We begin with a model-theoretic semantics for Dedalus and introduce the ultimate model, which captures non-deterministic eventual outcomes of distributed programs. After showing the...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments