Signature matching
- 1 April 1995
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
- Vol. 4 (2) , 146-170
- https://doi.org/10.1145/210134.210179
Abstract
Signature matching is a method for organizing, navigating through, and retrieving from software libraries. We consider two kinds of software library 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 exact match but also various flavors of relaxed match. We describe various applications of signature matching as a tool for using software libraries, inspired by the use of our implementation of a function signature matcher written in Standard ML.Keywords
This publication has 9 references indexed in Scilit:
- Specification matching of software componentsPublished by Association for Computing Machinery (ACM) ,1995
- A framework for source code search using program patternsIEEE Transactions on Software Engineering, 1994
- Larch: Languages and Tools for Formal SpecificationPublished by Springer Nature ,1993
- Computing similarity in a reuse library systemACM Transactions on Software Engineering and Methodology, 1992
- Type isomorphisms in a type-assignment frameworkPublished by Association for Computing Machinery (ACM) ,1992
- Integrating information retrieval and domain specific approaches for browsing and retrieval in object-oriented class librariesPublished by Association for Computing Machinery (ACM) ,1991
- An information retrieval approach for automatically constructing software librariesIEEE Transactions on Software Engineering, 1991
- Classification of reusable modulesPublished by Association for Computing Machinery (ACM) ,1989
- The inscape environmentPublished by Association for Computing Machinery (ACM) ,1989