Quickly Finding Known Software Problems via Automated Symptom Matching

  • Authors:
  • Guy Lohman;Jon Champlin;Peter Sohn

  • Affiliations:
  • IBM Almaden Research Center;Lotus Development Lab;Lotus Development Lab

  • Venue:
  • ICAC '05 Proceedings of the Second International Conference on Automatic Computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an architecture for and prototype of a system for quickly detecting software problem recurrences. Re-discovery of the same problem is very common in many large software products and is a major cost component of product support. At run-time, when a problem occurs, the system collects the problem symptoms, including the program call-stack, and compares it against a database of symptoms to find the closest matches. The database is populated off-line using solved cases and indexed to allow for efficient matching. Thus problems that occur repeatedly can be easily and automatically resolved without requiring any human problem-solving expertise. We describe a prototype implementation of the system, including the matching algorithm, and present some experimental results demonstrating the value of automatically detecting re-occurrence of the same problem for a popular sofware product.