KATZ, S., RICHTER,C.A.,AND THE, K.-S. 1987. PARIS: A system for reusing partially interpreted schemas. In Proceedings of the 9th International Conference on Software Engineering. (Mar.). 377--385.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....order to re use program components it is often necessary to specify the pre and post conditions of the code required. These conditions can be used to search code in a data base of candidate reuse components. The pre and post condition search approach to reuse was first suggested by Katz et al. [34], Perry [45] and Rollins and Wing [46] A survey of the approach is presented by Mili [38] Systems which automate the search for such components typically use theorem proving to find possible matches [39, 44] Unfortunately, in some cases there may be no exact match, but there may be several ....

KATZ, S., RICHTER, C. A., AND THE, K.-S. PARIS: A system for reusing partially interpreted schemas. In Proceedings of the 9th International Conference on Software Engineering (1987), IEEE Computer Society Press, pp. 377--385.

....as in the model checking experiments, revealing quite different retrieval results for the various queries. Since SETHEO s proof procedure is sound, all solved proof tasks correspond to matches, hence the precision is 100 . 8. Related Work Most early publications on deduction based SCR (e.g. [20, 28, 14]) were mainly concerned with general conceptual issues and ignored the usability and scaling problems. We will thus discuss only more recent related work. Zaremski and Wing [34] have investigated specification matching in a slightly more general framework but their main application area is also ....

S. Katz, C. A. Richter, and K. S. The. PARIS: A system for reusing partially interpreted schemas. In Proc. 9th ICSE, pp. 377--385, 1987. IEEE Computer Society Press.

....a series of substitutions to apply to the library component to reuse in the desired context. Mili, Mili and Mittermeir [19] define a specification as a binary relation. Specification match is based on the refines ordering on relations, somewhat like our generalized match. The PARIS system [11] maintains a library of partially interpreted schemas. Each schema includes a specification of assertions about the input and results of the schema and about how the abstract parts of the schema can be instantiated. Matching corresponds to determining whether a partial library schema could be ....

Katz, S., Richter, C. A., and The, K.-S. PARIS: A system for reusing partially interpreted schemas. In Proc. of the 9 th ICSE (Mar. 1987), pp. 377--385.

....a new component (i.e. a user interface) out of smaller components (i.e. a widget) They also provide the specifications for new components and a template for their implementation. Frameworks are similar to other techniques for reusing high level design, such as templates [Spe88, VK89] or schemas [KRT89, LH87] The main difference is that frameworks are expressed in a programming language, but these other ways of reusing high level design usually depend on a special purpose design notation and require special software tools. The fact that frameworks are programs makes them easier for programmers ....

Shmuel Katz, Charles A. Richter, and Khe-Sing The. Paris: A system for reusing partially interpreted schemas. In Ted J. Biggerstaff and Alan J. Perlis, editors, Software Reusability, Vol I, pages 257--273. ACM Press, 1989.

....define a specification as a binary relation. A specification S refines another specification Q if S has information about more inputs and assigns fewer images to each argument. This is like plug in match except that the match is in terms of relations rather than predicates. The PARIS system [KRT87] maintains a library of partially interpreted schemas. Each schema includes a specification of assertions about the input and results of the schema and about how the abstract parts of the schema can be instantiated. Matching corresponds to determining whether a partial library schema could be ....

Shmuel Katz, Charles A. Richter, and Khe-Sing The. PARIS: A system for reusing partially interpreted schemas. In Proc. of the 9 th ICSE, pages 377--385, March 1987.

....the one for its defining path. 5 Comparison with Related Work A taxonomic classification of components as described in [PrFr87, Prie91] forms the basis of many software library systems, most of which are local, in the sense that they help retrieving single components. e.g. ffl The PARIS system [KaRT89] a applies a theorem prover to resolve a retrieval query against formal component descriptions using temporal logic for pre and postconditions. ffl LaSSIE [DBSB91] uses the knowledge representation language KANDOR to store information about a large software project in order to provide semantic ....

S. Katz, C. Richter, and K. The. PARIS: A system for reusing partially interpreted schemas. In Software Reusability: Volume I --- Concepts and Models, Frontier Series, chapter 10, pp. 257--273. ACM Press, New York, 1989.

....propagation patterns. Compared the implementations of cycle checking in [30] and the solution presented in this thesis and in [56] writing generic algorithms in contracts form [29, 30] requires more planning on how they will be used. Partially interpreted schemas Partially interpreted schemas [39] are program sections that have some portions which remain abstract or undefined. Katz et al. defined a partially interpreted schema as a specification with the following constructs: ffl A schema body which formally defines a generic algorithm. The body is parameterized with undefined functions, ....

Shmuel Katz, Charles A. Richter, and Khe-Sing The. PARIS: A System for Reusing Partially Interpreted Schemas. In International Conference on Software Engineering, pages 377--385, 1987.

....outputs. In our case, we write a program for a sample data structure and we automatically generalize this program to other data structures. ffl Meta level software structures Many mechanisms have been invented to make software more flexible. They include partially interpreted schemas [KRT87] algorithmic skeletons [Col89] the Plan Calculus 18 [RW90] implementational reflection [Rao91] and contracts [Hol92, Hol93] Contracts have been refined in our research group. Partially interpreted schemas are program sections that have some portions remaining abstract or undefined. ....

Shmuel Katz, Charles A. Richter, and Khe-Sing The. PARIS: A System for Reusing Partially Interpreted Schemas. In International Conference on Software Engineering, pages 377--385, 1987.

....and component retrieval (Maarek et al. 1991; Prieto D iaz, 1991) but these methods are informal because they rely only on the meaning conveyed by words. As a more exact alternative, the application of formal specification methods to software libraries has been investigated, starting with (Katz et al. 1987; Perry, 1989; Rollins and Wing, 1991) The general idea is quite simple. Each component is associated with a formal specification which captures its relevant behavior. Any desired relation between two c fl 1999 Kluwer Academic Publishers. Printed in the Netherlands. fischer.tex; 9 08 1999; ....

Katz, S., C. A. Richter, and K. S. The: 1987, `PARIS: A System for Reusing Partially Interpreted Schemas'. In: Proc. 9th Intl. Conf. Software Engineering. Montery, CA, pp. 377--385.

.... [Lam79, Ben96, Par98, Jef98] to drive refinements of the specification and generate proof obligations [Car90, Abr96, Dar96] to generate test cases and oracles from the specification [Ber91, Ric92, Roo94, Wey94, Man95] to support formal reuse of components through specification matching [Kat87, Reu91, Mas97, Zar97]. Formal specifications can also be generated from program code as a basis for reverse engineering and software evolution [Gan96, Ern99] Specify. for whom One of the problems with formal specifications is that they may concern different classes of consumers having fairly different ....

S. Katz, C.A. Richter, K.S. The, "PARIS: A System for Reusing Partially Interpreted Schemas", Proc. ICSE-87: 9th Intrnational Conference on Software Enginering, Monterey, CA, March 1987, 377-385.

....category, but it uses systematic techniques to select reusable components, for example, organizing them in appropriate libraries. The software schema category emphasizes the reuse of abstract algorithms and data structures rather than source code. An example of this category comes from PARIS [Katz92], a system implemented in LISP for reusing algorithms used in distributed programming. It consists of a library of partially interpreted schemas, that form a program skeleton where some parts remain abstract or undefined. The user query contains specification regarding an entity list, ....

Katz S., Richter,C. A., and The, K., PARIS: A system for reusing partially interpreted schema, in Software Reusability: Volume I-Concepts and Models, Biggerstaff, T.J., and Perlis, A. J., Eds. ACM Press, New York,1989, pp. 257-274, Chap. 10.

....of single components, i.e. they are local. The software engineering environment NORA [20] is based on logical inference and supports specification driven single component retrieval. Several other approaches to specification based retrieval of components rely also on deductive techniques (e.g. [2, 5, 14, 15]) and let the specification style range from frame based representations over signatures to algebraic specifications. 10 Only minimal paths are constructed, see remark 6.5. A number of systems share a core constituted by the knowledge representation language Telos [17] and the deductive ....

S. Katz, C. Richter, and K. The. PARIS: A system for reusing partially interpreted schemas. In Software Reusability: Vol. I --- Concepts and Models, Frontier Series, chapter 10, p. 257--273. ACM Press, New York, 1989.

....a well defined logical relation, e.g. if the component has a weaker precondition and a stronger postcondition than the search key. From this matching relation a proof task is constructed and an ATP is used to establish (or disprove) the match. This approach has been proposed before (e.g. KRT87, Per87, RW91, MM91, MMM94, MW95] but without convincing success because essential user requirements have been neglected. In this NORA is no real acronym, HAMMR is a highly adaptive multi method retrieval tool. y This work is supported by the DFG within the Schwerpunkt Deduktion (grant ....

S. Katz, C. A. Richter, and K. S. The. "PARIS: A System for Reusing Partially Interpreted Schemas". In Proc. 9th Intl. Conf. Software Engineering, pp. 377--385, Montery, CA, March 1987. IEEE Computer Society Press.

....1 Background Reuse by contract is the application of formal methods to software reuse: software components are associated with contracts formal models of their functional behaviour and administered, retrieved, and reused by these. Similar approaches have been proposed before (e.g. KRT87, RW91, MM91] but without convincing success. The goal of our project NORA HAMMR 1 [FKS95c, FKS95b, FKS95a] is thus to make reuse by contract practical. We investigate ffl scalable and efficient architectures for reuse by contract, ffl reuse friendly specification techniques, ffl library ....

....problem can be tackled by use of additional axioms which allow e.g. interchanges of parameters, and for the former we propose the use of abstract model checking. There has also been some earlier work to integrate deductive retrieval into software development environments. The PARIS system [KRT87] supported the semi automatic construction of programs over a library of so called schemes, i.e. program fragments which are enriched by assertions about their combination and instantiation possibilites. The construction process then generated proof tasks which were solved by the Boyer Moore ....

S. Katz, C. A. Richter, and K. S. The. "PARIS: A System for Reusing Partially Interpreted Schemas". In Proc. 9th ICSE, pp. 377--385, Montery, CA, March 1987. IEEE Computer Society Press.

....are informal because they rely only on the meaning conveyed by words. This work is supported by the DFG within the Schwerpunkt Deduktion , grant Sn11 2 3. As a more exact alternative, the application of formal specification methods to software libraries has been investigated, starting with [10, 23, 25]. The general idea is quite simple. Each component is indexed with a formal specification which captures its relevant behavior. Any desired relation between two components (e.g. refinement or matching) is expressed by a logical formula composed from the indices. An automated theorem prover is ....

S. Katz, C. A. Richter, and K. S. The. PARIS: A system for reusing partially interpreted schemas. In Proc. 9th Intl. Conf. Software Engineering, pages 377--385, Montery, CA, Mar. 1987. IEEE Comp. Soc. Press.

....several algorithms. In the latter case the right algorithm has to be chosen. This choice is based on the preconditions of an algorithm, and on cost functions that estimate which algorithm is the cheapest. Preconditions state which algorithm is applicable for which type of input. 2. 2 PARIS PARIS [11] contains a library of partially interpreted schemas. A partially interpreted schema is defined as a program in which some parts remain abstract or undefined. Given a problem statement, the reuse system searches through the library of partially interpreted schemas to find a schema that satisfies ....

....reuse systems are all designed to support a user or software developer, which is assumed to be more or less expert. ffl The authors use different terminology. This can already be seen if we look at the different words for a component used by some of the authors. 10] call them simply components, [11] call them schemas, 12] design schemas, and [7] call them plans. Other issues are also explained with different terminology. A closer look shows that the authors are in fact all talking about the same concepts and mechanisms, enabling us to identify a consensus. 3 Identifying a consensus In ....

[Article contains additional citation context not shown here]

S. Katz, C.A. Richter, and K. The, "PARIS: A system for reusing partially interpreted schemas.", in Frontiers Series: Software reusability: Volume I - Concepts and Models., T.J. Biggerstaff and A.J. Perlis, Eds., chapter 10, pp. 257--273. ACM Press New York, 1989.

....related work on matching software components divides into three categories based on the kind of information being matched: specifications, code or text. Specification matching [Zaremski and Wing 1995; Rollins and Wing 1991; Fischer et al. 1994; Perry 1989; Jeng and Cheng 1992; Mili et al. 1994; Katz et al. 1987; Yellin and Strom 1994] defines match in terms of formal specifications. Specification matching allows greater precision in matching than does signature matching, but requires specifications of components and a more expensive match. Another class of matches [Paul and Prakash 1994; Consens et al. ....

Katz, S., Richter, C. A., and The, K.-S. 1987. PARIS: A system for reusing partially interpreted schemas. In Proceedings of the 9 th International Conference on Software Engineering, pp. 377--385. IEEE Computer Society Press.

.... like denotational semantics, axiomatic rules, operational semantics, and so on[GMP90] Formal methods for matching specifications to program components have been extended along several dimensions and for various purposes like software reuse[ZW95] knowledge based information retrieval[Per89, KRT87] and program debugging[Jac92, Joh86] In a growing number of tools, the analysis process is not strictly mathematical, and user participation is encouraged. My approach is less formal than most of these schemes. It relies instead on the interplay between logic based static analysis and dynamic ....

Shmuel Katz, Charles A. Richter, and Khe-Sing The. PARIS: A System for Reusing Partially Interpreted Schemas. In Proceedings of the 9th International Conference on Software Engineering, pages 377--385, March 1987.

.... We take a more pessimistic point of view as what we want to provide as starting point are general schemes of problem solving methods defining their functionality and an operational description with very weak assumptions (like partially interpreted schemes and their assertions in the PARIS system [Katz et al. 1989]) For instance for propose revise there exist many variants with slightly different assumptions and behavior (see [Fensel, 1995] Putting all variants into a library would lead to non manageable libraries. Therefore, we can provide only a general schema covering all these variants. In ....

S. Katz, C. A. Richter, and K. The. Paris: A system for reusing partially interpreted schemas. volume I - Concepts and Models of Frontier Series: Software Reusability. ACM Press, New York, 1989.

....such methods does not preclude the use of component classification and retrieval techniques but, rather, can be used in conjunction with them. An example of a system which utilises formal specification techniques to enable the location of reusable program templates is PARIS. 3.3.5. 1 PARIS PARIS [KRT87] is a system for reusing PARtially Interpreted Schemas. In the system, a schema comprises two distinct parts, namely a program and a specification. The program part of a schema consists of program code, together with some abstract entities e.g. functions, predicates, constant symbols, or ....

Shmuel Katz, Charles A Richter, and Khe-Sing The. PARIS: A system for reusing partially interpreted schemas. In Proceedings of the Ninth International Conference on Software Engineering, pages 377--385, 1987.

No context found.

KATZ, S., RICHTER,C.A.,AND THE, K.-S. 1987. PARIS: A system for reusing partially interpreted schemas. In Proceedings of the 9th International Conference on Software Engineering. (Mar.). 377--385.

No context found.

S. Katz, C.A. Richter, and K. The, "PARIS: A system for reusing partially interpreted schemas.", in Frontiers Series: Software reusability: Volume I - Concepts and Models., T.J. Biggerstaff and A.J. Perlis, Eds., chapter 10, pp. 257-- 273. ACM Press New York, 1989.

No context found.

S. Katz, C. A. Richter, and K. S. The. PARIS: A system for reusing partially interpreted schemas. In Montery, CA, Mar. 1987. IEEE Comp. Soc. Press.

No context found.

S. Katz, C.A. Richter, and T-S. The. Paris: A system for reusing partially interpreted schemas. In Proc. 9th Intl. Conf. on Software Engineering, pages 377--385, Monterey, CA, april 1987.

No context found.

S. Katz, C. Richter, K. The. PARIS: A system for reusing partially interpreted schemas. In Software Reusability: Volume I --- Concepts and Models, Frontier Series, chapt. 10, pp. 257--273. ACM Press, New York, 1989.

First 50 documents

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