This slide is for the keynote speech in JaSST Hokkaido 2020. It analysis problems of Softhouses, Japanese software companies, and proposes how to transform softhouses to good companies.
This slide is for the keynote speech in JaSST Hokkaido 2020. It analysis problems of Softhouses, Japanese software companies, and proposes how to transform softhouses to good companies.
On 16 November 2011, Japan Embedded Systems Technology Association (JASA) announced that Platform Research Group of Engineering division has started work on the specification of OpenEL (Embedded Libraries) for Robot.
OpenEL for Robot is an open platform to standardize the specifications of the software implementation of robotics and control systems.
This is the Japanese version of the presentation materials that were presented at Embedded Technology 2011 in Japan. The English version is under construction.
2013年7月16日にシンガポールで開催された第一回アジア組み合わせテストワークショップ(1st Asian Workshop on Combinatorial Testing for Complex Computer Systems)で発表した"Combinatorial Testing in Japan"のスライドを日本語にしました(だいぶ遅くなりましたが)。
英語版はこちら
https://www.slideshare.net/Bugler/combinatorial-testing-injapan20130616
Introduction to the 10th IEEE International Conference on Software Testing, Verification and Validation (ICST 2017) held on 13-17 March, 2017 in Tokyo, Japan.
Conceptual support for test case design (COMPSAC 87)Keizo Tatsumi
My presentation slides for COMPSAC '87. One of the earliest presentation about Combinatorial Testing.
K.Tatsumi, S.Watanabe, Y.Takeuchi, and H.Shimokawa, "Conceptual support for test case design," Proc. 11th Intl. Computer Software & Applications Conf.(COMPSAC), Oct. 1987
I put together historical topics regarding combinatorial testing on this timeline.
In the 1930s, Ronald Fisher developed the Design of Experiments.
Rao introduced orthogonal arrays in the 1940s
From the 1950s, Genichi Taguchi developed a methodology for applying statistics to improve quality in manufacturing and established the Quality Engineering.
Afterwards, his methodology got a great reputation and was named "Taguchi method" in the United States.
I think this reputation in the US was transmitted to Japan, Taguchi method drew attention in Japan in the early 1980s.
Shortly after, software QA engineers at Fujitsu started to apply the Design of Experiments to software testing in 1983, and they published papers in 1984 and 1987.
In the late 1980s, a few case studies were reported from NEC and IBM Japan, howe
In 1989, Fujitsu introduced this technique to AT&T.
After that, OATS, CATS and AETG were developed by AT&T group companies.
From the mid 1990s, combinatorial testing began to spread in the US.
In 1995, Dr. Phadke's paper was translated into Japanese and printed in the journal of Quality engineering.
Also, some case studies were reported in the community of quality engineering in the late 1990s.
However, combinatorial testing got much attention again after HAYST method was announced by Fuji Xerox in 2004.
Currently, many Japanese testers consider that Combinatorial Testing is one of the must-have techniques.
For Japan, we can say combinatorial testing is a re import technique.
14. (C) K. Tatsumi, 201014
サイクロマチック複雑度
プログラムの制御フローをグラフ化し、以下の式で求
められる数で複雑度を表現
サイクロマチック数 = 辺の数 - 頂点の数 + 2
1関数内のサイクロマチック数
10以内が望ましい
20以上は避けるべき
パステストで実施すべき
テストケース数の上限も表す
パス1 : a → b → e → f
パス2 : a → b → e → a → b → e → f
パス3 : a → b → e → b → e → f
パス4 : a → c → f
パス5 : a → d → c → f
a
b c d
e
f
入口
出口
サイクロマチック数=9-6+2=5
[出典] T. J. McCabe, "A Complexity Measure," IEEE Transactions on Software Engineering,1976
15. (C) K. Tatsumi, 201015
ソフトウェアサイエンス
ソフトウェアサイエンス理論
プログラミング作業とは、いくつかのプログラムトークン(演算子やオペ
ランド)を選択したり組み合わせること
複雑性や生産性は、これらの基本要素の出現回数の関数で表せる
基本測定量
n1 = プログラム中の演算子の種類数 (算術演算子、比較演算子、関数名 など)
n2 = プログラム中のオペランドの種類数 (変数、定数、ラベル など)
N1 = 演算子の出現数
N2 = オペランドの出現数
評価尺度の導出
プログラムの大きさ(ビット数) V = (N1 + N2) log2(n1 + n2)
プログラムの水準(推定値) L = 2n2 / n1N2
プログラミングの困難さ(推定値) D = 1 / L = n1N2 / 2n2
プログラミング労力(推定値) E = V / L = n1N2 (N1 + N2) log2(n1 + n2) / 2n2
など
[出典] 山田,高橋, ソフトウェアマネジメントモデル入門, 共立出版,1993