Jeng, J.-J. & Cheng, B. (1995), Specification matching for software reuse: A foundation, in `Proceedings of ACM Symposium on Software Reuse', pp. 97--105.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....is error prone. Much research effort has been spent on finding alternatives to keyword based description techniques (cf. 11] for a survey on software libraries and retrieval techniques) Due to their rigid semantics, formal specifications suit very well for capturing the behavior of software ([6, 25, 10, 13]) When searching for a certain asset, the query is formulated as a (partial) specification. The retrieval process is then performed by conducting a formal proof that a component s specification fulfills at least the needs expressed in the query. Unfortunately, formal methods in general are not ....

J.-J. Jeng and B. H. C. Cheng. Specification Matching for Software Reuse: A Foundation. In M. Samadzadeh and M. Zand, editors, Proc. of the ACM SIGSOFT Symposium on Software Reusability, Seattle, WA, April 1995. Association for Computing Machinery.

....by a logical formula composed from the associated specifications. An automated theorem prover is used to check the validity of the formula. If (and only if) the prover succeeds the relation is considered to be established. The most ambitious of these approaches is specificationbased retrieval (Jeng and Cheng, 1995; Moorman Zaremski and Wing, 1997; Penix et al. 1995; Mili et al. 1997; Schumann and Fischer, 1997; Fischer et al. 1998) It allows arbitrary specifications as search keys and retrieves all components from a library whose indexes satisfy a given match relation with respect to the key. However, ....

Jeng, J.-J. and B. H. C. Cheng: 1995, `Specification Matching for Software Reuse: A Foundation'. In: M. H. Samadzadeh and M. K. Zand (eds.): Proc. ACM SIGSOFT Symp. Software Reusability. Seattle, Washington, pp. 97--105.

....matching, together with using unification rather than pattern matching to allow parameters to appear in the query [8] While the specification matching approaches mentioned so far provide good solutions to the retrieval problem, none seem to provide a solution to adaptation. Jeng and Cheng [9] however attempt to address both of these issues concurrently. They propose a solution using unit specification match6 ing where a query specification is matched against a more general library unit specification, via a mapping Theta. The implementation of the library unit is modified in two steps ....

J-J. Jeng and B.H.C Cheng. Specification matching for software reuse: A foundation. In Proc. of ACM Symposium on Software Reuse, pages 97--105, April 1995.

....of the Second International conference on Autonomous Agents (Agents 98) Minneapolis, MN, May 1998. 8] J J. Jeng, and B.H.C. Cheng. Specification matching for software reuse: a foundation. Proceedings of the ACM SIGSOFT Symposium on Software Reusability, ACM Software Engineering Note, Aug. 1995. [9] M. Kracker. A fuzzy concept network. Proc. IEEE International Conf. on Fuzzy Systems, 1992. 10] D. Kuokka, L. Harrada, On using KQML for Matchmaking. Proc. 3rd Intl. Conf. on Information and Knowledge Management CIKM 95, pp. 239 45, AAAI MIT Press, 1995. 11] S. H. Li, P. B. Danzig. Boolean ....

....with restricted quering capabilities. 5.2 Works Related with Service Retrieval There are three broad approaches to service retrieval. One is the information retrieval techniques to search for relevant information based on text, another is the software component retrieval techniques[24] 6][9] to search for software components based on software specifications. The third one is to search for web resources that are typically described as database models[12] 22] In the software component search techniques, 24] defined several notions of matches, including the exact match and the plug in ....

[Article contains additional citation context not shown here]

J-J. Jeng, B.H.C. Cheng. Specification matching for software reuse: a foundation. Proceedings of the ACM SIGSOFT Symposium on Software Reusability, ACM Software Engineering Note, Aug. 1995. ]

....derived abstraction and the as built specification satisfy a matching relation. 6. 1 Specification Matching 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 ....

....(pre and postcondition) specifications describing software components, these approaches use a plug in or generality criteria [18, 19] to identify components in the library that match a query specification. The plug in match is defined as follows: Definition 6. 1 (Generality (Plug in) Match [31]) Let q be a query specification with precondition q pre and postcondition q post and l be a library specification with precondition l pre and postcondition l post . Specifications q and l match (denoted by l q) if (q pre l pre ) l post q post ) Informally, this definition means that ....

[Article contains additional citation context not shown here]

J.-J. Jeng and B. H. C. Cheng, "Specification Matching for Software Reuse: A Foundation," in Proceedings of the ACM Symposium on Software Reuse, pp. 97--105, 1995.

....take the meaning of the logical constraints in a Larks specification into account. This is done in our matchmaking process by the signature and constraint filters. The two filters are designed to work together to look for a so called semantic plug in match known in the software engineering area ([11, 33, 8]) Signature matching checks if the signatures of input and output declarations match. It is performed by a set of subtype inference rules as well as concept subsumption testing (see [28] for details) A software component description D 2 semantically plugin matches another component description ....

J-J. Jeng, and B.H.C. Cheng. Specification matching for software reuse: a foundation. Proceedings of the ACM SIGSOFT Symposium on Software Reusability, ACM Software Engineering Note, Aug. 1995.

....with restricted quering capabilities. 5.2 Works Related with Service Retrieval There are three broad approaches to service retrieval. One is the information retrieval techniques to search for relevant information based on text, another is the software component retrieval techniques[24] 6][9] to search for software components based on software specifications. The third one is to search for web resources that are typically described as database models[12] 22] In the software component search techniques, 24] defined several notions of matches, including the exact match and the plug in ....

....[24] defined several notions of matches, including the exact match and the plug in match, and formally proved the relationship between those matches. 6] proposed to use a sequence of filters to search for software components, for the purpose to increase the efficiency of the search process. [9] computed the distance between similar specifications. All these work are based on the algebraic specification of computer programs. No concept description and concept hierarchy are considered. In Web resource search techniques, 12] proposed a method to look for better search engines that may ....

J-J. Jeng, B.H.C. Cheng. Specification matching for software reuse: a foundation. Proceedings of the ACM SIGSOFT Symposium on Software Reusability, ACM Software Engineering Note, Aug. 1995. ]

....component search techniques, 22] defines several notions of matching, including exact and plug in matching, and formally proves the relationship between those matches. 5] proposes to use a sequence of filters to search for software components to increase the efficiency of the search process. [8] computes the distance between similar specifications. This work is based on algebraic specification of computer programs. No concept descriptions and concept hierarchies are considered. In Web resource search techniques, 11] proposes a method to look for better search engines that may provide ....

J-J. Jeng, and B.H.C. Cheng. Specification matching for software reuse: a foundation. Proceedings of the ACM SIGSOFT Symposium on Software Reusability, ACM Software Engineering Note, Aug. 1995.

....with restricted quering capabilities. 6.2 Works related with service retrieval There are three broad approaches to service retrieval. One is the information retrieval techniques to search for relevant information based on text, another is the software component retrieval techniques[26] 8][13] to search for software components based on software specifications. The third one is to search for web resources that are typically described as database models[18] 23] In the software component search techniques, 26] defined several notions of matches, including the exact match and the plug in ....

....[26] defined several notions of matches, including the exact match and the plug in match, and formally proved the relationship between those matches. 8] propsed to use a sequence of filters to search for software components, for the purpose to increase the efficiency of the search process. [13] computed the distance between similar specifications. All these work are based on the algebraic specification of computer programs. No concept description and concept hierarchy are considered in their work. In Web resource search techniques, 18] proposed a method to look for better search ....

J-J. Jeng, B.H.C. Cheng. Specification matching for software reuse: a foundation. Proceedings of the ACM SIGSOFT Symposium on Software Reusability, ACM Software Engineering Note, Aug. 1995.

....(pre and postcondition) specifications describing software components, these approaches use a plug in or generality criteria [11, 23] to identify components in the library that match a query specification. The plug in match is defined as follows: Definition 1 (Generality (Plug in) Match [12]) Let q be a query specification with precondition q pre and postcondition q post and l be a library specification with precondition l pre and postcondition l post . Specifications q and l match (denoted by l q) if (q pre l pre ) l post q post ) Informally, this definition means that ....

....applications including the fact that it provides a means for partitioning libraries based on behavioral differences as in the example above. In addition, the partial order structure facilitates inserting new specifications into a library and helps increase the efficiency of the retrieval process [12]. It is of interest to determine if the library has certain lattice like properties [14] In particular, it is of interest to determine the least upper bound (lub) since the lub can be used to identify common behavior. Similarly, it is of interest to determine the greatest lower bound (glb) since ....

[Article contains additional citation context not shown here]

J.-J. Jeng and B. H. C. Cheng. Specification Matching for Software Reuse: A Foundation. In Proceedings of the ACM Symposium on Software Reuse, pages 97--105, 1995.

....rely heavily upon specification matching criterion, where a search query using formal specifications is used to search a library of components indexed by formal specifications. In previous investigations, we addressed the use of formal methods and component libraries to support software reuse [14], and construction of software based on architectural specifications [2, 3] A difficulty for all formal approaches to software reuse is the creation of the formal indices. Software reverse engineering is a process of examining system components and component interrelationships in order to ....

....The second technique for populating code repositories is to identify existing code as potential candidates for reuse, and then packaging that code into a library. In either case, a primary concern is the mechanisms used for indexing, identifying, and retrieving the components from the libraries [6, 14, 19, 25]. This paper describes how a formal approach to reverse engineering can be integrated with a formal approach to software reuse in order to support after the fact construction and use of reusable code libraries. The overall process that is presented consists of four steps. First, a reuse library is ....

[Article contains additional citation context not shown here]

J.-J. Jeng and B. H. Cheng. Specification Matching for Software Reuse: A Foundation. In Proceedingsof the ACM Symposium on Software Reuse, pages 97--105, 1995.

....proof obligations Based on the justified mapping between ports (and behavior of ports) ABRIE will automatically generate code necessary for resolving naming conflicts between the library component and the target component during the system packaging process [3] 5. Related Work Jeng and Cheng [8] proposed specification matching for reuse based on order sorted predicate logic (OSPL) They defined both exact and relaxed matches. Zaremski and Wing [13] summarized several types of specification matchings to capture different behavioral relations. Both approaches discussed module ....

J.-J. Jeng and B. H. C. Cheng. Specification matching for software reuse: A foundation. In SSR'95. ACM SIGSOFT, ACM Press, April 1995.

No context found.

Jeng, J.-J. & Cheng, B. (1995), Specification matching for software reuse: A foundation, in `Proceedings of ACM Symposium on Software Reuse', pp. 97--105.

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