A logical framework for software proof reuse

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