Complete CALM: A Coordination Criterion for Specifications
Abstract
The CALM theorem connects coordination-freedom to monotonicity, but is tied to relational transducers and set-inclusion growth. We generalize it to arbitrary concurrent specifications. A specification maps execution histories to outcome sets under a declared refinement order; we prove it admits coordination-free implementation if and only if its outcomes are monotone (Complete CALM). The criterion subsumes CALM, CRDTs, I-confluence, and HATs as instances, enables verification of proper coordination, and yields a Complete CAP companion: a specification admits a consistent, available, partition-tolerant implementation if and only if it is distributed-monotone.
0