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

Research

Links

Text available via DOI:

Keywords

View graph of relations

Identification of test cases using a formal approach

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Standard

Identification of test cases using a formal approach. / Sinha, Purnendu; Suri, Neeraj.
Digest of Papers. Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing. IEEE, 1999. p. 314-321 (Proc Annu Int Conf Fault Tolerant Comput).

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Harvard

Sinha, P & Suri, N 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, pp. 314-321, Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing, Madison, Wisconsin, United States, 15/06/99. https://doi.org/https://ieeexplore.ieee.org/document/781066

APA

Sinha, P., & Suri, N. (1999). Identification of test cases using a formal approach. In Digest of Papers. Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing (pp. 314-321). (Proc Annu Int Conf Fault Tolerant Comput). IEEE. https://doi.org/https://ieeexplore.ieee.org/document/781066

Vancouver

Sinha P, Suri N. Identification of test cases using a formal approach. In Digest of Papers. Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing. IEEE. 1999. p. 314-321. (Proc Annu Int Conf Fault Tolerant Comput). doi: https://ieeexplore.ieee.org/document/781066

Author

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

Bibtex

@inproceedings{aceee19f26c547f48dd60b6c6efc516c,
title = "Identification of test cases using a formal approach",
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.",
keywords = "Data structures, Equivalence classes, Network protocols, Query languages, Dependency tree, Fault injection, Inference tree, Fault tolerant computer systems",
author = "Purnendu Sinha and Neeraj Suri",
year = "1999",
month = jun,
day = "15",
doi = "https://ieeexplore.ieee.org/document/781066",
language = "English",
isbn = "076950213X",
series = "Proc Annu Int Conf Fault Tolerant Comput",
publisher = "IEEE",
pages = "314--321",
booktitle = "Digest of Papers. Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing",
note = "Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing ; Conference date: 15-06-1999 Through 18-06-1999",

}

RIS

TY - GEN

T1 - Identification of test cases using a formal approach

AU - Sinha, Purnendu

AU - Suri, Neeraj

PY - 1999/6/15

Y1 - 1999/6/15

N2 - 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.

AB - 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.

KW - Data structures

KW - Equivalence classes

KW - Network protocols

KW - Query languages

KW - Dependency tree

KW - Fault injection

KW - Inference tree

KW - Fault tolerant computer systems

U2 - https://ieeexplore.ieee.org/document/781066

DO - https://ieeexplore.ieee.org/document/781066

M3 - Conference contribution/Paper

SN - 076950213X

T3 - Proc Annu Int Conf Fault Tolerant Comput

SP - 314

EP - 321

BT - Digest of Papers. Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing

PB - IEEE

T2 - Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing

Y2 - 15 June 1999 through 18 June 1999

ER -