We show that the stability number (independence number) of an infinite graph is the optimal solution of some infinite dimensional copositive program. For this a duality theory between the primal convex cone of copositive kernels and the dual convex cone of completely positive measures is developed. We compare this new theory with the well known approach on finite graphs and point out the main differences between the finite and infinite setting.