Boolean expressions are major focus of specifications and they are very much prone to introduction of faults, this survey presents various fault based testing techniques.It recognizes that the methods differ in their fault detection capabilities and creation of test suite. The various techniques like Dealing with Constraints in Boolean Expression, Minimal Fault Detecting Test Suites, Reducing logic test set size, A logic mutation approach, SAT and SMT Solvers for Test Generation and Boolean Expressions by Cell Covering has been considered. This survey describes the fundamental algorithms and fault categories used by these strategies for evaluating their performance. Finally, it contains short summaries of the papers that use Boolean expressions used to specify the requirements for detecting faults. These techniques have been empirically evaluated by various researchers on a simplified safety related real time conditionals system.

Boolean Expression, BOR, Test suite, MBT

[1] K.C. Tai. Theory of Fault Based Predicate Testing for Computer Programs, IEEE Transactions of Software Engineering, vol 22, no 8, pp 552-562, 1996
[2] K.C Tai. M.A Vouk., A. Paradkar., Lu P. , "Predicate Based Testing," IBM Systems Journal, Vol 33 (3), p 445, 1994
[3] M. A. Vouk, K. C. Tai, and A. Paradkar. Empirical Studies of Predicate-based Software Testing. In 5th International Symposium on Software Reliability Engineering, pages 55–64. IEEE, 1994.
[4] A. Gargantini, “Dealing with constraints in boolean expression testing,” in Proc. 3rd Workshop Constraints Softw. Testing Verification Anal., Mar. 25, 2011, pp. 322- -327.
[5] G. Fraser and A. Gargantini, “Generating minimal fault detecting test suites for boolean expressions,” in Proc. 3rd Int. Conf. Softw. Testing Verification Validation Workshops, Apr. 2010, pp. 37–45.
[6] G. Kaminski and P. Ammann, “Reducing logic test set size while preserving fault detection,” Softw. Testing, Verification Rel., vol. 21, pp. 155–193, 2011.
[7] 21] G. Kaminski, U. Praphamontripong, P. Ammann, and J. Offutt, “A logic mutation approach to selective mutation for programs and queries,” Inf. Softw. Technol., vol. 53, pp. 1137–1152, 2011.
[8] Godefroid, P., Levin, M. Y., and Molnar, D. (2012) SAGE: Whitebox fuzzing for security testing. Commun. ACM, 55, 40-44.
[9] Peleska, J. (2013) Industrial-strength Model-Based Testing - state of the art and current challenges. In Petrenko, A. K. and Schlinglo, H. (eds.), Proceedings Eighth Workshop on Model-Based Testing, MBT 2013, Rome, Italy, 17th March 2013, EPTCS, 111, pp. 3-28.
[10] P. Arcaini, A. Gargantini, and E. Riccobene, “How to optimize the use of SAT and SMT solvers for test generation of boolean expressions,” Comput. J., vol. 58, pp. 2900–2920, Jan. 21, 2015.
[11] Lian Yu and Wei-Tek Tsai, "Test Case Generation for Boolean Expressions by Cell Covering", IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, VOL. 44, NO. 1, JANUARY 2018.
[12] Kaminski G, Ammann P. Using logic criterion feasibility to reduce test set size while guaranteeing fault detection. Proceedings of the 2nd International Conference on Software Testing, Verification and Validation, Denver, CO, April 2009; 167–176.
[13] Kaminski G, Ammann P. Using logic criterion feasibility to reduce test set size while guaranteeing double fault detection. Proceedings of the Mutation Workshop at the 2nd International Conference on Software Testing, Verification and Validation, Denver, CO, April 2009.
[14] G. Kaminski and P. Ammann, “Applications of optimization to logic testing,” in Proc. Softw. Testing, Verification Validation Workshops, 2010, pp. 331–336.