Explore the vast range of titles available.

Search-based optimization techniques have been applied to structural software test data generation since 1992, with a recent upsurge in interest and activity within this area. However, despite the large number of recent studies on the applicability of different search-based optimization approaches, there has been very little theoretical analysis of the types of testing problem for which these techniques are well suited. There are also few empirical studies that present results for larger programs. This paper presents a theoretical exploration of the most widely studied approach, the global search technique embodied by Genetic Algorithms. It also presents results from a large empirical study that compares the behavior of both global and local search-based optimization on real-world programs. The results of this study reveal that cases exist of test data generation problem that suit each algorithm, thereby suggesting that a hybrid global-local search (a Memetic Algorithm) may be appropriate. The paper presents a Memetic Algorithm along with further empirical results studying its performance.

Search-Based Test Data Generation reformulates testing goals as fitness functions so that test input generation can be automated by some chosen search-based optimization algorithm. The optimization algorithm searches the space of potential inputs, seeking those that are \"fit for purpose,\" guided by the fitness function. The search space of potential inputs can be very large, even for very small systems under test. Its size is, of course, a key determining factor affecting the performance of any search-based approach. However, despite the large volume of work on Search-Based Software Testing, the literature contains little that concerns the performance impact of search space reduction. This paper proposes a static dependence analysis derived from program slicing that can be used to support search space reduction. The paper presents both a theoretical and empirical analysis of the application of this approach to open source and industrial production code. The results provide evidence to support the claim that input domain reduction has a significant effect on the performance of local, global, and hybrid search, while a purely random search is unaffected.

A testability transformation is a source-to-source transformation that aims to improve the ability of a given test generation method to generate test data for the original program. We introduce testability transformation, demonstrating that it differs from traditional transformation, both theoretically and practically, while still allowing many traditional transformation rules to be applied. We illustrate the theory of testability transformation with an example application to evolutionary testing. An algorithm for flag removal is defined and results are presented from an empirical study which show how the algorithm improves both the performance of evolutionary test data generation and the adequacy level of the test data so-generated.

Automated test data generation for path coverage (ATDG-PC) plays an important role in software testing. In this study, ATDG-PC is applied to the case of cloud computing such as Hadoop programmes which are more difficult to search for high-rate path coverage than the normal programmes. The search scale of ATDG-PC is usually enormous, while the relationship between the variables and the paths is unknown. First, a rapid meta-heuristic algorithm particle swarm optimisation (PSO) was chosen to solve the problem of large-scale search. Second, the strategy of convergence speed controller was used to improve the performance of PSO by mining heuristic information from the found paths. The controller adjusts the convergence speed balance periodically by two conditions and rules. The first strategy slows the convergence speed when the algorithm is premature convergence and is trapped in a local optimum. The second strategy accelerates the convergence speed if the algorithm does not converge after many iterations. The effectiveness of the proposed algorithm is evaluated by classic Hadoop programmes of cloud computing. The experimental results indicate that the proposed algorithm can reduce a great number of test cases for path coverage, compared with other metaheuristic algorithms for automated test data generation.

Guptet al., proposed a method, which is referred to as the Iterative Relaxation Method, to generate test data for a given path in a program by linearizing the predicate functions. In this paper, a model language is presented and the properties of static and dynamic data dependencies are investigated. The notions in the Iterative Relaxation Method are defined formally. The predicate slice proposed by Guptaet al. is extended to path-wise static slice. The correctness of the constructional algorithm is proved afterward. The improvement shows that the constructions of predicate slice and input dependency set can be omitted. The equivalence of systems of constraints generated by both methods is proved. The prototype of path-wise test data generator is presented in this paper. The experiments show that our method is practical, and fits the path-wise automatic generation of test data for both white-box testing and black-box testing.

The advancement of autonomous driving technology has had a significant impact on both transportation networks and people’s lives. Connected and automated vehicles as well as the surrounding driving environment are increasingly exchanging information. The traditional open road test or closed field test, which has large costs, lengthy durations, and few diverse test scenarios, cannot satisfy the autonomous driving system’s need for reliable and safe testing. Functional testing is the emphasis of the test since features such as frontal collision and traffic sign warning influence driving safety. As a result, simulation testing will undoubtedly emerge as a new technique for unmanned vehicle testing. A crucial aspect of simulation testing is the creation of test scenarios. With an emphasis on the map generating method and the dynamic scenario production method in the test scenarios, this article explains many scenarios and scenario construction techniques utilized in the process of self-driving car testing. A thorough analysis of the state of relevant research is conducted, and approaches for creating common scenarios as well as brand-new methods based on machine learning are emphasized.

As one of the critical technologies for performance evaluation of automated vehicles, the test scenario generation has been widespread concerned. In this paper, we propose a novel test scenario generation technology based on optimized Latin Hypercube Sampling (OLHS) and Test Matrix method (TM), named HIS-MPSO, which is efficient to generate the test scenario that consider the complexity, coverage, and potential relationships of factors. Based on naturalistic driving data, numerous car-following scenarios are generated by HIS-MPSO. Then, an adaptive cruise control system (ACC) are evaluated in terms of the tracking errors, comfort, and safety using the generated scenarios. Results show that compared with other existing OLHS algorithms, the HIS-MPSO can better restore the relationships among test factors existed in realistic traffic scenarios.

With the widespread adoption of large language models (LLMs) in code generation tasks, geospatial code generation has emerged as a critical frontier in the integration of artificial intelligence and geoscientific analysis. This growing trend underscores the urgent need for systematic evaluation methodologies to assess the generation capabilities of LLMs in geospatial contexts. In particular, geospatial computation and visualization tasks in the JavaScript environment rely heavily on the orchestration of diverse frontend libraries and ecosystems, posing elevated demands on a model’s semantic comprehension and code synthesis capabilities. To address this challenge, we propose GeoJSEval—the first multimodal, function-level automatic evaluation framework for LLMs in JavaScript-based geospatial code generation tasks. The framework comprises three core components: a standardized test suite (GeoJSEval-Bench), a code submission engine, and an evaluation module. It includes 432 function-level tasks and 2071 structured test cases, spanning five widely used JavaScript geospatial libraries that support spatial analysis and visualization functions, as well as 25 mainstream geospatial data types. GeoJSEval enables multidimensional quantitative evaluation across metrics such as accuracy, output stability, resource consumption, execution efficiency, and error type distribution. Moreover, it integrates boundary testing mechanisms to enhance robustness and evaluation coverage. We conduct a comprehensive assessment of 20 state-of-the-art LLMs using GeoJSEval, uncovering significant performance disparities and bottlenecks in spatial semantic understanding, code reliability, and function invocation accuracy. GeoJSEval offers a foundational methodology, evaluation resource, and practical toolkit for the standardized assessment and optimization of geospatial code generation models, with strong extensibility and promising applicability in real-world scenarios. This manuscript represents the peer-reviewed version of our earlier preprint previously made available on arXiv.

Test automation brings the potential to reduce costs and human effort, but several aspects of software testing remain challenging to automate. One such example is automated performance testing to find performance breaking points. Current approaches to tackle automated generation of performance test cases mainly involve using source code or system model analysis or use-case-based techniques. However, source code and system models might not always be available at testing time. On the other hand, if the optimal performance testing policy for the intended objective in a testing process instead could be learned by the testing system, then test automation without advanced performance models could be possible. Furthermore, the learned policy could later be reused for similar software systems under test, thus leading to higher test efficiency. We propose SaFReL, a self-adaptive fuzzy reinforcement learning-based performance testing framework. SaFReL learns the optimal policy to generate performance test cases through an initial learning phase, then reuses it during a transfer learning phase, while keeping the learning running and updating the policy in the long term. Through multiple experiments in a simulated performance testing setup, we demonstrate that our approach generates the target performance test cases for different programs more efficiently than a typical testing process and performs adaptively without access to source code and performance models.

Geospatial code generation is emerging as a key direction in the integration of artificial intelligence and geoscientific analysis. However, there remains a lack of standardized tools for automatic evaluation in this domain. To address this gap, we propose AutoGEEval, the first multimodal, unit-level automated evaluation framework for geospatial code generation tasks on the Google Earth Engine (GEE) platform powered by large language models (LLMs). Built upon the GEE Python API, AutoGEEval establishes a benchmark suite (AutoGEEval-Bench) comprising 1325 test cases that span 26 GEE data types. The framework integrates both question generation and answer verification components to enable an end-to-end automated evaluation pipeline—from function invocation to execution validation. AutoGEEval supports multidimensional quantitative analysis of model outputs in terms of accuracy, resource consumption, execution efficiency, and error types. We evaluate 18 state-of-the-art LLMs—including general-purpose, reasoning-augmented, code-centric, and geoscience-specialized models—revealing their performance characteristics and potential optimization pathways in GEE code generation. This work provides a unified protocol and foundational resource for the development and assessment of geospatial code generation models, advancing the frontier of automated natural language to domain-specific code translation.