@inbook {IOPORT.06106025,
    author       = {Marczak, William R. and Alvaro, Peter and Conway, Neil and Hellerstein, Joseph M. and Maier, David},
    title        = {Confluence analysis for distributed programs: a model-theoretic approach.},
    year         = {2012},
    booktitle    = {Datalog in academia and industry. Second international workshop, Datalog 2.0, Vienna, Austria, September 11--13, 2012. Proceedings},
    isbn         = {978-3-642-32924-1},
    pages        = {135-147},
    publisher    = {Berlin: Springer},
    doi          = {10.1007/978-3-642-32925-8_14},
    abstract     = {Summary: 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 question of confluence undecidable for Dedalus, we identify restricted sub-languages that guarantee confluence while providing adequate expressivity. We observe that the semipositive restriction Dedalus$ ^{ + }$ guarantees confluence while capturing PTIME, but show that its restriction of negation makes certain simple and practical programs difficult to write. To remedy this, we introduce Dedalus $^{S }$, a restriction of Dedalus that allows a kind of stratified negation, but retains the confluence of Dedalus$ ^{ + }$ and similarly captures PTIME.},
    identifier   = {06106025},
}