How to Use the Serializability Theorem
Characterize the set of histories that a concurrency control algorithm allows
Prove that any such history must have an acyclic serialization graph.
Therefore, the algorithm guarantees SR executions.
We’ll use this soon to prove that locking produces serializable executions.