Open Access Open Access  Restricted Access Subscription Access

Research on Early Error Prevention

Vidya G

Abstract


The study in the article addresses the topic of how to identify software issues before they become significant issues. The goal of the research is to discover issues using analytical means and then implement solutions, such as process automation and code identification. The study's findings indicate that there are numerous factors to consider while identifying the various testing phases. This could lead to an increase in the output's caliber, adaptability, and quality. Combinatorial Test Design (CTD) methods are the foundation of much research and are used to identify issues at the test point. The most often used CTD is called OATS, or Orthogonal Array Based Testing Strategy, and it determines how various components interact.


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.


Refbacks

  • There are currently no refbacks.