The Abstract State Machines (ASMs) theory has been applied to formalize in a rigorous mathematical manner the semantics of the C programming language. We have extended the C ASM model, in order to handle C 2.0 specific features like generics, anonymous methods and iterator blocks. We found out that the existing operational model (the dynamic semantics) can be reused entirely (it is not altered after the integration of the new constructions). But, obviously, the static semantics suffered some important modifications.