Identification of test cases using a formal approach

Sinha, Purnendu and Suri, Neeraj (1999) Identification of test cases using a formal approach. In: Digest of Papers. Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing :. Proc Annu Int Conf Fault Tolerant Comput . IEEE, USA, pp. 314-321. ISBN 076950213X

Full text not available from this repository.


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.

Item Type:
Contribution in Book/Report/Proceedings
?? data structuresequivalence classesnetwork protocolsquery languagesdependency treefault injectioninference treefault tolerant computer systems ??
ID Code:
Deposited By:
Deposited On:
08 Oct 2019 08:10
Last Modified:
16 Jul 2024 04:43