Search

In this paper, we propose a novel model-based testing approach designed to consider the nuances of interactions among agents, allowing for inclusive, exclusive, or parallel execution. The aim is to prevent the activation of multiple behavioural scenarios during the testing of a specific scenario, ensuring that each detected error is uniquely associated with the tested scenario and not influenced by parallel scenarios. This approach involves generating a set of individual test cases that individually cover the interactions of the scenario under test. To achieve this purpose, the approach uses the AUML sequence diagram as a model and the constraints, expressed in object constraint language (OCL), necessary for the execution of each interaction to introduce plugs. These plugs must be able to eliminate from the interval of the test case inputs, compatible with the execution constraints of the interactions of the scenario under test, the part of the inputs compatible with the execution constraints of the other interactions that can be executed in parallel inclusively or exclusively with the interactions of the same scenario. The proposed approach is supported by a formal framework and applied to a concrete case study to illustrate its usefulness. [ABSTRACT FROM AUTHOR]

The application of genetic algorithm in multi-path coverage testing is a research hotspot. In the process of iteration between the old and new populations, the old population may contain excellent individuals from other sub-populations, which are not fully utilized, resulting in resource waste. At the same time, the number of individuals in the population will be much greater than that of reachable paths, and each individual will go through a reachable path. This causes multiple individuals to pass through the same path, leading to repeated calculation of the similarity between the individual and the target path. Based on this, a multi-path coverage testing method combined with path similarity table and individual migration is proposed to improve testing efficiency. By storing the calculated path similarity value in the path similarity table, the value can be avoided from being calculated repeatedly and the testing time can be reduced. In the evolutionary process, the individual path is compared with other target paths, and if the similarity reaches the threshold, the excellent individual is migrated to the sub-population corresponding to the path, which improves the utilization rate of individuals and reduces the evolutionary generation. Experiments show that, compared with other six classic methods, the proposed method reduces the average generation time on eight programs by up to 44.64%, and the minimum is 2.64%, and the average evolution generation is reduced by up to 35.08%, and the minimum is 6.13%. Therefore, the proposed method effectively improves the test efficiency.

This paper goal is to provide a more effective algorithm for reducing the amount of test cases in a test suit during the regression testing phase. This algorithm divides the entire test suit into equivalence classes at first then apply boundary value coverage to select test case out of repeated test cases with same importance in suit. This algorithm is based on the concept that before selecting best test cases out of repeated test case in test suit to prepare reduced test suit we can divide all test cases in number of equivalence classes to reduce test cases by great extent. This paper proposed a method of experimentation involving test cases from different software application areas. Furthermore, we discuss a case study to verify and check new algorithm for its efficiency, for that we apply our algorithm on one of the program or group of programs. This complete proposed methodology shall be applied to different software applications belonging to soft computing, engineering software, and financial software. This wok has not been done earlier as found in the literature survey performed by us. Minimization in test cases would lead to lesser testing effort and desirable test completion. [ABSTRACT FROM AUTHOR]

Current testing methods for autonomous driving systems primarily focus on simple traffic scenarios, generating test cases based on traffic accidents, while research on generating edge test cases for complex driving environments by traffic regulations is not adequately comprehensive. Therefore, we propose a method for scenario modeling and violation testing using an autonomous driving system based on traffic regulations named TraModeAVTest. Initially, TraModeAVTest constructs a Petri net model for complex scenarios based on the combination relationships of basic traffic regulation scenarios and verifies the consistency of the model's design with traffic regulation requirements using formal methods, to provide a representation of traffic regulation scenario models for the violation testing of autonomous driving systems. Subsequently, based on the coverage criteria of the Petri net model, it utilizes a search strategy to generate model paths that represent traffic regulations, and employs a parameter combination method to generate test cases that cover the model paths, to test the violation behaviors of autonomous driving systems. Finally, simulation experiment results on the Baidu Apollo demonstrate that the test cases representing traffic regulations generated by TraModeAVTest can effectively identify the behaviors of autonomous vehicles violating traffic regulations, and TraModeAVTest can effectively improve the efficiency of generating different types of violation scenarios. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Frontiers of Computer Science & Technology is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

An IntelliSchool: A Student Information System (SIS) for Senior High School (SHS) is a software application intended to oversee and simplify different aspects of student-related academic information efficiently. This study aimed to ensure data accuracy and consistency, develop a paperless and web-based class record, ensure fairness and transparency in generating forms, and enhance parent-school communication and involvement by incorporating a messaging system. Descriptive-developmental approach was employed in this study. Interviews and direct observation of transaction processes were used as data collection methods in developmental approach. The software development life cycle (SDLC) adopted was Rapid Application Development (RAD), encompassing stages from requirements planning, user design, development, and system launch. The system was developed using Code Igniter PHP Framework, MySql, JQuery, and Code Espresso SMS Gateway technologies. In descriptive approach, test case to check systems functionality and Post Study System Usability Questionnaire (PSSUQ) were administered sequentially to 5 IT experts and 35 end-users. In data analysis, standard mean was employed. The test case obtained "passed" rating. In PSSUQ, overall mean is 1.21 across system usefulness, interface quality, and information quality. The system has undergone pilot implementation through locally hosted network infrastructure, fulfilling its intended nature and purpose. The recommendation was to use a server that accommodates users without sacrificing the system's performance. [ABSTRACT FROM AUTHOR]

Test case growth in software maintenance poses multifaceted challenges, including extended execution times, heightened costs, maintenance complexities, and increased system intricacy. Larger test cases not only introduce redundancy but also elevate the risk of overlooking defects during testing, emphasizing the need to manage test case expansion effectively while maintaining adequate testing coverage. One approach to mitigating this issue is risk-based prioritization, which focuses on testing critical and high-risk areas of the software. By emphasizing these pivotal aspects, this method aims to streamline test cases, optimizing testing efforts. However, it has limitations, as it may not comprehensively address all functional requirements, necessitating an in-depth understanding of the software system's architecture and vulnerabilities. Furthermore, requirements-based prioritization ensures thorough testing of all functional requirements, crucial for meeting industry standards and regulatory compliance. This approach utilizes clear criteria provided by requirements to evaluate whether software functions as intended. While effective in guaranteeing comprehensive coverage, it may fall short in addressing all potential risks and vulnerabilities, potentially undermining its effectiveness in identifying and prioritizing critical areas of the software. Considering these challenges, a nuanced approach that combines risk-based and requirements-based prioritization could offer a balanced solution. By leveraging the strengths of both methods, it becomes possible to address the diverse aspects of software testing, optimizing coverage, and efficiently managing test case growth. Moreover, the proposed model demonstrates promising results in tackling these challenges. With a notable test suite size reduction of 0.61-1.05% compared to traditional methods and a faultless percentage surpassing comparative studies by 0.05-0.75% across seven C-language System Under Test (SUT) programs, the model showcases its efficacy in improving testing efficiency and reliability. These findings underscore the potential of adopting advanced models to navigate the complexities associated with test case management and software testing in general. [ABSTRACT FROM AUTHOR]

The Internet of Things communication protocol is prone to security vulnerabilities when facing increasing types and scales of network attacks, which can affect the communication security of the Internet of Things. It is crucial to effectively detect these vulnerabilities in order to improve the security of IoT communication protocols and promptly fix them. Therefore, this study proposes a distributed IoT communication protocol vulnerability detection method based on an improved parallelized fuzzy testing algorithm. Firstly, based on design principles and by comparing different communication protocols, a communication architecture for the distribution network's Internet of Things was constructed, and the communication protocols were formalized and decomposed. Next, preprocess the vulnerability detection samples, and then use genetic algorithm to improve the parallelized fuzzy testing algorithm to perform vulnerability detection. Through this improved algorithm, the missed detection rate and false detection rate can be effectively reduced, thereby improving the security of IoT communication protocols. The experimental results show that the highest missed detection rate of this method is only 4.0 %, and the false detection rate is low, with high detection efficiency. This indicates that the method has good performance and reliability in detecting vulnerabilities in IoT communication protocols.

In order to better test the virtual training system for automotive safety driving, ensuring that the system can efficiently and comprehensively cover all application scenarios, this paper defines the syntax and semantics of formal graphical symbols for testing. Based on this, a method for designing test cases for the virtual training system for automotive safety driving using formal activity diagrams is proposed. The example demonstrates that after using this method for test case design, the designed test cases can efficiently test all necessary application scenarios and eliminate invalid scenarios. This method effectively addresses the issues of strong randomness and low testing efficiency in system testing.

Automated test case generation is important in software testing to evaluate developed software. The testing process requires test cases that can be based on Software Requirements Specification (SRS) and Software Design Document (SDD). One of UML diagrams included in the previous documentations is sequence diagram. This research proposed a modified pre-order algorithm that can generate test cases automatically from sequence diagrams. Our manual cyclomatic complexity evaluation showed that our method produced accurate test cases based on the sequence of messages in the sequence diagram. This result justifies that the generated test cases match the relevant sequence diagram. [ABSTRACT FROM AUTHOR]

Aiming at the test requirements of specified path coverage of fully automatic operation (FAO) system test, this paper proposes an algorithm for automatic generation of test cases for FAO based on the modeling theory of timed automata to meet the specified path coverage and edge coverage. Firstly, the modeling theory of timed automata is studied, and the FAO timed automata model is established. Then, a modeling method to add marker variables to the d automata model is proposed to characterize the FAO test requirements of specified path coverage. Thirdly, combined with the test case generation mechanism of Yggdrasil, a test case generation method of FAO is proposed, which satisfies both the specified path coverage and edge coverage criteria of FAO. Finally, taking the mode conversion function of FAO as an example, the timed automata model is established and test cases are generated. The results show that the test cases cover 100 % of the test requirements specified by the tester and all the edges of the timed automata model, which can meet the test requirements of the specified path coverage of FAO. [ABSTRACT FROM AUTHOR]

One of the significant features of software quality is software reliability. In the testing phase, faults are identified and corrected by integrating them into software development, thus obtaining better reliability. Here, by utilizing the Elliptical Distributions-centric Emperor Penguins Colony Algorithm (ED-EPCA)-based Test Case Prioritization (TCP), an effectual Fault Detection (FD) technique is proposed using Fishers Yates Shuffled Shepherd Optimization Algorithm (FY-SSOA)-based Test Case Selection (TCS). Initially, for the incoming source code, the Test Case (TC) is created. Then, the significant factors needed for TCS and prioritization are identified. Next, by utilizing the Log Scaling-centered Generalized Discriminant Analysis (LS-GDA) model, the estimated factors are abated further to enhance the TCS along with prioritization for the Fault Detection Process (FDP). Then, using the FY-SSOA, the optimized TCs are selected. Subsequently, with the help of ED-EPCA, the TCs being selected are ranked as well as prioritized. Finally, to validate the proposed system's effectiveness, the model's performance is evaluated in the working platform of Java and analogized with the traditional methodologies. The results indicate that the test case prioritization-based fault detection method is robust with a 99.23% fault detection rate and a small amount of memory usage, which is only 8245475 kb by generating a large number of test cases. [ABSTRACT FROM AUTHOR]

A fault reduction system for software applications is put forward in direct random testing which includes two phases i.e., test case generation and false reduction. The system's primary components are a database, a false reduction mechanism, a test case creation mechanism, and an application selection mechanism. By using feature values from the input application, the test case generation method sets up an Object Behaviour Dependence Model (OBDM) to produce test cases. In addition to the indistinguishable inputs, the false reduction method configures an Adaptive Genetic Algorithm (AGA) to minimise the banned inputs. The AGA graciously accepts the exposure measurements of the experiment circumstances in order to considerably reduce the tendency to make mistakes. [ABSTRACT FROM AUTHOR]

Combinatorial t-way technique is efficient in generating test data and addressing the problem of combinatorial explosion. When constructing a test case, numerous literatures classified t-way strategies into two basic approaches as either One-test-at-a-time approach (OTAT) and One-parameter-at-a-time approach (OPAT). At least three major challenge groups can be encountered when creating test cases. The first one is provision of parameters seeding support that will improve the software quality. The second involves automatically obtaining data regarding parameter constraints and identifying interactions between system components. The last one is the execution speed and the test suite size. However, in all the existing OPAT t-way strategies, given that the system is loaded with this information, testing present-day software systems is made difficult or impossible. This study presents an effective combinatorial t-way test case generation strategy named Seeding and Constraint support in In-Parameter-Order Generalized (SCIPOG), to develop an improved paired testing approach. However, the study examines the present state-of-the-art and compares several OPAT strategies found in the literature. Moreover, experiments are discussed as part of this process to demonstrate the correctness of the implementation. When statistically analyzing the findings, two non-parametric tests—the Wilcoxon Rank and Friedman tests–were run. SCIPOG, however, produced competitive results. Finally, SCIPOG showed the efficiency of the two proposed methods, which are seeding and constraint support in IPOG strategy.

Copyright of Railway Signalling & Communication Engineering is the property of Railway Signalling & Communication Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Software plays a vital role in modern society's application systems. Typically, it is assumed that there are finite faults in the software during software development. However, the development of new functions, such as user requests or other sources, can cause the size of test-case pools to increase, necessitating the reduction of the test suite due to time and resource constraints. To address this issue, this study proposes a Fuzzy Expert System (FES)-based method to improve the fault detection effectiveness of reduced test suites. Specifically, the FES approach is integrated into the traditional test suite reduction technique, the GE algorithm. The performance of our proposed modified Fuzzy-GE algorithm is evaluated based on real programs by using objective criteria. The results show that our approach can effectively reduce the sizes of test suites while also improving the effectiveness of fault detection. [ABSTRACT FROM AUTHOR]

This paper proposes a creation method of comprehensive cases and specifications for hardware and software combined test (HSCT) to detect undesirable events of an industrial product controlled by software using hazard and operability studies (HAZOP). By testing with created HSCT specifications, the proposed method detects undesirable events of the industrial product. To remove undesirable events in industrial products, it is important to confirm the behaviour of as many undesirable events as possible in HSCT. However, since the HSCT cases were manually created by engineers, the coverage of the HSCT cases was insufficient. This paper proposes a comprehensive creation method of HSCT cases and specifications to resolve the problem of insufficient coverage of HSCT cases. The following countermeasures are implemented to realize the proposed method. (1) Define the method for extracting the parameters used in HAZOP from the hardware and software specifications, and define the information necessary to create HSCT cases and specifications. (2) Prepare HAZOP guide words for HSCT. (3) Define the format of parameters and guide words and the procedure for creating HSCT cases by combining parameters and guide words. (4) Propose a creation procedure of HSCT specifications corresponding to the HSCT cases. (5) Propose an adequate HSCT procedure that includes methods (1)–(4). As a result of the application of the proposed method, 25% more adequate HSCT cases are created and 40% more undesirable events were detected in comparison with the manual creation. Additionally, the creation time was reduced by 27%.

State-based testing is a challenging area in the software testing field. This paper proposes a set of algorithms to generate test cases from a state chart diagram based on various coverage criteria. The objective is to find various types of state-based faults by covering states and transitions of an object. First, the state chart diagram is transformed into an intermediate graph, State Chart Intermediate Graph (SCIG). Then, for a given coverage criteria, traversing method is applied on SCIG to generate test cases. Different trees from SCIG based on various coverage criteria are extracted for test case generation. Various coverage criteria such as All Transition (AT), Round Trip Path (RTP) and All Transition Pair (ATP) are considered. We introduce algorithms for two most efficient state-based criteria, RTP and ATP. Two case studies, Stack Operation and Vending Machine Automation system, are discussed throughout the paper. We experimentally observed that (i) AT consumes the most test resources (ii) ATP can’t achieve 100% transition coverage (iii) test cases generated based on RTP is efficient, and it overcomes the transition explosion problem of AT. This analysis is beneficial in the area of semi-automatic test case generation in model-based testing.

• The construction and design of detection cases in the digital test detection mode of single-phase grounding fault in distribution network is the key to the detection task. • A method for calculating the comprehensive difficulty coefficient of single-phase grounding fault detection cases of distribution switches is proposed to scientifically and quantitatively evaluate the difficulty of fault detection case waveforms. • The proposed Latin hypercube sampling (LHS) based on NSGA-II double-objective optimization meets the requirements of comprehensiveness and uniformity of coverage fault types and balance of detection difficulty. Test case design is the key to effective quality inspection of electrical equipment. To tackle the challenges of inadequate scenario coverage and disparate difficulty levels in the detection of single-phase ground faults in power distribution primary and secondary fusion switch, we propose a case construction method utilizing Latin hypercube sampling (LHS) based on NSGA-II double-objective optimization. Initially, the method investigates the primary factors influencing waveform detection difficulty and determines their respective weights through measurement and calculation, thus establishing a comprehensive model for calculating difficulty coefficients. Then, based on the dual objectives of uniformity and difficulty balance, we introduce a double-objective optimization LHS generation algorithm to construct a multi-dimensional detection cases of single-phase ground fault in power distribution primary and secondary fusion switch. Finally, the difficulty coefficient calculation model and the constructed test case undergo validation using actual test results, demonstrating a 43.59% efficiency improvement on the premise of ensuring the detection efficacy. [ABSTRACT FROM AUTHOR]

Copyright of Railway Signalling & Communication Engineering is the property of Railway Signalling & Communication Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Railway Standard Design is the property of Railway Standard Design Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Computer Measurement & Control is the property of Magazine Agency of Computer Measurement & Control and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

The universal verification methodology (UVM) testbench utilizes the bus interface to access the design under verification (DUV) and registers using constraint random access. The UVM testbench is not able to perform cross-platform reusable verification. Alone UVM libraries are non-efficient for cross-platform migration, and individual C package modules are prone to miss corner cases with lower functional coverage. Thus, conventional UVM testbench needs a C test module for target-specific implementation. This work targets the implementation of hybrid UVM-C testbench architecture to potentially implement the auto-survivor path generation on higher integration. This paper proposes the UVM-C testbench model is capable of creating reusable test cases for design and registers with cross-platform communication. The new automation helps in the extraction of input parameters to implement script-based auto-covergroups and basic assertions to improvise functional coverage. The proposed UVM-C model implementation reduces the processing time, module capture value, and simulation time compared to state-of-the-art SystemVerilog and UVM verification methodologies. The method refines the processing time and simulation time by 16.41% and 15.23% as compared to SystemVerilog, while the improvement is 7.89% and 7.44% from UVM. The work also provides an average simulation instance value improvement of 11 per module per testbench run as compared to sole conventional UVM testbench. [ABSTRACT FROM AUTHOR]

State-based testing is a challenging area in the software testing field. This paper proposes a set of algorithms to generate test cases from a state chart diagram based on various coverage criteria. The objective is to find various types of state-based faults by covering states and transitions of an object. First, the state chart diagram is transformed into an intermediate graph, State Chart Intermediate Graph (SCIG). Then, for a given coverage criteria, traversing method is applied on SCIG to generate test cases. Different trees from SCIG based on various coverage criteria are extracted for test case generation. Various coverage criteria such as All Transition (AT), Round Trip Path (RTP) and All Transition Pair (ATP) are considered. We introduce algorithms for two most efficient state-based criteria, RTP and ATP. Two case studies, Stack Operation and Vending Machine Automation system, are discussed throughout the paper. We experimentally observed that (i) AT consumes the most test resources (ii) ATP can't achieve 100% transition coverage (iii) test cases generated based on RTP is efficient, and it overcomes the transition explosion problem of AT. This analysis is beneficial in the area of semi-automatic test case generation in model-based testing. [ABSTRACT FROM AUTHOR]

In the software development process, traceability links between unit tests and code are not explicitly maintained, and dependencies in most cases are manually identified. As a result, a large amount of effort and time is required during the comprehension process to establish the links between these artifacts. Although there are several methods that can infer such links based on different phenomenons, these methods usually produce different set of traceability links. This work expands upon previous traceability link recovery and visualization studies by implementing a combination of traceability recovery methods that automatically retrieve the links, and visualizing them to help developers to overview the links inferred by various recovery techniques, and also to select the right relations for analyses. The results of the usability study show that the visualization model presented herein can effectively support browsing, comprehension, and maintenance of Test-to Code Traceability (TCT) links in a system with enhanced efficiency, as well as visualization of TCT links from multiple sources is better than a visualization of single source of traceability links.

Copyright of Computer Measurement & Control is the property of Magazine Agency of Computer Measurement & Control and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)