NORA/HAMMR: Making Deduction-Based Software Component Retrieval Practical

@inproceedings{Schumann1997NORAHAMMRMD,
  title={NORA/HAMMR: Making Deduction-Based Software Component Retrieval Practical},
  author={Johann Schumann and Bernd Fischer},
  booktitle={ASE},
  year={1997}
}
Deduction-based software component retrieval uses preand postconditions as indexes and search keys and an automated theorem prover (ATP) to check whether a component matches. This idea is very simple but the vast number of arising proof tasks makes a practical implementation very hard. We thus pass the components through a chain of filters of increasing deductive power. In this chain, rejection filters based on signature matching and model checking techniques are used to rule out non-matches as… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 43 references

A Davis-Putnam program and its application to finite first-order model search: Quasigroup existence problems

  • W. W. McCune
  • Technical Report, Argonne National Laboratory…
  • 1994
Highly Influential
5 Excerpts

The VDM-SL Reference Guide

  • J. Dawes
  • Pitman, London
  • 1991
Highly Influential
7 Excerpts

A systematic approach to type-based software component retrieval

  • B. Fischer
  • PhD thesis, TU Braunschweig
  • 1997
1 Excerpt

The Model Elimination Provers SETHEO and E-SETHEO

  • M. Moser, O. Ibens, +4 authors K. Mayr
  • Journal of Automated Reasoning, 18:237–246
  • 1997
1 Excerpt

Similar Papers

Loading similar papers…