Open Access Open Access  Restricted Access Subscription Access

Study on Early Fault Detection

Dr Vidyadevi G. Biradar

Abstract


The study in the paper talks about how to find problems in the software before they become big problems, which is what it talks about. The research work is about finding problems in an analytical way and then taking steps to fix them, such as automating the process, identifying the code, and so on. The results of the study show that there are a lot of things to look for when you find the different stages of testing. That could improve the quality, flexibility, and good quality of the work that is made. A lot of the research is based on CTD - Combinatorial Test Design (CTD) techniques, which are used to find problems at the test point. One of the most popular CTDs is OATS, which stands for Orthogonal Array Based Testing Strategy, and it decides how different things work together.


Full Text:

PDF

References


Rauf, E. A., & Reddy, E. M. (2015). Software test automation: An algorithm for solving system management automation problems. Procedia Computer Science, 46, 949-956.

EM, A. R., & Reddy, E. M. (2015, March). Combinatorial testing: A case study approach for software evaluation. In 2015 IEEE International Conference on Electrical, Computer and Communication Technologies (ICECCT) (pp. 1-5). IEEE.

Bryce, R. C., & Colbourn, C. J. (2005, November). Constructing interaction test suites with greedy algorithms. In Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (pp. 440-443).

Bryce, R. C., & Colbourn, C. J. (2006). Prioritized interaction testing for pair-wise coverage with seeding and constraints. Information and Software Technology, 48(10), 960-970.

Bryce, R. C., & Colbourn, C. J. (2007). The density algorithm for pairwise interaction testing. Software Testing, Verification and Reliability, 17(3), 159-182.

Bryce, R. C., & Colbourn, C. J. (2007, July). One-test-at-a-time heuristic search for interaction test suites. In Proceedings of the 9th annual conference on Genetic and evolutionary computation (pp. 1082-1089).

Bryce, R. C., & Colbourn, C. J. (2009). A density‐based greedy algorithm for higher strength covering arrays. Software Testing, Verification and Reliability, 19(1), 37-53.

Bryce, R. C., Colbourn, C. J., & Cohen, M. B. (2005, May). A framework of greedy methods for constructing interaction test suites. In Proceedings of the 27th international conference on Software engineering (pp. 146-155).

Bentley, J. E., Bank, W., & Charlotte, N. C. (2005, April). Software testing fundamentals—concepts, roles, and terminology. In Proceedings of SAS Conference (pp. 1-12).

Colbourn, C. J., & McClary, D. (2006). Detecting and locating interaction faults. Electronic Notes in Discrete Mathematics, (27), 17-18..


Refbacks

  • There are currently no refbacks.