Representing reductions of NP-complete problems in logical frameworks: a case study