Specification matching for software reuse

Jeng, Jun-Jang; Cheng, Betty H. C.

doi:10.1145/211782.211817

Cited by 58 publications

(21 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The filtering algorithm shows that the combination of linguistic and signature algorithms can result in higher precision than if the algorithms were used individually. This is in step with the intuitive argument that has been made before [22,6,4].…”

Section: Qomym Match Qualitysupporting

confidence: 69%

“…Many techniques ranging from keyword-based to full-fledged specification-based heuristics have been proposed in the literature [7,12,8,21,22,6,4] to provide effective retrieval of qualified components during the discovery process. The keyword-based approach [7] is simple and flexible as users simply specify the query as a set of keywords representing the component requirements in which they are interested.…”

Section: Introductionmentioning

confidence: 99%

“…These methods have the same signature but encode different behaviors. The specification matching approach [22,6], introduced to overcome the problem of signature matching, uses the method's pre-and post-conditions that capture the functionality of the method. While specification matching provides more accurate hits, it is too time-consuming to be practical as its implementation, often based on theorem proving techniques, is expensive [4].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Finding a Needle in the Haystack: A Technique for Ranking Matches Between Components

Tansalarak

Claypool

2005

Component-Based Software Engineering

View full text Add to dashboard Cite

Abstract. Searching and subsequently selecting reusable components from component repositories has become a key impediment for not only component-based development but also for achieving the overall usability of component development environments and the ultimate re-usability of the components themselves. Component matching, a fundamental aspect of the component search problem, has been a well-studied problem, resulting in many different matching techniques such as keyword, facet, signature and specification matching techniques. However, each matching technique individually applied for component search often yields a small or large number of (sometimes irrelevant) hits. In this paper, we propose a disciplined combination of the different matching techniques to provide a ranked set of highly qualified components from component repositories. Our work is based on a unique Quality of Match (QoM) metric that measures the overall "goodness" of the match between two given components. In particular, we provide qualitative and quantitative analysis to evaluate the QoM of two given components based on component information. Moreover, we present QoMym, a QoM-based hybrid match algorithm, that combines the strengths of different matching techniques and provides higher accuracy than existing matching techniques.

show abstract

Section: Qomym Match Qualitysupporting

confidence: 69%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Finding a Needle in the Haystack: A Technique for Ranking Matches Between Components

Tansalarak

Claypool

2005

Component-Based Software Engineering

View full text Add to dashboard Cite

show abstract

“…A number of techniques have been used for indicating desired functionality for reuse, including signature matching [10], and specification matching [6]. Signature matching and specification matching both place a high burden on the developer to provide precise input; both approaches either will fail to retrieve pertinent source code if exact but inappropriate details are provided, or will retrieve an excessive number of results, demanding laborious examination by the developer.…”

Section: Related Workmentioning

confidence: 99%

An Assessment of Test-Driven Reuse: Promises and Pitfalls

Nurolahzade

Walker

Maurer

2013

Safe and Secure Software Reuse

View full text Add to dashboard Cite

Abstract. Test-driven reuse (TDR) proposes to find reusable source code through the provision of test cases describing the functionality of interest to a developer. Proponents claim that their TDR approaches work well. This paper presents the results of an experiment to evaluate the ability of state-of-the-art TDR tools to locate reusable source code for realistic tasks. We find that non-trivial functionality, like that needed in the daily tasks of developers, can largely not be retrieved by these approaches. We provide an analysis of the shortcomings and underlying problems in the existing approaches, and a discussion of potential solutions.

show abstract

“…In [7], relations between expressions, units and modules can be specified with the specification language of the CARE system. In [8], a contact based specification is used to query the relations between methods and components. In [9], a semantic indexing based specification is adopted in the query for the component relations.…”

Section: Introductionmentioning

confidence: 99%

An Open Framework for Semantic Code Queries on Heterogeneous Repositories

Zhang

Pan

Zhao

et al. 2015

2015 International Symposium on Theoretical Aspects of Software Engineering

View full text Add to dashboard Cite

Abstract-To help developers understand and reuse programs, semantic queries on the source code itself is attractive. Although programs in heterogeneous languages are being controlled for collaborative software development, most queries supported by various source code repositories are based either on the metadata of the repositories, or on indexed identifiers and method signatures. Few provide full support to search for structures that are common across different programming languages and different viewpoints (hence heterogeneous). To facilitate understanding and reuses, in this paper, we propose a novel source code query framework that (1) transforms source code to a unified abstract syntax format, and handles heterogeneity (non-isomorphism) at the abstract syntax level; (2) stores source code on a cloud-based NoSQL storage in MongoDB; (3) rewrites semantic query patterns into the NoSQL form. The efficiency of the framework has been evaluated to support several open-source hosting platforms.

show abstract

Specification matching for software reuse

Cited by 58 publications

References 19 publications

Finding a Needle in the Haystack: A Technique for Ranking Matches Between Components

Finding a Needle in the Haystack: A Technique for Ranking Matches Between Components

An Assessment of Test-Driven Reuse: Promises and Pitfalls

An Open Framework for Semantic Code Queries on Heterogeneous Repositories

Contact Info

Product

Resources

About