Loading...
Please wait, while we are loading the content...
Similar Documents
7 Conclusions and Future Work Ilarity in a Reuse Library System: an Ai Based Approach. Acm Transactions on Software En- 6 Related Work
| Content Provider | Semantic Scholar |
|---|---|
| Author | Boudriga, Noureddine Mili, Ali Devanbu, Premkumar T. Brachman, Ronald J. Jeng, Jun-Jang Elloumi, Fathi |
| Copyright Year | 1995 |
| Abstract | A declarative requirements spec-iication language for VHDL. ious sort substitutions. Speciication matching then uses a semi-automated theorem prover to show various logical relationships (such as logical satisfaction) hold between the input and output conditions of the retrieved components and the query speciication. This approach is similar to our own, in fact, the information used in signature matching can be represented in terms of semantic features. However, speciication matching is a syntactic measure and does not take into account speciication semantics. The Inquire retrieval mechanism described by Perry and Popovich 7] supports retrieval based on specii-cation predicates. A formal speciication of a compo-nent's behavior is constructed from a set of predeened predicates. An inference mechanism is then used during the retrieval process to locate components that satisfy the various predicates. Predicates in the Inquire system are somewhat similar to semantic features. However, the set of predicates serves as the complete formal speciication of a component. To provide consistency for retrieval, the predicates that can be used in speciications must be predeened for the problem domain. When using semantic features, only the feature deenitions must be predeened. New abstract types (sorts and operators) can be created as long as they are related to the basic domain theory over which the features are deened. The authors do not discuss the scalability of predicated based retrieval when implemented with a fully descriptive speciica-tion logic. Steigerwald 22] describes a method for automating the reuse of algebraic speciications. Normalized algebraic speciications are compared by constructing sample terms in one algebra and then mapped via a signature morphism into the second algebra. The results of reducing the sample terms are used to verify the consistency of the signature morphism. Steiger-wald's work is also an attempt to make retrieval based on speciications aaordable by minimizing the application of formal reasoning; semantic normalization is applied to the algebras to simplify the matching process. Similarly, limited theorem proving during the classiication process leads to a more eecient component retrieval phase. The algorithm described here currently serves as the principle design methodology used by COMET 13] for transforming vspec problem specii-cations into vhdl implementations. It is implemented using Refine 23] in the Software Refinery environment. The system currently retrieves both components and high level architectures for instantiation. The results are passed to hardware/software partitioning procedures and nally to hardware and software synthesis subsystems. Developing pragmatic features and populating the reuse database … |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.ececs.uc.edu/~kbse/pub/ps/kbse95.ps |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
