• Title/Summary/Keyword: search-based software testing

Search Result 14, Processing Time 0.029 seconds

A Comparison of the Search Based Testing Algorithm with Metrics (메트릭에 따른 탐색 기반 테스팅 알고리즘 비교)

  • Choi, HyunJae;Chae, HeungSeok
    • Journal of KIISE
    • /
    • v.43 no.4
    • /
    • pp.480-488
    • /
    • 2016
  • Search-Based Software Testing (SBST) is an effective technique for test data generation on large domain size. Although the performance of SBST seems to be affected by the structural characteristics of Software Under Test (SUT), studies for the comparison of SBST techniques considering structural characteristics are rare. In addition to the comparison study for SBST, we analyzed the best algorithm with different structural characteristics of SUT. For the generalization of experimental results, we automatically generated 19,800 SUTs by combining four metrics, which are expected to affect the performance of SBST. According to the experiment results, Genetic algorithm showed the best performance for SUTs with high complexity and test data evaluation with count ${\leq}20,000$. On the other hand, the genetic simulated annealing and the simulated annealing showed relatively better performance for SUTs with high complexity and test data evaluation with count ${\geq}50,000$. Genetic simulated annealing, simulated annealing and hill climbing showed better performance for SUTs with low complexity.

A UML-based Approach towards Test Case Generation and Optimization

  • Shahid Saleem;Saif U. R. Malik;Bilal Mehboob;Roobaea Alroobaea;Sultan Algarni;Abdullah M. Baqasah;Naveed Ahmad;Muhammad Hasnain
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.3
    • /
    • pp.633-652
    • /
    • 2024
  • Software testing is an important phase as it ensures the software quality. The software testing process comprises of three steps: generation, execution, and evaluation of test cases. Literature claims the usage of single and multiple 'Unified Modeling Language' (UML) diagrams to generate test cases. Using multiple UML diagrams increases test case coverage. However, the existing approaches show limitations in test case generation from UML diagrams. Therefore, in this research study, we propose an approach to generate the test cases using UML State Chart Diagram (SCD), Activity Diagram (AD), and Sequence Diagram (SD). The proposed approach transforms UML diagrams into intermediate forms: SCD Graph, AD Graph, and SD Graph respectively. Furthermore, by integrating these three graphs, a System Testing Graph (STG) is formed. Finally, test cases are identified from STG by using a traversal algorithm such as Depth First Search (DFS) that is an optimization method. The results show that the proposed approach is better compared to existing approaches in terms of coverage and performance. Moreover, the generated test cases have the ability to detect faults at the unit level, integration, and system level testing.

A Test Case Generation Method for Data Distribution System of Submarine (잠수함 데이터 분산 시스템을 위한 테스트 케이스 생성 기법)

  • Son, Suik;Kang, Dongsu
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.8 no.4
    • /
    • pp.137-144
    • /
    • 2019
  • Testing maturity is critical to the system under development with lack of experience and skills in the acquisition of the weapon systems. Defects have a huge impact on important system operations. Sharing real-time information will lead to rapid command and mission capability in submarine. DDS(Data Distribution System) is a very important information sharing system and interface between various manufacturers or data formats. In this paper, we analyze data distribution characteristics of distributed data system to group data-specific systems and proposes a test case-generation method using path search of postorder and preorder which is a tree traversal in path testing method. The proposed method reduces 73.7.% testing resource compare to existing methods.

Automated Method for Detecting Use-After-Free Vulnerability of Windows System Calls Using Dynamic Symbolic Execution (동적 기호 실행을 이용한 윈도우 시스템 콜 Use-After-Free 취약점 자동 탐지 방법)

  • Kang, Sangyong;Lee, Gwonwang;Noh, Bongnam
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.27 no.4
    • /
    • pp.803-810
    • /
    • 2017
  • Recently, social security problems have been caused by the development of the software industry, and a variety of automation techniques have been used to verify software stability. In this paper, we propose a method of automatically detecting a use-after-free vulnerability on Windows system calls using dynamic symbolic execution, one of the software testing methods. First, a static analysis based pattern search is performed to select a target point. Based on the detected pattern points, we apply an induced path search technique that blocks branching to areas outside of interest. Through this, we overcome limitations of existing dynamic symbolic performance technology and verify whether vulnerability exists at actual target point. As a result of applying the proposed method to the Windows system call, it is confirmed that the use-after-free vulnerability, which had previously to be manually analyzed, can be detected by the proposed automation technique.

A Test Scenario Generation Method from Activity Diagram with Concurrency (동시성을 포함한 액티비티 다이어그램 기반 테스트 시나리오 생성 기법)

  • Back, Seungchan;Choi, Hyorin;Lee, Byungjeong;Lee, Jung-Won
    • Journal of KIISE
    • /
    • v.43 no.9
    • /
    • pp.1015-1025
    • /
    • 2016
  • Currently, software testing is becoming increasingly important in the industrial field and a large body of research supports the improvement of efficient software testing. Model-based testing is generally used to formalize user requirement data for test design. Complex system that includes loop and concurrency has a high probability of path explosion problem. Specially, as threads are added to concurrency, test scenarios have also increased exponentially. However, it is difficult to solve this problem using existing techniques. In this paper, we propose novel path-search technique that focuses on behavioral features of concurrency path in order to avoid path explosion problem. A system that contains concurrent paths is represented by activity diagram in case study section. Efficiency of our study is shown through comparison with several generated test scenarios of other studies. The result indicate that our approach is efficient for finding faults in loop and concurrency with fewer test scenario.

Usability Testing of Open Source Software for Digital Archiving (디지털 아카이브 구축을 위한 공개 소프트웨어 사용성 평가)

  • Jeon, Kyungsun;Chang, Yunkeum
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.52 no.3
    • /
    • pp.247-271
    • /
    • 2018
  • This research aims to explore the possibility of open source software for creating digital archives of small organizations or ordinary people that run short of budget and professional workforce and may easily create digital archives without the help of a professional. To do so, this study suggested three open source software, AtoM, ArchivesSpace, and Omeka, for such use, and conducted usability tests with system designers and users who had no experience with open source software. The results of the usability testing was that AtoM, which was developed to support the records management system and user services of small organizations, proved satisfactory to both system designers and users. ArchivesSpace had too many required fields with it to create archives. Omeka greatly satisfied the system designers because it is possible to create archives with simple inputs on the item level. However, Omeka, which focuses on exhibition functions while neglecting search functions, registered low satisfaction among the users. Based on the results of the usability testing, this study suggested selection criteria of open source software for small organizations or ordinary individuals, namely, purposes, license, characteristics, service creation environment, advantages and disadvantages, functions, metadata, file type, and interoperability.

A Method of Test Case Generation Using BPMN-Based Path Search (BPMN 기반 경로 탐색을 이용한 테스트 케이스 생성 기법)

  • Park, JeJun;Kang, DongSu
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.6 no.3
    • /
    • pp.125-134
    • /
    • 2017
  • The SOA (Service Oriented Architecture) based softwares are escalated because of quickly coping with business requirement. SOA can not apply to existing test method because of loosely coupled service and massage exchange architecture. In this paper, we suggest a method of test case generation using BPMN (Business Process Model and Notation). First we model processes, then make Business Flow Graph (BFG). After searching the euler path through symmetrized BFG about input and output degrees, we generate test cases. A method of test case generation using BPMN can apply at SOA-based system, and reduce the number of test cases.

Platform Development for Maze Search Algorithms Testing (미로 탐색 알고리즘 테스트를 위한 플랫폼 개발)

  • Seo, Hyo-Seok;Park, Jae-Min;Lee, Sang-Yong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.1
    • /
    • pp.42-47
    • /
    • 2010
  • Many contests by micro mouse was celebrated of which maze search algorithms performance are compared. That is used in various forms based on left(right) weight method, euclidean algorithm method, hill climbing method. However we feel uncomfortable to test algorithms performance through direct development of programs or hardwares as no software platform to test in maze search algorithms. In this research we develop of a platform for maze search algorithms that is easily to produce various forms of maze that are hard to be realized by hardware, to apply algorithms, and evaluate the seek time, operation count, steps and performance. The platform is consist of main layer, interface layer, user layer which has merit to apply and replace easily algorithms. We verified that the maze search algorithm can be applied even in the development and experiment of algorithm by evaluating and analyzing its performance through the experiment of platform.

DSL: Dynamic and Self-Learning Schedule Method of Multiple Controllers in SDN

  • Li, Junfei;Wu, Jiangxing;Hu, Yuxiang;Li, Kan
    • ETRI Journal
    • /
    • v.39 no.3
    • /
    • pp.364-372
    • /
    • 2017
  • For the reliability of controllers in a software defined network (SDN), a dynamic and self-learning schedule method (DSL) is proposed. This method is original and easy to deploy, and optimizes the combination of multiple controllers. First, we summarize multiple controllers' combinations and schedule problems in an SDN and analyze its reliability. Then, we introduce the architecture of the schedule method and evaluate multi-controller reliability, the DSL method, and its optimized solution. By continually and statistically learning the information about controller reliability, this method treats it as a metric to schedule controllers. Finally, we compare and test the method using a given testing scenario based on an SDN network simulator. The experiment results show that the DSL method can significantly improve the total reliability of an SDN compared with a random schedule, and the proposed optimization algorithm has higher efficiency than an exhaustive search.

The CHEK2 I157T Variant and Colorectal Cancer Susceptibility: A Systematic Review and Meta-analysis

  • Liu, Chuan;Wang, Qing-Shui;Wang, Ya-Jie
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.13 no.5
    • /
    • pp.2051-2055
    • /
    • 2012
  • Background: The cell cycle checkpoint kinase 2 (CHEK2) gene I157T variant may be associated with an increased risk of colorectal cancer, but it is unclear whether the evidence is sufficient to recommend testing for the mutation in clinical practice. Materials and Methods: We systematically searched PubMed, EMBASES, Elsevier and Springer for relevant articles before Apr 2012. Summary odds ratios (ORs) and 95% confidence intervals (95% CIs) were calculated using a fixed-effects or random-effects models with Review Manager 5.0 software. Results: A total of seven studies including 4,029 cases and 13,844 controls based on the search criteria were included for analysis. A significant association of the CHEK2 I157T C variant with unselected CRC was found (OR = 1.61, 95% CI = 1.40-1.87, P < 0.001). We also found a significant association with sporadic CRC (OR = 1.48, 95% CI = 1.23-1.77, P < 0.001) and separately with familial CRC (OR = 1.97, 95% CI = 1.41-2.74, P < 0.001). Conclusion: This meta-analysis demonstrates that the CHEK2 I157T variant may be another important CRC-predisposing gene, which increases CRC risk, especially in familial CRC.