Verifying the reusability of software component specifications: Framework and algorithms

Abstract

This paper presents a solution to a maintenance problem arising when reusing software components developed for one domain in software structures in a similar domain. Object structures are directed graphs where edges are either inheritance or client-server associations, and nodes are abstract data types. The formal logic for abstract data types used in the formal method is first-order predicate logic, and the proof system uses natural deductive logic. This logic and proof system is the background formal logic system, and the semantic part of each object definition uses this formal logic system. A solution to the reusability problem is presented using the new properties of inheritance relation in copyable and out copyable, as well as client-server fan in copyable and fan out copyable. This solution to the reusability problem is presented by means of an effective method using a framework for identifying and assessing defects in a given object-oriented structure. Several different kinds of formal logic defects are identified which can occur during reusing of object definitions represented as abstract data types in object-oriented structures. An algorithmic implementation corresponding to each formal specification reusability theorem is presented, and the performance of each algorithmic case is discussed. The algorithms are efficient.