Storing and retrieving software components: a refinement based system
ICSE '94 Proceedings of the 16th international conference on Software engineering
Modelling Formal Integrated Component Retrieval
ICSR '98 Proceedings of the 5th International Conference on Software Reuse
Automated harvesting of test oracles for reliability testing
COMPSAC-W'05 Proceedings of the 29th annual international conference on Computer software and applications conference
Towards a methodology for component-driven design
RISE'04 Proceedings of the First international conference on Rapid Integration of Software Engineering Techniques
Hi-index | 0.00 |
Software reuse is only effective if it is easier to locate (and appropriately modify) a reusable component than to write it from scratch. We present signature matching as a method for achieving this goal by using signature information easily derived from the component. We consider two kinds of software components, functions and modules, and hence two kinds of matching, function matching and module matching. The signature of a function is simply its type; the signature of a module is a multiset of user-defined types and a multiset of function signatures. For both functions and modules, we consider not just @i(exact) match, but also various flavors of relaxed match. We briefly describe an experimental facility written in Standard ML for performing signature matching over a library of ML functions.