Please use this identifier to cite or link to this item:
https://hdl.handle.net/11147/2547
Title: | Boolean differentiation for formalizing myers' cause-effect graph testing technique | Authors: | Ayav, Tolga Belli, Fevzi |
Keywords: | Cause-effect graph Software testing Formalization Boolean difference MCDC analysis |
Publisher: | Institute of Electrical and Electronics Engineers Inc. | Source: | Ayav, T., and Belli, F. (2015, August 3-5). Boolean differentiation for formalizing myers' cause-effect graph testing technique. Paper presented at the IEEE International Conference on Software Quality, Reliability and Security-Companion, QRS-C 2015. doi:10.1109/QRS-C.2015.31 | Abstract: | Cause-Effect Graph Testing is a popular technique used for almost four decades. Based on Boolean algebra, this technique assists deriving test cases from a given specification informally written in a natural language. The present paper suggests Boolean differentiation for formalizing this technique. The new approach is applied to an example, borrowed from G. Myers, for demonstrating and analyzing its features. Evaluations show that the new approach outperforms Myers' approach in terms of the detected faults per test cases. | URI: | http://doi.org/10.1109/QRS-C.2015.31 http://hdl.handle.net/11147/2547 |
ISBN: | 9781467395984 |
Appears in Collections: | Computer Engineering / Bilgisayar Mühendisliği Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection |
Show full item record
CORE Recommender
SCOPUSTM
Citations
9
checked on Dec 7, 2024
WEB OF SCIENCETM
Citations
3
checked on Nov 9, 2024
Page view(s)
372
checked on Dec 9, 2024
Download(s)
356
checked on Dec 9, 2024
Google ScholarTM
Check
Altmetric
Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.