Papers - KATAYAMA Tetsuro
-
A Test-case Generation Method for Concurrent Programs Including Task-types
共著者：T. Katayama, Z. Furukawa, and K. Ushijima
Proc. Joint 1997 Asia-Pacific Softw. Eng. Conf. and Int'l Comp. Sci. Conf. (APSEC'97/ICSC'97), 485-494 1997.12
-
Test-case generation method for concurrent programs including task-types
Katayama T., Furukawa Z., Ushijima K.
Proceedings of the Asia-Pacific Software Engineering Conference and International Computer Science Conference, APSEC and ICSC 485 - 494 1997.12
Language：Japanese Publishing type：Research paper (scientific journal) Publisher：Proceedings of the Asia-Pacific Software Engineering Conference and International Computer Science Conference, APSEC and ICSC
A task-type in concurrent programs is a template of task-instances which are dynamically generated in execution of the programs. The number of the generated task-instances may not be statically determined. Therefore, test-cases generated by our previously proposed method may not be realized in execution of the programs. This paper proposes an enhanced test-case generation method. Concurrent programs are classified into four kinds under two viewpoints: whether the number of task-instances generated from a task-type can be determined statically or dynamically, and whether or not the task-instances communicate with each other. The enhanced method uses a modified Event InterActions Graph(EIAG). The EIAG consists of Event Graphs and Interactions. An Event Graph is an abstract control flow graph of a program unit. The Interactions represent interactions between the units. Because the modified EIAG represents more accurate behavior of a program than the EIAG does, test-cases generated by the enhanced method increase the possibility of realizing themselves. The test-cases in the method increase in number. The method, however, is practical in the sense that the number of task-instances generated from a task-type is restricted.
-
デバイスドライバの仕様記述に適した言語の開発について
共著者：片山徹郎, 最所圭三, 福田晃
情報処理学会コンピュータシステムシンポジウム '97 論文集, 53-58頁 1997.11
-
移動計算機のためのWWW情報発信システムの構築 Reviewed
共著者：田頭茂明, 片山徹郎, 最所圭三, 福田晃
情報処理学会コンピュータシステムシンポジウム '97 論文集, 17-24頁 1997.11
Language：Japanese Publishing type：Research paper (scientific journal)
-
A Method for Structural Testing of Ada Concurrent Programs Using the Event Interactions Graph
共著者：T. Katayama, Z. Furukawa, and K. Ushijima
Proc. 1996 Asia-Pacific Softw. Eng. Conf. (APSEC'96), 355-364 1996.12
-
A method for structural testing of Ada concurrent programs using the Event Interactions Graph Reviewed
Katayama T., Furukawa Z., Ushijima K.
Proceedings - Asia-Pacific Software Engineering Conference, APSEC 355 - 364 1996
Language：English Publishing type：Research paper (scientific journal) Publisher：Proceedings - Asia-Pacific Software Engineering Conference, APSEC
© 1996 IEEE. Software testing generally proceeds as follows: generating test-cases, selecting test-data, executing a test target program, inspecting execution result and evaluating whether testing has already been sufficient or not yet. As for methods for structural testing of programs, the way using a coverage, where the coverage means what extent given testing criteria are satisfied, is noted. At the evaluating step, whether or not we finish the testing is determined in view of the coverage. This paper proposes a method for structural testing of concurrent programs written in Ada programming language, especially, test-case generation and execution of the programs. The Event InterActions Graph (EIAG) is used as a model for concurrent programs. The EIAG consists of Event Graphs and Interactions. An Event Graph is a control flow graph of a program unit in a concurrent program. The Interactions represent interactions between the program units. Program units are such as procedures, functions and task-Types. After generating test-cases on the EIAG, a method for selecting test-data is described and measures to cope with infeasible test-cases with which are generated in this step is clarified. And a forced execution of a test target concurrent program in order to solve the nondeterministic execution is investigated. The nondeterministic execution is characteristic of concurrent programs.
-
Event Interactions Graph for Test-case Generation of Concurrent Programs
共著者：T. Katayama, Z. Furukawa, andK. Ushijima
Proc. 1995 Asia-Pacific Softw. Eng. Conf. (APSEC'95), 29-37 1995.12
-
動的に生成されたプロセス間で通信・同期を行なう並行処理プログラムのテスト法について
共著者：片山徹郎, 古川善吾, 牛島和夫
ソフトウェア・シンポジウム '95 論文集, 172-180頁 1995.6
-
Event interactions graph for test-case generations of concurrent programs Reviewed
Katayama T., Furukawa Z., Ushijima K.
Proceedings - 1995 Asia Pacific Software Engineering Conference, APSEC 1995 29 - 37 1995
Language：English Publishing type：Research paper (scientific journal) Publisher：Proceedings - 1995 Asia Pacific Software Engineering Conference, APSEC 1995
© 1995 IEEE. Test cases play an important role for high-quality software testing. Inadequate test-cases may cause bugs to remain after testing. Overlapped test cases may increase costs. This paper proposes an event interactions graph (EIAG), representing the behavior of concurrent programs and the cooperated paths (copaths) on the EIAG as test cases. The EIAG consists of event graphs and interactions. An event graph is a control flow graph of a program unit in a concurrent program. The interactions are synchronizations, communications and waits between the program units. Copaths can be generated automatically by the algorithms which are presented in this paper. The generated copaths can detect dead (unreachable) statements and can find some communication errors in testing. However, it is necessary to validate the feasibility of the generated copaths.
-
並行処理プログラムにおけるテストケースの定義と生成ツールの試作
共著者：片山徹郎, 菰田敏行, 古川善吾, 牛島和夫
情報処理学会論文誌, 34巻, 11号, 2223-2232頁 1993.11
-
Event-Constraint Model of a Concurrent Program for Test-Case Generation
共著者：T. Katayama, Z. Furukawa, andK. Ushijima
Proc. 1992 Joint Conf. of Softw. Eng. (JCSE'92), 285-292 1992.3