J. M. P. Schumann and B. Fischer. "NORA/HAMMR: Making DeductionBased Software Component Retrieval Practical". In M. Lowry and Y. Ledru, (eds.), Proc. 12th Intl. Conf. Automated Software Engineering, pp. 246--254, Lake Tahoe, November 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Specification-Based Browsing of Software Component Libraries - Fischer (1999) (15 citations) (Correct)
....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, in spite of all research efforts (cf. Mili et al. 1998) for a detailed survey) it is still far ....
Schumann, J. M. P. and B. Fischer: 1997, `NORA/HAMMR: Making DeductionBased Software Component Retrieval Practical'. in (Lowry and Ledru, 1997), pp. 246--254.
Solving Software Reuse Problems with Theorem Provers - Baar, Fischer (1998) Self-citation (Fischer) (Correct)
....However, this is only a sufficient and not a necessary condition and in many cases we have that A 6j= G and A 6j= G both hold. Another approach is to look for explicit countermodels, i.e. structures in which the axioms A hold but not G. We have experimented with model checking techniques (cf. [SF97]) but since A includes the theory of lists, we can only approximate the necessary finite structures and the approach becomes unsound. However, as humans we can spot the countermodels easily because usually only a small part of the structure is required. Moreover, this part is even quite similar ....
J. M. P. Schumann and B. Fischer. "NORA/HAMMR: Making DeductionBased Software Component Retrieval Practical". In M. Lowry and Y. Ledru, (eds.), Proc. 12th Intl. Conf. Automated Software Engineering, pp. 246--254, Lake Tahoe, November 1997.
An Integration of Deductive Retrieval into Deductive Synthesis - Fischer, Whittle (1999) (4 citations) Self-citation (Fischer) (Correct)
....system design. Deductive retrieval is the application of theorem provers to find existing components for specifications. As such, it is a composition based, bottomup approach and works with entities of smaller scale such as components or functions. Recently, retrieval systems such as NORA HAMMR [18] and REBOUND [17] have shown tractable ways to scale retrieval up to larger component libraries. In this paper we investigate the integration of a deductive retrieval system into a deductive synthesis framework in order to maximize the advantages of both approaches. We present our ideas in the ....
....modifications are required in order to guarantee the applicability of the retrieved components. The main problem in deductive retrieval is the large number of emerging proof tasks. Naive generate and prove implementations drown any prover, but recent efforts show how to circumvent this problem [18, 17, 5]. We assume that our integrated tool uses a retrieval system such as NORA HAMMR [18] in which a pipeline of filters of increasing deductive strength are used to prune away proof tasks associated with non matching components whilst maintaining a balance between fast response and high precision. ....
[Article contains additional citation context not shown here]
J. M. P. Schumann and B. Fischer. "NORA/HAMMR: Making deduction-based software component retrieval practical ", in [9], pp. 246--254.
Solving Software Reuse Problems with Theorem Provers - Baar, Fischer Self-citation (Fischer) (Correct)
....:G. However, this is only a su cient and not a necessary condition and in many cases we have that A 6j= G and A 6j= G both hold. Another approach is to look for explicit countermodels, i.e. structures in which the axioms A hold but not G. We have experimented with model checking techniques (cf. [13]) but since A includes the theory of lists, we can only approximate the necessary nite structures and the approach becomes unsound. However, as humans we can spot the countermodels easily because usually only a small part of the structure is required. Moreover, this part is even quite similar for ....
J. M. P. Schumann and B. Fischer. "NORA/HAMMR: Making Deduction-Based Software Component Retrieval Practical". In Proc. 12th Intl. Conf. Automated Software Engineering, pp. 246-254, Lake Tahoe, November 1997.
Specification-Based Browsing of Software Component Libraries - Fischer (1998) (15 citations) Self-citation (Fischer) (Correct)
....the Schwerpunkt Deduktion , grant Sn11 2 3. from the indices. 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 speci cation based retrieval [21, 22, 18, 26, 6]. It allows arbitrary speci cations as search keys and retrieves all components from a library whose indexes satisfy a given match relation with respect to the key. However, in spite of all research e orts (cf. 19] for a detailed survey) it is still far away from being practicable. ....
J. M. P. Schumann and B. Fischer. "NORA/HAMMR: Making DeductionBased Software Component Retrieval Practical". In Lowry and Ledru [13], pp. 246-254.
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