Loading...
Please wait, while we are loading the content...
Similar Documents
Solving software reuse problems with theorem provers.
| Content Provider | CiteSeerX |
|---|---|
| Author | Baar, Thomas Fischer, Bernd |
| Abstract | In NORA/HAMMR, we investigate the application of automated theorem provers to retrieve software components based on their formal specifications. The problem pro le has major impacts on the problem solving process and integration and preprocessing steps, e.g., simplification, become as important as the actual proving process. NORA/HAMMR thus uses a pipeline of filters of increasing deductive strength. Only in the final filter provers are applied. Here, we use ILF to control competition between different systems. Experiments confirm this approach. With moderate timeouts we already achieve an overall recall of approximately 80%. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Software Reuse Problem Theorem Provers Nora Hammr Actual Proving Process Problem Pro Le Automated Theorem Provers Software Component Formal Specification Deductive Strength Moderate Timeouts Major Impact Overall Recall Different System Final Filter Provers |
| Content Type | Text |
