You can use Rice's theorem[1], which is a generalized version of the Halting problem.
I don't believe this proves that programming can't be automated, though. Humans too aren't able to prove completely that what they write is correct, it doesn't stop them from making programs.