IEICE TRANSACTIONS on Fundamentals
Subnets Generation of Program Nets and Its Application to Software Testing
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E102-A No.9 pp.1303-1311
- Publication Date
- 2019/09/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E102.A.1303
- Type of Manuscript
- PAPER
- Category
- Mathematical Systems Science
Authors
Biao WU
Yamaguchi University
Xiaoan BAO
Zhejiang Sci-Tech University
Na ZHANG
Zhejiang Sci-Tech University
Hiromu MORITA
Nara Institute of Science and Technology
Mitsuru NAKATA
Yamaguchi University
Qi-Wei GE
Yamaguchi University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Biao WU, Xiaoan BAO, Na ZHANG, Hiromu MORITA, Mitsuru NAKATA, Qi-Wei GE, "Subnets Generation of Program Nets and Its Application to Software Testing" in IEICE TRANSACTIONS on Fundamentals,
vol. E102-A, no. 9, pp. 1303-1311, September 2019, doi: 10.1587/transfun.E102.A.1303.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E102.A.1303/_p
Copy
@ARTICLE{e102-a_9_1303,
author={Biao WU, Xiaoan BAO, Na ZHANG, Hiromu MORITA, Mitsuru NAKATA, Qi-Wei GE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Subnets Generation of Program Nets and Its Application to Software Testing},
year={2019},
volume={E102-A},
number={9},
pages={1303-1311},
abstract={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.},
keywords={},
doi={10.1587/transfun.E102.A.1303},
ISSN={1745-1337},
month={September},}
Copy
TY - JOUR
TI - Subnets Generation of Program Nets and Its Application to Software Testing
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1303
EP - 1311
AU - Biao WU
AU - Xiaoan BAO
AU - Na ZHANG
AU - Hiromu MORITA
AU - Mitsuru NAKATA
AU - Qi-Wei GE
PY - 2019
DO - 10.1587/transfun.E102.A.1303
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E102-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2019
AB - 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.
ER -
English
