J.-J. Jeng and B. H. C. Cheng, "Reusing Analogous Components," IEEE Transactions on Knowledge and Data Engineering, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Integrating Informal And Formal Techniques To Reverse Engineer.. - Gannod (1998) (Correct)
.... and Software Reuse Many approaches have been suggested for the retrieval of components from reusable component libraries, ranging from classification of search criteria [19, 20] to retrieval [31, 32, 33] and library structuring [34] Jeng and Cheng describe the use of analogy and generality [18, 35] as the basis for matching functions. Zaremski and Wing have proposed a technique for signature [21] and specification matching [19] Fischer et al. have described an approach for retrieval of reusable components using filters to narrow the search spaces [32, 33] The approach described in this ....
....a software system using existing software components. Formal approaches to software reuse rely heavily upon specification matching criterion, where a search query using formal specifications is used to search a library to identify components that can be used for reuse purposes. Jeng and Cheng [35, 31] addressed the use of formal methods and component libraries to support software reuse, and Chen and Cheng [52, 53] investigated the construction of software based on architectural specifications. One of the primary difficulties of using a formal approach for software reuse that makes use of ....
J.-J. Jeng and B. H. C. Cheng, "Reusing Analogous Components," IEEE Transactions on Knowledge and Data Engineering, 1996.
Reusing Analogous Components - Cheng, Jeng (1994) (1 citation) Self-citation (Jeng Cheng) (Correct)
....used directly for the implementation of the query specification. Numerous software reuse projects have explored the use of analogy and other similarity based techniques to determine software reuse. Due to space constraints, the descriptions of the projects are not given here, but may be found in [22]. This paper describes a new approach to retrieving components based on analogies between existing and query specifications. This paper describes a new approach to modifying retrieved components based on analogies between existing and query specifications. Analogical relationships between the ....
....n )g. For each pair of commutative operators ff and fi, the matching process generates two subproblems. Hence, this algorithm s upper bound is minflevel(ff) level(fi)g Theta 2 minflevel(ff) level(fi)g : For further details regarding the complexity analysis of the algorithsm, please see [22]. In Algorithm Match Term, Case 5 always generates two sets of analogical matches because, currently, the operators that are able to generate or branch subproblems are commutative and they consist of only two arguments. We assume that Case 6 of Algorithm Match Term transforms the input terms to ....
J.-J. Jeng and B. H. C. Cheng, "Reusing analogous components," Technical Report MSUCPS -94-28, Michigan State University, Department of Computer Science, A714 Wells Hall, East Lansing, MI 48824-1027, April 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC