| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| MSS, SS | 2023-01-11 14:20 |
Osaka | (Primary: On-site, Secondary: Online) |
A Systematic Review of Source Code Coverage Metrics: Preliminary Results Masayuki Taniguchi, Shinsuke Matsumoto, Shinji Kusumoto (Osaka Univ.)  MSS2022-58 SS2022-43 |
Software testing plays an essential role in software quality assurance. It helps developers to reveal and remove bugs in... [more] | MSS2022-58 SS2022-43 pp.78-83 |
| SS | 2021-03-03 13:50 |
Online | Online | Analysis of the Impact of Automatically Generated Test Cases on the Results of Automatic Bug Repair Yuga Matsuda, Kyosuke Yamate, Yasutaka Kamei, Naoyasu Ubayashi (Kyushu Univ.) SS2020-32 |
In order to reduce debugging costs in software development, there has been a lot of research on automatic program repair... [more] | SS2020-32 pp.25-30 |
| DC | 2018-02-20 12:05 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | On generating locating arrays using simulated annealing Tatsuya Konishi, Hideharu Kojima, Hiroyuki Nakagawa, Tatsuhiro Tsuchiya (Osaka Univ.) DC2017-82 |
Combinatorial interaction testing is an efficient software testing strategy. In this paper, we focus on locating arrays ... [more] | DC2017-82 pp.31-35 |
| SS, DC | 2017-10-20 09:30 |
Kochi | Kochi City Culture-plaza CUL-PORT | On the generation of constrained locating arrays using an SMT solver Hao Jin (Osaka Univ.), Eun-Hye Choi (AIST), Tatsuhiro Tsuchiya (Osaka Univ.) SS2017-30 DC2017-29 |
Combinatorial interaction testing (CIT) is a well-known testing strategy for software systems. We inves- tigate a new C... [more] |
SS2017-30 DC2017-29 pp.55-60 |
| DC, SS | 2016-10-27 11:00 |
Shiga | Hikone Kinro-Fukushi Kaikan Bldg. | ZDD-based test case generation method for high strength combinatorial interaction testing Teru Ohashi, Tatsuhiro Tsuchiya (Osaka Univ) SS2016-18 DC2016-20 |
Combinatorial interaction testing is a well practiced software testing method. This method requires any $t$-wise para... [more] |
SS2016-18 DC2016-20 pp.1-6 |
| SS | 2016-03-11 10:50 |
Okinawa | A Prioritization of Combinatorial Testing Using Bayesian Inference Shunya Kawabata (Kyoto Inst. Tech.), Eun-Hye Choi (AIST), Osamu Mizuno (Kyoto Inst. Tech.) SS2015-95 |
An ideal testing detects a large number of faults with a small number of test cases. Combinatorial testing, which focus... [more] |
SS2015-95 pp.115-120 |
|
| DC, SS | 2015-10-13 14:30 |
Nara | Todaiji Culture Center (Nara) | Improving the greedy approach to constructing combinatorial test suites Teru Ohashi, Tatsuhiro Tsuchiya (Osaka Univ.) SS2015-37 DC2015-27 |
This paper discusses an optimization of the greedy approach for constructing test suites for combinatorial interaction... [more] |
SS2015-37 DC2015-27 pp.13-15 |
| SIS | 2015-03-05 15:15 |
Tokyo | Meiji Univ. Nakano Campus (Tokyo) | Image Synthesis of Twin Camera Using Self Similarity for Nasal Breath Test Katsuya Kondo, Rieko Doi, Kazuo Ryoke (Tottori Univ) SIS2014-101 |
For examination of velopharyngeal function etc., a nasal breath mirror of stainless plate is often used. The disease can... [more] | SIS2014-101 pp.57-60 |
| ICSS | 2015-03-03 14:50 |
Okinawa | Meio Univiersity | A trial of network security tests over federated testbeds Masatoshi Enomoto, Hiroaki Hazeyama (NAIST), Kazumasa Kobayashi (KUSA), Suguru Yamaguchi (NAIST) ICSS2014-67 |
In network security test environment constructed in wide area, we can test independent of site or scale of test suite or... [more] | ICSS2014-67 pp.25-29 |
| RECONF, CPSY, VLD, IPSJ-SLDM [detail] | 2015-01-29 18:00 |
Kanagawa | Hiyoshi Campus, Keio University | CF3: Test suite for arithmetic optimization of C compilers Yusuke Hibino, Nagisa Ishiura (KGU) VLD2014-130 CPSY2014-139 RECONF2014-63 |
This article presents a compiler test suite "CF3," which targets arithmetic optimization, especially constant folding, o... [more] | VLD2014-130 CPSY2014-139 RECONF2014-63 pp.117-122 |
| SS, MSS | 2014-01-31 10:45 |
Aichi | Improving a Test Case Generation Method for Faulty Interaction Location Takahiro Nagamoto, Hideharu Kojima, Tatsuhiro Tsuchiya (Osaka Univ) MSS2013-64 SS2013-61 |
This paper discusses the location of interaction faults in software interaction testing．In our previous study we propos... [more] |
MSS2013-64 SS2013-61 pp.77-81 |
|
| IT | 2013-05-24 14:45 |
Fukui | Hotel Matuya Sensen at Awara-onsen, Fukui Pref. | String complexity based on reduplicative parsing and its application to randomness testing Shigeru Maya, Hirosuke Yamamoto (Univ. of Tokyo) IT2013-8 |
A randomness test based on LZ-compelxity was included in the NIST statistical test suite. However, it was removed becaus... [more] | IT2013-8 pp.35-40 |
| DC, CPSY | 2013-04-26 15:50 |
Tokyo | Aumenting a Test Suite for Parameter Value Weighting Satoshi Fujimoto, Hideharu Kojima, Tatsuhiro Tsuchiya (Osaka Univ.) CPSY2013-6 DC2013-6 |
In this paper, we propose a weighting method for pair-wise testing. Pair-wise testing is a software testing strategy t... [more] |
CPSY2013-6 DC2013-6 pp.31-36 |
|
| SS | 2013-01-10 16:00 |
Okinawa | On the Probability of Interaction Fault Detection Using Random Testing in the Presence of Constraints on Parameter Values Daiki Shigeoka, Hideharu Kojima, Tatsuhiro Tsuchiya (Osaka Univ.) |
This paper discusses random testing, which is a simple approach to test case generation for software testing. A notable ... [more] | SS2012-51 pp.31-35 |
|
| NLP | 2012-11-19 14:20 |
Miyagi | Ishinomaki Senshu University | Study on Testing for Randomness of Pseudo-Random Number Sequence with NIST SP800-22 rev.1a Hitoaki Yoshida, Takeshi Murakami (Iwate Univ.), Satoshi Kawamura (Ishinomaki Senshu Univ.) NLP2012-78 |
NIST Special Publication 800-22, Statistical Test Suite for Random and Pseudo-random Number Generators for Cryptographic... [more] | NLP2012-78 pp.13-18 |
| RECONF, VLD, CPSY, IPSJ-SLDM [detail] | 2011-01-17 15:05 |
Kanagawa | Keio Univ (Hiyoshi Campus) | Acceleration of Regression Test of Compilers by Program Merging Kazushi Morimoto, Nagisa Ishiura (Kwansei Gakuin Univ.), Yuki Uchiyama (K-OPT), Nobuyuki Hikichi (SRA, Inc) VLD2010-94 CPSY2010-49 RECONF2010-63 |
This article presents a method of accelerating regression test of compilers by merging programs in test suites. Testing ... [more] | VLD2010-94 CPSY2010-49 RECONF2010-63 pp.63-67 |
| MSS | 2010-08-02 14:25 |
Ishikawa | Generating test cases for implementing concurrent systems based on the OTS/CafeOBJ method Takahiro Seino (AIST), Masaki Nakamura (Kanazawa Univ.) CST2010-33 |
In software developments with formal methods, there exists an unavoidable gap between a system description in formal spe... [more] | CST2010-33 pp.7-12 |
|
| MI | 2010-01-28 17:40 |
Okinawa | Naha-Bunka-Tenbusu | Endoscopic image matching for reconstructing 3-D structure of intestine Katsuhiro Hirai, Yasushi Kanazawa (Toyohashi Univ. of Tech.), Ryusuke Sagawa, Yasushi Yagi (Osaka Univ.) MI2009-117 |
We present an image matching method between endoscopic images for reconstructing 3-D shape of an intestine. In this cas... [more] | MI2009-117 pp.223-228 |
| ISEC | 2008-05-16 10:45 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | A New Randomness Test Based on All the Autocorrelation Values Kenji Hamano, Hirosuke Yamamoto (Tokyo Univ.) ISEC2008-4 |
Discrete Fourier transform test (dft test) included in the NIST randomness test suite, and autocorrelation test included... [more] | ISEC2008-4 pp.23-30 |
| DE, DC | 2007-10-16 11:00 |
Tokyo | Kikai-Shinko-Kaikan Bldg | Designing Pairwise Testsets that Optimize Executing Cost Shin Kimoto, Tatsuhiro Tsuchiya, Tohru Kikuno (Osaka Univ.) DE2007-123 DC2007-20 |
Pairwise testing is a software testing strategy that aims to reduce the cost of testing. This strategy requires that a... [more] |
DE2007-123 DC2007-20 pp.47-50 |
[Return to Top Page]