| Item type |
Symposium(1) |
| 公開日 |
2018-03-02 |
| タイトル |
|
|
タイトル |
Towards Test Case Generation for Context-Oriented Software via Colored Petri-Nets |
| タイトル |
|
|
言語 |
en |
|
タイトル |
Towards Test Case Generation for Context-Oriented Software via Colored Petri-Nets |
| 言語 |
|
|
言語 |
eng |
| キーワード |
|
|
主題Scheme |
Other |
|
主題 |
Context-Oriented Programming, Petri-Nets, Colored Petri-Nets, Software Testing |
| 資源タイプ |
|
|
資源タイプ識別子 |
http://purl.org/coar/resource_type/c_5794 |
|
資源タイプ |
conference paper |
| 著者所属 |
|
|
|
Tokai University |
| 著者所属 |
|
|
|
Tokai University |
| 著者所属(英) |
|
|
|
en |
|
|
Tokai University |
| 著者所属(英) |
|
|
|
en |
|
|
Tokai University |
| 著者名 |
Shusuke, Ebihara
Harumi, Watanabe
|
| 著者名(英) |
Shusuke, Ebihara
Harumi, Watanabe
|
| 論文抄録 |
|
|
内容記述タイプ |
Other |
|
内容記述 |
In this presentation, we discuss how to generate test cases from Context-Oriented Software (COS) that is an abstraction of Context-Oriented Programming (COP) . The feature of COP is to change behavior at runtime by (de-) activating layers. Thus, in COP, the layer activation or deactivation makes a change the whole software. The feature causes to conflict and deadlock problems. To solve these problems, several kinds of literature proposed simulation methods on Petri-Nets, because those problems are similar to concurrent software problems. In previous our work, we introduced a simulation method on Colored-Petri Nets (CPN) . CPN aims to detect deadlock or conflict problems for concurrent software and is one of graphical based formal language extended Petri- nets. In CPN, the colored token creation and deletion can express dynamic property, such as creation/deletion of objects/tasks. For checking such dynamic properties, one of the most difficult problems is the state explosion problem. In CPN, the colored tokens contribute to solving this problem, because the color can make a group for reducing state spaces. Thus, CPN is suitable for checking the runtime property of software. Accordingly, we have applied CPN to simulate COP. In industry area, testability is one of the most significant problems. However, in related works, test case generation methods for COP or COS have not proposed. In this presentation, we discuss a test case generation method for COS based on CPN. In this method, we analyze a state space graph that is a simulation result of CPN. We can obtain test cases from tracing the state space graph. |
| 論文抄録(英) |
|
|
内容記述タイプ |
Other |
|
内容記述 |
In this presentation, we discuss how to generate test cases from Context-Oriented Software (COS) that is an abstraction of Context-Oriented Programming (COP) . The feature of COP is to change behavior at runtime by (de-) activating layers. Thus, in COP, the layer activation or deactivation makes a change the whole software. The feature causes to conflict and deadlock problems. To solve these problems, several kinds of literature proposed simulation methods on Petri-Nets, because those problems are similar to concurrent software problems. In previous our work, we introduced a simulation method on Colored-Petri Nets (CPN) . CPN aims to detect deadlock or conflict problems for concurrent software and is one of graphical based formal language extended Petri- nets. In CPN, the colored token creation and deletion can express dynamic property, such as creation/deletion of objects/tasks. For checking such dynamic properties, one of the most difficult problems is the state explosion problem. In CPN, the colored tokens contribute to solving this problem, because the color can make a group for reducing state spaces. Thus, CPN is suitable for checking the runtime property of software. Accordingly, we have applied CPN to simulate COP. In industry area, testability is one of the most significant problems. However, in related works, test case generation methods for COP or COS have not proposed. In this presentation, we discuss a test case generation method for COS based on CPN. In this method, we analyze a state space graph that is a simulation result of CPN. We can obtain test cases from tracing the state space graph. |
| 書誌情報 |
組込みシステムワークショップ2017論文集
巻 2017,
p. 25-25,
発行日 2018-03-02
|
| 出版者 |
|
|
言語 |
ja |
|
出版者 |
情報処理学会 |
IPSJ-ESW2017009.pdf (62.1 kB)
