November 2015 archive

Consistent asynchronous distributed programs: POPL’16 paper, demo

Asynchronous replication is available and fast, but what about consistency? We propose a logic for showing that such a program maintains its invariants. We implemented the rule in a static analysis tool and ran a few interesting examples. See the video of the tool and the paper to appear at POPL 2016: ‘Cause I’m Strong …

Continue reading