King's College London

Research portal

Heuristics for fault diagnosis when testing from finite state machines

Research output: Contribution to journalArticlepeer-review

Q Guo, R A Hierons, M Harman, K Derderian

Original languageEnglish
Pages (from-to)41 - 57
Number of pages17
JournalSOFTWARE TESTING VERIFICATION AND RELIABILITY
Volume17
Issue number1
DOIs
PublishedMar 2007

King's Authors

Research Groups

  • King's College London

Abstract

When testing from finite state machines, a failure observed in the implementation under test (IUT) is called a symptom. A symptom could have been caused by an earlier state transfer failure. Transitions that may be used to explain the observed symptoms are called diagnosing candidates. Finding strategies to generate an optimal set of diagnosing candidates that could effectively identify faults in the IUT is of great value in reducing the cost of system development and testing. This paper investigates fault diagnosis when testing from finite state machines and proposes heuristics for fault isolation and identification. The proposed heuristics attempt to lead to a symptom being observed in some shorter test sequences, which helps to reduce the cost of fault isolation and identification. The complexity of the proposed method is analysed. A case study is presented, which shows how the proposed approach assists in fault diagnosis. Copyright 2006 John Wiley & Sons, Ltd

View graph of relations

© 2020 King's College London | Strand | London WC2R 2LS | England | United Kingdom | Tel +44 (0)20 7836 5454