Home > Research > Publications & Outputs > Identification of test cases using a formal app...

Links

Text available via DOI:

View graph of relations

Identification of test cases using a formal approach

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paperpeer-review

Published
Publication date15/06/1999
Host publication Digest of Papers. Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing
PublisherIEEE
Pages314-321
Number of pages8
ISBN (print)076950213X
<mark>Original language</mark>English
EventTwenty-Ninth Annual International Symposium on Fault-Tolerant Computing - Madison, United States
Duration: 15/06/199918/06/1999

Conference

ConferenceTwenty-Ninth Annual International Symposium on Fault-Tolerant Computing
Country/TerritoryUnited States
CityMadison
Period15/06/9918/06/99

Publication series

NameProc Annu Int Conf Fault Tolerant Comput
PublisherIEEE
ISSN (Print)0731-3071

Conference

ConferenceTwenty-Ninth Annual International Symposium on Fault-Tolerant Computing
Country/TerritoryUnited States
CityMadison
Period15/06/9918/06/99

Abstract

A key feature in fault injection (FI) based validation is identifying the relevant test cases to inject. This problem is exacerbated at the protocol level where the lack of detailed fault distributions limits the use of statistical approaches in deriving and estimating the number of test cases to inject. In this paper we develop and demonstrate the capabilities of a formal approach to protocol validation, where the deductive and computational analysis capabilities of formal methods are shown to be able to identify very specific test cases, and analytically identify equivalence classes of test cases.