Relevant bibliographies by topics / Computer software testing; adaptive random testing; random testing

Academic literature on the topic 'Computer software testing; adaptive random testing; random testing'

Author: Grafiati

Published: 4 June 2021

Last updated: 7 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Journal articles
Dissertations / Theses
Book chapters
Conference papers

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Computer software testing; adaptive random testing; random testing.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Computer software testing; adaptive random testing; random testing"

Nie, Changhai, Huayao Wu, Xintao Niu, Fei-Ching Kuo, Hareton Leung, and Charles J. Colbourn. "Combinatorial testing, random testing, and adaptive random testing for detecting interaction triggered failures." Information and Software Technology 62 (June 2015): 198–213. http://dx.doi.org/10.1016/j.infsof.2015.02.008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Junpeng Lv, Hai Hu, Kai-Yuan Cai, and Tsong Yueh Chen. "Adaptive and Random Partition Software Testing." IEEE Transactions on Systems, Man, and Cybernetics: Systems 44, no. 12 (December 2014): 1649–64. http://dx.doi.org/10.1109/tsmc.2014.2318019.

Full text

APA, Harvard, Vancouver, ISO, and other styles

CHEN, TSONG YUEH, FEI-CHING KUO, and ZHI QUAN ZHOU. "ON FAVOURABLE CONDITIONS FOR ADAPTIVE RANDOM TESTING." International Journal of Software Engineering and Knowledge Engineering 17, no. 06 (December 2007): 805–25. http://dx.doi.org/10.1142/s0218194007003501.

Full text

Abstract:

Recently, adaptive random testing (ART) has been developed to enhance the fault-detection effectiveness of random testing (RT). It has been known in general that the fault-detection effectiveness of ART depends on the distribution of failure-causing inputs, yet this understanding is in coarse terms without precise details. In this paper, we conduct an in-depth investigation into the factors related to the distribution of failure-causing inputs that have an impact on the fault-detection effectiveness of ART. This paper gives a comprehensive analysis of the favourable conditions for ART. Our study contributes to the knowledge of ART and provides useful information for testers to decide when it is more cost-effective to use ART.

APA, Harvard, Vancouver, ISO, and other styles

CAI, KAI-YUAN, TSONG YUEH CHEN, YONG-CHAO LI, YUEN TAK YU, and LEI ZHAO. "ON THE ONLINE PARAMETER ESTIMATION PROBLEM IN ADAPTIVE SOFTWARE TESTING." International Journal of Software Engineering and Knowledge Engineering 18, no. 03 (May 2008): 357–81. http://dx.doi.org/10.1142/s0218194008003696.

Full text

Abstract:

Software cybernetics is an emerging area that explores the interplay between software and control. The controlled Markov chain (CMC) approach to software testing supports the idea of software cybernetics by treating software testing as a control problem, where the software under test serves as a controlled object modeled by a controlled Markov chain and the software testing strategy serves as the corresponding controller. The software under test and the corresponding software testing strategy form a closed-loop feedback control system. The theory of controlled Markov chains is used to design and optimize the testing strategy in accordance with the testing/reliability goal given explicitly and a priori. Adaptive software testing adjusts and improves software testing strategy online by using the testing data collected in the course of software testing. In doing so, the online parameter estimations play a key role. In this paper, we study the effects of genetic algorithm and the gradient method for doing online parameter estimation in adaptive software testing. We find that genetic algorithm is effective and does not require prior knowledge of the software parameters of concern. Although genetic algorithm is computationally intensive, it leads the adaptive software testing strategy to an optimal software testing strategy that is determined by optimizing a given testing goal, such as minimizing the total cost incurred for removing a given number of defects. On the other hand, the gradient method is computationally favorable, but requires appropriate initial values of the software parameters of concern. It may lead, or fail to lead, the adaptive software testing strategy to an optimal software testing strategy, depending on whether the given initial parameter values are appropriate or not. In general, the genetic algorithm should be used instead of the gradient method in adaptive software testing. Simulation results show that adaptive software testing does work and outperforms random testing.

APA, Harvard, Vancouver, ISO, and other styles

Thu Nguyet, Phan Thi, and Muslem Daud. "Computer Adaptive Test Development To Assess Students’ Psychology." JURNAL SERAMBI ILMU 22, no. 1 (March 22, 2021): 139–49. http://dx.doi.org/10.32672/si.v22i1.2760.

Full text

Abstract:

Stress becomes a significantly serious issue among university students and we need efficient tools to understand it more. The aim of present study is to develop a Computerized Adaptive Testing (CAT) to measure the mentioned stress, as pioneer project in Vietnam. In this vein, an item bank of 68 items has been constructed, which is based on Likert Polytomous Scales through five subdomains: behavior, academic performance, family, lecturer and finance. The sampling of the survey is large. It has assessed 2,085 students (704 males and 1,381 females). Multidimensional Random Coefficients Multinomial Logit (MRCML) Model is applied to develop Multidimensional Stress Scales and Computerized Adaptive Testing procedure. The result findings indicate that Multidimensional Random Coefficients Multinomial Logit (MRCML) can be used to develop new scale with psychometric properties. Indicated by various fit criteria MNSQ, standard errors, Z (t-test) implemented in software ConQuest. The subdomain has a good reliability (from .857 to .798). As respect to CATs, a simulated experiment based on the empirical data is applied to evaluate the performance of the proposed computerized adaptive testing. The standard error of the estimated stress proficiencies are reported in this study. The 68 items stress data appropriate fit the Multidimensional model applied.

APA, Harvard, Vancouver, ISO, and other styles

Omari, Michael, Jinfu Chen, Robert French-Baidoo, and Yunting Sun. "A Proactive Approach to Test Case Selection — An Efficient Implementation of Adaptive Random Testing." International Journal of Software Engineering and Knowledge Engineering 30, no. 08 (August 2020): 1169–98. http://dx.doi.org/10.1142/s0218194020500308.

Full text

Abstract:

Fixed Sized Candidate Set (FSCS) is the first of a series of methods proposed to enhance the effectiveness of random testing (RT) referred to as Adaptive Random Testing methods or ARTs. Since its inception, test case generation overheads have been a major drawback to the success of ART. In FSCS, the bulk of this cost is embedded in distance computations between a set of randomly generated candidate test cases and previously executed but unsuccessful test cases. Consequently, FSCS is caught in a logical trap of probing the distances between every candidate and all executed test cases before the best candidate is determined. Using data mining, however, we discovered that about 50% of all valid test cases are encountered much earlier in the distance computations process but without any benefit of a hindsight, FSCS is unable to validate them; a wild goose chase. This paper then uses this information to propose a new strategy that predictively and proactively selects valid candidates anywhere during the distance computation process without vetting every candidate. Theoretical analysis, simulations and experimental studies conducted led to a similar conclusion: 25% of the distance computations are wasteful and can be discarded without any repercussion on effectiveness.

APA, Harvard, Vancouver, ISO, and other styles

Wang, Rongcun, Zhengmin Li, Shujuan Jiang, and Chuanqi Tao. "Regression Test Case Prioritization Based on Fixed Size Candidate Set ART Algorithm." International Journal of Software Engineering and Knowledge Engineering 30, no. 03 (March 2020): 291–320. http://dx.doi.org/10.1142/s0218194020500138.

Full text

Abstract:

Regression testing is a very time-consuming and expensive testing activity. Many test case prioritization techniques have been proposed to speed up regression testing. Previous studies show that no one technique is always best. Random strategy, as the simplest strategy, is not always so bad. Particularly, when a test suite has higher fault detection capability, the strategy can generate a better result. Nevertheless, due to the randomness, the strategy is not always as satisfactory as expected. In this context, we present a test case prioritization approach using fixed size candidate set adaptive random testing algorithm to reduce the effect of randomness and improve fault detection effectiveness. The distance between pair-wise test cases is assessed by exclusive OR. We designed and conducted empirical studies on eight C programs to validate the effectiveness of the proposed approach. The experimental results, confirmed by a statistical analysis, indicate that the approach we proposed is more effective than random and the total greedy prioritization techniques in terms of fault detection effectiveness. Although the presented approach has comparable fault detection effectiveness to ART-based and the additional greedy techniques, the time cost is much lower. Consequently, the proposed approach is much more cost-effective.

APA, Harvard, Vancouver, ISO, and other styles

Bloem, Roderick, Goerschwin Fey, Fabian Greif, Robert Könighofer, Ingo Pill, Heinz Riener, and Franz Röck. "Synthesizing adaptive test strategies from temporal logic specifications." Formal Methods in System Design 55, no. 2 (October 14, 2019): 103–35. http://dx.doi.org/10.1007/s10703-019-00338-9.

Full text

Abstract:

Abstract Constructing good test cases is difficult and time-consuming, especially if the system under test is still under development and its exact behavior is not yet fixed. We propose a new approach to compute test strategies for reactive systems from a given temporal logic specification using formal methods. The computed strategies are guaranteed to reveal certain simple faults in every realization of the specification and for every behavior of the uncontrollable part of the system’s environment. The proposed approach supports different assumptions on occurrences of faults (ranging from a single transient fault to a persistent fault) and by default aims at unveiling the weakest one. We argue that such tests are also sensitive for more complex bugs. Since the specification may not define the system behavior completely, we use reactive synthesis algorithms with partial information. The computed strategies are adaptive test strategies that react to behavior at runtime. We work out the underlying theory of adaptive test strategy synthesis and present experiments for a safety-critical component of a real-world satellite system. We demonstrate that our approach can be applied to industrial specifications and that the synthesized test strategies are capable of detecting bugs that are hard to detect with random testing.

APA, Harvard, Vancouver, ISO, and other styles

Narciso, Everton Note, Márcio Eduardo Delamaro, and Fátima De Lourdes Dos Santos Nunes. "Test Case Selection: A Systematic Literature Review." International Journal of Software Engineering and Knowledge Engineering 24, no. 04 (May 2014): 653–76. http://dx.doi.org/10.1142/s0218194014500259.

Full text

Abstract:

Time and resource constraints should be taken into account in software testing activities, and thus optimizing the test suite is fundamental in the development process. In this context, the test case selection aims to eliminate redundant or unnecessary test data, which is crucial for the definition of test strategies. This paper presents a systematic review on the test case selection conducted through a selection of 449 articles published in leading journals and conferences in Computer Science. We addressed the state-of-art by collecting and comparing existing evidence on the methods used in the different software domains and the methods used to evaluate the test case selection. Our study identified 32 papers that met the research objectives, which featured 18 different selection methods and were evaluated through 71 case studies. The most commonly reported methods are adaptive random testing, genetic algorithms and greedy algorithm. Most approaches rely on heuristics, such as diversity of test cases and code or model coverage. This paper also discusses the key concepts and approaches, areas of application and evaluation metrics inherent to the methods of test case selection available in the literature.

APA, Harvard, Vancouver, ISO, and other styles

Wu, Huayao, Changhai Nie, Justyna Petke, Yue Jia, and Mark Harman. "An Empirical Comparison of Combinatorial Testing, Random Testing and Adaptive Random Testing." IEEE Transactions on Software Engineering 46, no. 3 (March 1, 2020): 302–20. http://dx.doi.org/10.1109/tse.2018.2852744.

Full text

APA, Harvard, Vancouver, ISO, and other styles

More sources

Dissertations / Theses on the topic "Computer software testing; adaptive random testing; random testing"

Kuo, Fei-Ching. "On adaptive random testing." Australasian Digital Thesis Program, 2006. http://adt.lib.swin.edu.au/public/adt-VSWT20061109.091517.

Full text

Abstract:

Thesis (Ph.D) - Swinburne University of Technology, Faculty of Information & Communication Technologies, 2006.
A thesis submitted for the degree of PhD, Faculty of Information and Communication Technologies, Swinburne University of Technology, 2006. Typescript. Bibliography: p. 126-133.

APA, Harvard, Vancouver, ISO, and other styles

Kuo, Fei-Ching, and n/a. "On adaptive random testing." Swinburne University of Technology, 2006. http://adt.lib.swin.edu.au./public/adt-VSWT20061109.091517.

Full text

Abstract:

Adaptive random testing (ART) has been proposed as an enhancement to random testing for situations where failure-causing inputs are clustered together. The basic idea of ART is to evenly spread test cases throughout the input domain. It has been shown by simulations and empirical analysis that ART frequently outperforms random testing. However, there are some outstanding issues on the cost-effectiveness and practicality of ART, which are the main foci of this thesis. Firstly, this thesis examines the basic factors that have an impact on the faultdetection effectiveness of adaptive random testing, and identifies favourable and unfavourable conditions for ART. Our study concludes that favourable conditions for ART occur more frequently than unfavourable conditions. Secondly, since all previous studies allow duplicate test cases, there has been a concern whether adaptive random testing performs better than random testing because ART uses fewer duplicate test cases. This thesis confirms that it is the even spread rather than less duplication of test cases which makes ART perform better than RT. Given that the even spread is the main pillar of the success of ART, an investigation has been conducted to study the relevance and appropriateness of several existing metrics of even spreading. Thirdly, the practicality of ART has been challenged for nonnumeric or high dimensional input domains. This thesis provides solutions that address these concerns. Finally, a new problem solving technique, namely, mirroring, has been developed. The integration of mirroring with adaptive random testing has been empirically shown to significantly increase the cost-effectiveness of ART. In summary, this thesis significantly contributes to both the foundation and the practical applications of adaptive random testing.

APA, Harvard, Vancouver, ISO, and other styles

Liu, Ning Lareina. "A study on improving adaptive random testing." Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B36428061.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Towey, David Peter. "Studies of different variations of Adaptive Random Testing." Thesis, View the Table of Contents & Abstract, 2006. http://sunzi.lib.hku.hk/hkuto/record/B3551212X.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Liu, Ning Lareina, and 劉寧. "A study on improving adaptive random testing." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2006. http://hub.hku.hk/bib/B36428061.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Merkel, Robert Graham, and robert merkel@benambra org. "Analysis and enhancements of adaptive random testing." Swinburne University of Technology, 2005. http://adt.lib.swin.edu.au./public/adt-VSWT20050804.144747.

Full text

Abstract:

Random testing is a standard software testing method. It is a popular method for reli-ability assessment, but its use for debug testing has been opposed by some authorities. Random testing does not use any information to guide test case selection, and so, it is argued, testing is less likely to be effective than other methods. Based on the observation that failures often cluster in contiguous regions, Adaptive Random Testing (ART) is a more effective random testing method. While retaining random selection of test cases, selection is guided by the idea that tests should be widely spread throughout the input domain. A simple way to implement this concept, FSCS-ART, involves randomly generating a number of candidates, and choosing the candidate most widely spread from any already-executed test. This method has already shown to be up to 50% more effective than random testing. This thesis examines a number of theoretical and practical issues related to ART. Firstly, an theoretical examination of the scope of adaptive methods to improve testing effectiveness is conducted. Our results show that the maximum improvement in failure detection effectiveness possible is only 50% - so ART performs close to this limit on many occasions. Secondly, the statistical validity of the previous empirical results is examined. A mathematical analysis of the sampling distribution of the various failure-detection effectiveness methods shows that the measure preferred in previous studies has a slightly unusual distribution known as the geometric distribution, and that that it and other measures are likely to show high variance, requiring very large sample sizes for accurate comparisons. A potential limitation of current ART methods is the relatively high selection overhead. A number of methods to obtain lower overheads are proposed and evaluated, involving a less-strict randomness or wide-spreading criterion. Two methods use dynamic, as-needed partitioning to divide the input domain, spreading test cases throughout the partitions as required. Another involves using a class of numeric sequences called quasi-random sequences. Finally, a more efficient implementation of the existing FSCS-ART method is proposed using the mathematical structure known as the Voronoi diagram. Finally, the use of ART on programs whose input is non-numeric is examined. While existing techniques can be used to generate random non-numeric candidates, a criterion for 'wide spread' is required to perform ART effectively. It is proposed to use the notion of category-partition as such a criterion.

APA, Harvard, Vancouver, ISO, and other styles

Liu, Huai. "On even spread of test cases in adaptive random testing." Swinburne Research Bank, 2008. http://hdl.handle.net/1959.3/40129.

Full text

Abstract:

Thesis (Ph.D) - Swinburne University of Technology, Faculty of Information & Communication Technologies, 2008.
A thesis submitted for the degree of Doctor of Philosophy, Faculty of Information and Communication Technologies, Swinburne University of Technology, 2008. Typescript. Bibliography: p. 107-123.

APA, Harvard, Vancouver, ISO, and other styles

Tappenden, Andrew. "Testing the Internet state management mechanism." Phd thesis, 2010. http://hdl.handle.net/10048/1055.

Full text

Abstract:

This thesis presents an extensive survey of 100,000 websites as the basis for understanding the deployment of cookies across the Internet. The survey indicates cookie deployment on the Internet is approaching universal levels. The survey identifies the presence of P3P policies and dynamic web technologies as major predictors of cookie usage, and a number of significant relationships are established between the origin of the web application and cookie deployment. Large associations are identified between third-party persistent cookie usage and a countrys e-business environment. Cookie collection testing (CCT), a strategy for testing web applications, is presented. Cookies maintained in a browser are explored in light of anti random testing techniques, culminating in the definition of seeding vectors as the basis for a scalable test suite. Essentially CCT seeks to verify web application robustness against the modificationintentional or otherwiseof an application's internal state variables. Automation of CCT is outlined through the definition of test oracles and evaluation criterion. Evolutionary adaptive random (eAR) testing is proposed for application to the cookie collection testing strategy. A simulation study is undertaken to evaluate eAR against the current state-of-the-art in adaptive random testingfixed size candidate set, restricted random testing, quasi-random testing, and random testing. eAR is demonstrated to be superior to the other techniques for block pattern simulations. For fault patterns of increased complexity, eAR is shown to be comparable to the other methods. An empirical investigation of CCT is undertaken. CCT is demonstrated to reveal defects within web applications, and is found to have a substantial fault-triggering rate. Furthermore, CCT is demonstrated to interact with the underlying application, not just the technological platform upon which an application is implemented. Both seeding and generated vectors are found to be useful in triggering defects. A synergetic relationship is found to exist between the seeding and generated vectors with respect to distinct fault detection. Finally, a large significant relationship is established between structural and content similarity measures of web application responses, with a composite of the two similarity measures observed to be superior in the detection of faults.
Software Engineering and Intelligent Systems

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Computer software testing; adaptive random testing; random testing"

Chen, T. Y., H. Leung, and I. K. Mak. "Adaptive Random Testing." In Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making, 320–29. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30502-6_23.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Chen, T. Y., De Hao Huang, and Zhi Quan Zhou. "Adaptive Random Testing Through Iterative Partitioning." In Reliable Software Technologies – Ada-Europe 2006, 155–66. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11767077_13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Mayer, Johannes. "Adaptive Random Testing by Bisection and Localization." In Formal Approaches to Software Testing, 72–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11759744_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Mayer, Johannes. "Adaptive Random Testing by Bisection with Restriction." In Formal Methods and Software Engineering, 251–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11576280_18.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Koo, Dong-Su, and Young B. Park. "OFART: OpenFlow-Switch Adaptive Random Testing." In Advances in Computer Science and Ubiquitous Computing, 631–36. Singapore: Springer Singapore, 2016. http://dx.doi.org/10.1007/978-981-10-3023-9_97.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Iqbal, Muhammad Zohaib, Andrea Arcuri, and Lionel Briand. "Combining Search-Based and Adaptive Random Testing Strategies for Environment Model-Based Testing of Real-Time Embedded Systems." In Search Based Software Engineering, 136–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-33119-0_11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dimjašević, Marko, Falk Howar, Kasper Luckow, and Zvonimir Rakamarić. "Study of Integrating Random and Symbolic Testing for Object-Oriented Software." In Lecture Notes in Computer Science, 89–109. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-98938-9_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Devika Rani Dhivya, K., and V. S. Meenakshi. "An Optimized Adaptive Random Partition Software Testing by Using Bacterial Foraging Algorithm." In Computational Vision and Bio Inspired Computing, 542–55. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-71767-8_47.

Full text

APA, Harvard, Vancouver, ISO, and other styles

TOWEY, DAVE. "ADAPTIVE RANDOM TESTING." In Adaptive Control Approach for Software Quality Improvement, 57–76. WORLD SCIENTIFIC, 2011. http://dx.doi.org/10.1142/9789814340922_0003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Hunt III, Harry B., and Madhav V. Marathe. "Towards a Predictive Computational Complexity Theory for Periodically Specified Problems: A Survey." In Computational Complexity and Statistical Physics. Oxford University Press, 2005. http://dx.doi.org/10.1093/oso/9780195177374.003.0022.

Full text

Abstract:

The preceding chapters in this volume have documented the substantial recent progress towards understanding the complexity of randomly specified combinatorial problems. This improved understanding has been obtained by combining concepts and ideas from theoretical computer science and discrete mathematics with those developed in statistical mechanics. Techniques such as the cavity method and the replica method, primarily developed by the statistical mechanics community to understand physical phenomena, have yielded important insights into the intrinsic difficulty of solving combinatorial problems when instances are chosen randomly. These insights have ultimately led to the development of efficient algorithms for some of the problems. A potential weakness of these results is their reliance on random instances. Although the typical probability distributions used on the set of instances make the mathematical results tractable, such instances do not, in general, capture the realistic instances that arise in practice. This is because practical applications of graph theory and combinatorial optimization in CAD systems, mechanical engineering, VLSI design, transportation networks, and software engineering involve processing large but regular objects constructed in a systematic manner from smaller and more manageable components. Consequently, the resulting graphs or logical formulas have a regular structure, and are defined systematically in terms of smaller graphs or formulas. It is not unusual for computer scientists and physicists interested in worst-case complexity to study problem instances with regular structure, such as lattice-like or tree-like instances. Motivated by this, we discuss periodic specifications as a method for specifying regular instances. Extensions of the basic formalism that give rise to locally random but globally structured instances are also discussed. These instances provide one method of producing random instances that might capture the structured aspect of practical instances. The specifications also yield methods for constructing hard instances of satisfiability and various graph theoretic problems, important for testing the computational efficiency of algorithms that solve such problems. Periodic specifications are a mechanism for succinctly specifying combinatorial objects with highly regular repetitive substructure. In the past, researchers have also used the term dynamic to refer to such objects specified using periodic specifications (see, for example, Orlin [419], Cohen and Megiddo [103], Kosaraju and Sullivan [347], and Hoppe and Tardos [260]).

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Computer software testing; adaptive random testing; random testing"

Huang, Rubing, Xiaodong Xie, Tsong Yueh Chen, and Yansheng Lu. "Adaptive Random Test Case Generation for Combinatorial Testing." In 2012 IEEE 36th Annual Computer Software and Applications Conference - COMPSAC 2012. IEEE, 2012. http://dx.doi.org/10.1109/compsac.2012.15.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Zhou, Zhi Quan. "Using Coverage Information to Guide Test Case Selection in Adaptive Random Testing." In 2010 IEEE 34th Annual Computer Software and Applications Conference Workshops (COMPSACW). IEEE, 2010. http://dx.doi.org/10.1109/compsacw.2010.43.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Chen, T. Y. "Adaptive Random Testing." In 2008 Eighth International Conference on Quality Software (QSIC). IEEE, 2008. http://dx.doi.org/10.1109/qsic.2008.22.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Chen, T. Y., F. C. Kuo, R. G. Merkel, and S. P. Ng. "Mirror adaptive random testing." In Third International Conference on Quality Software, 2003. Proceedings. IEEE, 2003. http://dx.doi.org/10.1109/qsic.2003.1319079.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Chan, Kwok, T. y. Chen, and Dave Towey. "Probabilistic Adaptive Random Testing." In 2006 Sixth International Conference on Quality Software (QSIC'06). IEEE, 2006. http://dx.doi.org/10.1109/qsic.2006.48.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Chen, Tsong Yueh, Fei-Ching Kuo, Huai Liu, and W. Eric Wong. "Does Adaptive Random Testing Deliver a Higher Confidence than Random Testing?" In 2008 Eighth International Conference on Quality Software (QSIC). IEEE, 2008. http://dx.doi.org/10.1109/qsic.2008.23.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Patrick, Matthew, and Yue Jia. "Kernel Density Adaptive Random Testing." In 2015 IEEE Eighth International Conference on Software Testing, Verification and Validation Workshops (ICSTW). IEEE, 2015. http://dx.doi.org/10.1109/icstw.2015.7107451.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Lv, Chengcheng, Long Zhang, Fanping Zeng, and Jian Zhang. "Adaptive Random Testing for XSS Vulnerability." In 2019 26th Asia-Pacific Software Engineering Conference (APSEC). IEEE, 2019. http://dx.doi.org/10.1109/apsec48747.2019.00018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Chen, Tsong Yueh, Fei-Ching Kuo, and Huai Liu. "Distribution Metric Driven Adaptive Random Testing." In Seventh International Conference on Quality Software (QSIC 2007). IEEE, 2007. http://dx.doi.org/10.1109/qsic.2007.4385507.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Sabor, Korosh Koochekian, and Stuart Thiel. "Adaptive Random Testing by Static Partitioning." In 2015 IEEE/ACM 10th International Workshop on Automation of Software Test (AST). IEEE, 2015. http://dx.doi.org/10.1109/ast.2015.13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!