The fundamental theorem of the classical serializability theory states the necessary and
sufficient conditions for the conflict serializability of an execution. In this paper, we extend the
correctness criteria of the classical theory by presenting a definition of conflict serializability
for concurrency control of nested transactions. We define a serialization graph for nested
transactions and we prove that its acyclicity is a sufficient and necessary condition for conflict
serializability.