P2R - A Pairwise Testing Strategy Supporting Execution Resumption

Helal, Mohammed H.S. and Kamal Z., Zamli (2012) P2R - A Pairwise Testing Strategy Supporting Execution Resumption. In: International Conference on Computational Science and Information Management (ICoCSIM), 3-5 December 2012 , Toba Lake, North Sumatera, Indonesia. pp. 239-250..

PDF (FSKKP-2012-kamal-P2R a pairwise)

Download (958kB)


Pairwise strategies have been proven to be useful to systematically sample test data for interaction testing consideration. However, generating pairwise test suite can be a painstakingly difficult endeavor especially involving large configurations. Here, the generation process can take hours and even days to complete owing to the need to sample from large numbers of input parameters and values. In the case of interruption (e.g. due to power failure or hardware malfunctions), there is often a need to restart the whole generation process again from the beginning. If the pairwise test suite is significantly large and the overall progress is near completion, restarting means a lot of wasted efforts.In order to address the aforementioned issues, we have developed a new pairwise strategy, called P2R, which can generate sufficiently competitive pairwise test suite. Unlike existing pairwise strategies, P2R also has the capability to seamlessly resume existing test generationprocess upon interruption.

Item Type: Conference or Workshop Item (Speech)
Additional Information: Proceedings of the First International Conference on Computational Science and Information Management (ICoCSIM2012) ISBN 978-967-0120-60-7 Vol. 1
Uncontrolled Keywords: P2R; Pairwise testing; Resumption after interruption; Test suite generation; Checkpointing
Subjects: Q Science > QA Mathematics > QA76 Computer software
Faculty/Division: Faculty of Computer System And Software Engineering
Date Deposited: 10 Jul 2013 04:42
Last Modified: 15 Jan 2018 07:47
URI: http://umpir.ump.edu.my/id/eprint/3666
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item