Probabilistic testing for a distributed conference protocol

N. Goga

doi:10.1109/ICSMC.2004.1401012

Probabilistic testing for a distributed conference protocol

N. Goga

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Abstract

In [L. Feijs, et al., 2000] we proposed a generalization of the TorX test derivation algorithm with probabilities. The current work extends the theoretical work from [L. Feijs, et al., 2000], by presenting experimental results obtained with the probabilistic TorX. The experiment with the distributed conference protocol case study confirms that the extension of the algorithm with explicit probabilities leads to improvements in the tests generated with respect to the chances of finding errors in the implementation.

Original language	English
Title of host publication	Proceedings 2004 IEEE International Conference on Systems, Man, and Cybernetics (IEEE SMC 2004)
Place of Publication	Piscataway
Publisher	Institute of Electrical and Electronics Engineers
Pages	5154-5158
Number of pages	5
ISBN (Print)	0-7803-8566-7
DOIs	https://doi.org/10.1109/ICSMC.2004.1401012
Publication status	Published - 2004
Event	2004 IEEE International Conference on Systems, Man and Cybernetics, SMC 2004 - The Hague, Netherlands Duration: 10 Oct 2004 → 13 Oct 2004

Conference

Conference	2004 IEEE International Conference on Systems, Man and Cybernetics, SMC 2004
Abbreviated title	SMC 2004
Country/Territory	Netherlands
City	The Hague
Period	10/10/04 → 13/10/04

Access to Document

10.1109/ICSMC.2004.1401012

Cite this

@inproceedings{491b988e950c4778b6996c886301eddc,

title = "Probabilistic testing for a distributed conference protocol",

abstract = "In [L. Feijs, et al., 2000] we proposed a generalization of the TorX test derivation algorithm with probabilities. The current work extends the theoretical work from [L. Feijs, et al., 2000], by presenting experimental results obtained with the probabilistic TorX. The experiment with the distributed conference protocol case study confirms that the extension of the algorithm with explicit probabilities leads to improvements in the tests generated with respect to the chances of finding errors in the implementation.",

author = "N. Goga",

year = "2004",

doi = "10.1109/ICSMC.2004.1401012",

language = "English",

isbn = "0-7803-8566-7",

pages = "5154--5158",

booktitle = "Proceedings 2004 IEEE International Conference on Systems, Man, and Cybernetics (IEEE SMC 2004)",

publisher = "Institute of Electrical and Electronics Engineers",

address = "United States",

note = "2004 IEEE International Conference on Systems, Man and Cybernetics, SMC 2004, SMC 2004 ; Conference date: 10-10-2004 Through 13-10-2004",

}

Goga, N 2004, Probabilistic testing for a distributed conference protocol. in Proceedings 2004 IEEE International Conference on Systems, Man, and Cybernetics (IEEE SMC 2004). Institute of Electrical and Electronics Engineers, Piscataway, pp. 5154-5158, 2004 IEEE International Conference on Systems, Man and Cybernetics, SMC 2004, The Hague, Netherlands, 10/10/04. https://doi.org/10.1109/ICSMC.2004.1401012

TY - GEN

T1 - Probabilistic testing for a distributed conference protocol

AU - Goga, N.

PY - 2004

Y1 - 2004

N2 - In [L. Feijs, et al., 2000] we proposed a generalization of the TorX test derivation algorithm with probabilities. The current work extends the theoretical work from [L. Feijs, et al., 2000], by presenting experimental results obtained with the probabilistic TorX. The experiment with the distributed conference protocol case study confirms that the extension of the algorithm with explicit probabilities leads to improvements in the tests generated with respect to the chances of finding errors in the implementation.

AB - In [L. Feijs, et al., 2000] we proposed a generalization of the TorX test derivation algorithm with probabilities. The current work extends the theoretical work from [L. Feijs, et al., 2000], by presenting experimental results obtained with the probabilistic TorX. The experiment with the distributed conference protocol case study confirms that the extension of the algorithm with explicit probabilities leads to improvements in the tests generated with respect to the chances of finding errors in the implementation.

U2 - 10.1109/ICSMC.2004.1401012

DO - 10.1109/ICSMC.2004.1401012

M3 - Conference contribution

SN - 0-7803-8566-7

SP - 5154

EP - 5158

BT - Proceedings 2004 IEEE International Conference on Systems, Man, and Cybernetics (IEEE SMC 2004)

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway

T2 - 2004 IEEE International Conference on Systems, Man and Cybernetics, SMC 2004

Y2 - 10 October 2004 through 13 October 2004

ER -

Probabilistic testing for a distributed conference protocol

Abstract

Conference

Access to Document

Fingerprint

Cite this