Subnets Generation of Program Nets and Its Application to Software Testing

被引:1
作者
Wu, Biao [1 ]
Bao, Xiaoan [2 ]
Zhang, Na [2 ]
Morita, Hiromu [3 ]
Nakata, Mitsuru [4 ]
Ge, Qi-Wei [4 ]
机构
[1] Yamaguchi Univ, Grad Sch E Asian Studies, Yamaguchi 7538514, Japan
[2] Zhejiang Sci Tech Univ, Sch Informat Elect, Hangzhou 310018, Zhejiang, Peoples R China
[3] Nara Inst Sci & Technol, Grad Sch Informat Sci, Nara 6300192, Japan
[4] Yamaguchi Univ, Fac Educ, Yamaguchi 7538513, Japan
关键词
program net; software testing; subnets generation; acyclic program net; self-cleanness;
D O I
10.1587/transfun.E102.A.1303
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Software testing is an important problem to design a large software system and it is difficult to be solved due to its computational complexity. We try to use program nets to approach this problem. As the first step towards solving software testing problem, this paper provides a technique to generate subnets of a program net and applies this technique to software testing. Firstly, definitions and properties of program nets are introduced based on our previous works, and the explanation of software testing problem is given. Secondly, polynomial algorithms are proposed to generate subnets that can cover all the given program net. Finally, a case study is presented to show how to find subnets covering a given program net by using the proposed algorithms, as well as to show the input test data of the program net for software testing.
引用
收藏
页码:1303 / 1311
页数:9
相关论文
共 19 条
  • [1] Abreu B.T., 2005, P 19 BRAZ S SOFTW EN, P247
  • [2] Alzabidi M., 2009, IJCSNS INT J COMPUTE, V9
  • [3] Decomposition-Based Approach for Model-Based Test Generation
    Arcaini, Paolo
    Gargantini, Angelo
    Riccobene, Elvinia
    [J]. IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2019, 45 (05) : 507 - 520
  • [4] Clark N, 2003, 36TH INTERNATIONAL SYMPOSIUM ON MICROARCHITECTURE, PROCEEDINGS, P129
  • [5] Dao V. T., 2016, VNU J SCI COMPUTER S, V32
  • [6] Model-based, Mutation-driven Test-case Generation Via Heuristic-guided Branching Search
    Fellner, Andreas
    Krenn, Willibald
    Schlick, Rupert
    Tarrach, Thorsten
    Weissenbacher, Georg
    [J]. ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, 2019, 18 (01)
  • [7] Performance evaluation of a two-processor scheduling method for acyclic SWITCH-less program nets
    Ge, QW
    Li, C
    Nakata, M
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2005, E88A (06): : 1502 - 1506
  • [8] Ge QW, 1996, IEICE T FUND ELECTR, VE79A, P812
  • [9] EXECUTION TERMINATION AND COMPUTATION DETERMINACY OF DATA-FLOW PROGRAM NETS
    GE, QW
    WATANABE, T
    ONAGA, K
    [J]. JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1991, 328 (01): : 123 - 141
  • [10] Behavioral Fault Localization by Sampling Suspicious Dynamic Control Flow Subgraphs
    Henderson, Tim A. D.
    Podgurski, Andy
    [J]. 2018 IEEE 11TH INTERNATIONAL CONFERENCE ON SOFTWARE TESTING, VERIFICATION AND VALIDATION (ICST), 2018, : 93 - 104