We describe a simple tree-correction theorem that states that any loca
lly checkable protocol that works on a tree can be efficiently stabili
zed in time proportional to the height of the tree. We show how new pr
otocols can be designed, and how existing work can be easily understoo
d using this theorem.