On the use of computational geometry to detect software faults at runtime

  • Authors:

  • Edward Stehle;Kevin Lynch;Maxim Shevertalov;Chris Rorres;Spiros Mancoridis

  • Affiliations:

  • Drexel University, Philadelphia, USA;Drexel University, Philadelphia, USA;Drexel University, Philadelphia, USA;Drexel University, Philadelphia, USA;Drexel University, Philadelphia, USA

  • Venue:
  • Proceedings of the 7th international conference on Autonomic computing
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Despite advances in software engineering, software faults continue to cause system downtime. Software faults are difficult to detect before the system fails, especially since the first symptom of a fault is often system failure itself. This paper presents a computational geometry technique and a supporting tool to tackle the problem of timely fault detection during the execution of a software application. The approach in- volves collecting a variety of runtime measurements and building a geometric enclosure, such as a convex hull, which represents the normal (i.e., non-failing) operating space of the application being monitored. When collected runtime measurements are classified as being outside of the enclosure, the application is considered to be in an anomalous (i.e., failing) state. This paper presents exper- imental results that illustrate the advantages of using a computational geometry approach over the distance based approaches of Chi-Squared and Mahalanobis distance. Additionally, we present results illustrating the advantages of using the convex-hull enclosure for fault detection in favor of a simpler enclosure such as a hyperrectangle