5.2 Serializability Theory
The theory is based on modeling executions as histories, such as H1 = r1[x] r2[x] w1[x] c1 w2[y] c2
First, characterize a concurrency control algorithm by the properties of histories it allows.
Then prove that any history having these properties is SR
Why bother? It helps you understand why concurrency control algorithms work.