NP-completeness for automatic fence placement between two specified instructions in the presence of arbitrary goto statements. Reduction is from negation free 2-SAT to control flow graphs for real programs.

Didn't make it into my first paper, hopefully will end up in my thesis :)