Abstract
Boolean expression testing requires certain types of tests for each Boolean expression in program specification or implementation. Fault-based testing essentially uses a subset of the exhaustive test set to detect certain special types of faults. A fault-based Boolean expression testing strategy called constraint true and false test point (CTFTP) is proposed. The test consists of two test case generation strategies, namely a unique constraint true point (UCTP) strategy and a near constraint false point (NCFP) strategy. An ordered binary label-driven Petri net model is presented to analyze the interaction between Boolean transitions and Boolean literals and yield the test paths of a singular term for the irredundant disjunctive normal forms (IDNFs). On the basis of the test paths, we develop a configuration-based IDNF test generation algorithm, which is employed to obtain the UCTP, NCFP, and CTFTP test sets for the IDNFs. The proposed test generation algorithm based on literal substitution is applied to extend the CTFTP strategy and generate a test suite for general Boolean expressions, which are evaluated using TCAS II specifications. Experimental results show that the CTFTP strategy can detect the same seven types of faults similar to the MUMCUT strategy when testing IDNFs, but only a subset of the MUMCUT test set is required. Five types of faults of general Boolean expressions can also be detected using CTFTP strategies.
Highlights
The correctness and validity of Boolean expressions lay the foundation for the correctness and robustness of those software applications
By using ordered binary label-driven Petri net (OBLDPN), we propose a fault-based test strategy called the constraint true and false test point (CTFTP) strategy consisting of two test case generation strategies, namely, a unique constraint true point (UCTP) strategy and a near constraint false point (NCFP) strategy
EMPIRICAL RESULTS We report an empirical study on the CTFTP testing strategy
Summary
The correctness and validity of Boolean expressions lay the foundation for the correctness and robustness of those software applications. H. Gong et al.: CTFTP: A Test Case Generation Strategy for General Boolean Expressions Based on OBLDPNs none of its terms can be omitted from the expression and none of its literals can be omitted from any term in the expression [5]. Testing a general form of the Boolean expression by using IDNF-oriented strategies always results in excessive test costs and misses the detection of certain faults. We focus on detecting faults in Boolean expressions by developing an extended Petri net approach and generating test cases directly from a given general form of a Boolean expression. The empirical result shows that the CTFTP strategy can detect five types of faults for a general form of a Boolean expression. These faults include expression negation fault (ENF), literal negation fault (LNF), term omission fault (TOF), operator reference fault (ORF), literal omission fault (LOF), LIF, and LRF
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
