We describe a logical framework PR for verification of reusable software components. Within our system, developers can employ the advantages traditionally as-sociated with software reuse to reduce the cost of soft-ware verification by reusing abstract proofs and specifications. One can construct an algorithm with pa-rameters, a specification with parameters, and a proof that the algorithm satisfies the specification provided the parameters satisfy certain conditions, Proofs in PR will themselves contain parameters for subproofs concerning those conditions. In this framework, typ-ing, type checking, and proof checking are decidable. 1