Specifying Reusable Components Using Contracts

摘要: Contracts were introduced by Helm et al. as a high level construct for explicitly specifying interactions among groups of objects. This paper describes further developments and application the Contract construct. We show how can be used to represent classic algorithms large grained reusable object oriented abstractions, these customized through refinement they are reused conformance. The example algorithm throughout is graph depth first traversal algorithm. represented which then refined specify number connected regions graphs check cycles. Changes language we discuss some new problems resulting from simultaneous reuse related contracts.