• 検索結果がありません。

ソフトウェア開発プロセスの複雑さに着目したプロダクト品質の予測モデルの構築

N/A
N/A
Protected

Academic year: 2021

シェア "ソフトウェア開発プロセスの複雑さに着目したプロダクト品質の予測モデルの構築"

Copied!
8
0
0

読み込み中.... (全文を見る)

全文

(1)ソフトウェアエンジニアリングシンポジウム 2011 product qualities of other projects are predicted by the PCPQ model. As a result, a gap between the predicted product quality using the PCPQ model and real product quality is small. Moreover, we discuss relationships between characteristics of fragment process and faults after release.. ࢯࣇࢺ࢙࢘࢔㛤Ⓨࣉࣟࢭࢫࡢ」㞧ࡉ࡟╔┠ࡋ ࡓࣉࣟࢲࢡࢺရ㉁ࡢண ࣔࢹࣝࡢᵓ⠏. 1. ࡣࡌࡵ࡟ ࢯࣇࢺ࢙࢘࢔㛤Ⓨࣉࣟࢪ࢙ࢡࢺ࡟࠾࠸࡚㸪᝿ᐃࡋ࡚࠸ࡓ㛤Ⓨィ⏬࡜ᐇ㝿ࡢ㛤Ⓨᐇ⦼ ࡟ࡣ኱ࡁ࡞㝸ࡓࡾࡀ࠶ࡿ[1]㸬౛࠼ࡤ㸪㢳ᐈࡢᛴ࡞せᮃ࡟ࡼࡾィ⏬࡟࡞࠸సᴗࡢ㏣ຍࡸ㸪 ࢖ࣥࢡ࣓ࣜࣥࢱࣝ㛤Ⓨࣉࣟࢭࢫ࡛ィ⏬ࡉࢀࡓࢧࣈࢩࢫࢸ࣒ࡢᶵ⬟ࡀ඲ࡃ␗࡞ࡿᶵ⬟࡬ ࡜ኚ᭦ࡉࢀࡓ➼ࡀᣲࡆࡽࢀࡿ㸬㛤Ⓨィ⏬࡟᪂ࡓ࡞సᴗࡀ㏣ຍࡉࢀࡿ஦ࡣ㛤Ⓨ⌧ሙ࡛ࡣ ၥ㢟どࡉࢀ࡚࠸ࡿ㸬ᛴ࡞㏣ຍసᴗࡀⓎ⏕ࡍࡿࡇ࡜࡛సᴗ㐍⾜ࡀ෇⁥࡟㐍ࡲ࡞ࡃ࡞ࡾ㸪 ⤖ᯝ࡜ࡋ࡚ࣉࣟࢲࢡࢺࡢရ㉁పୗࡀண ࡉࢀࡿ㸬ࡋ࠿ࡋ㸪㏣ຍసᴗࢆ⾜ࢃ࡞ࡅࢀࡤ㢳 ᐈ࡟࡜ࡗ࡚᭷┈࡞ࢩࢫࢸ࣒࡟࡞ࡽ࡞࠸㸬㏣ຍసᴗࡸィ⏬ኚ᭦ࢆᑡ࡞ࡃࡍࡿࡓࡵ㸪せ௳ ᐃ⩏ࢆࡼࡾ☜ᐇ࡟ࡍࡿ◊✲ࡶ⾜ࢃࢀ࡚࠸ࡿࡀ[2][3]㸪㢳ᐈࡢ‶㊊ᗘࢆྥୖࡉࡏࡿࡓࡵ࡟ 㛤Ⓨ⌧ሙ࡛ࡣ⣽࠿࡞ィ⏬ኚ᭦ࡸ㏣ຍసᴗࡣ㢖⦾࡟Ⓨ⏕ࡍࡿ㸬㏣ຍసᴗࡸィ⏬ኚ᭦ࡣ㑊 ࡅࡽࢀ࡞࠸஦㇟࡜ࡋ࡚ࡶ㸪↓⠇᧯࡟ኚ᭦ࡍࡿࡢ࡛ࡣ࡞ࡃ㸪᭱⤊ࣉࣟࢲࢡࢺ࡟୚࠼ࡿᙳ 㡪ࢆ⪃៖ࡍࡿᚲせࡀ࠶ࡿ㸬ࡋ࠿ࡋ㸪㏣ຍసᴗ➼࡟ࡼࡾኚ᭦ࡉࢀࡓ㛤Ⓨࣉࣟࢭࢫࡀࣉࣟ ࢲࢡࢺရ㉁࡬୚࠼ࡿᙳ㡪ࡀ᫂☜࡟ࡣ࡞ࡗ࡚࠸࡞࠸㸬ࡑࡇ࡛㸪ᮏ◊✲࡛ࡣࣉࣟࢭࢫ࡜ࣉ ࣟࢲࢡࢺရ㉁ࡢ㛵ಀࢆ♧ࡍ PCPQ ࣔࢹࣝᵓ⠏᪉ἲࢆᥦ᱌ࡍࡿ㸬PCPQ ࣔࢹࣝࡣࣉࣟࢭ ࢫࡢ」㞧ࡉࡢほⅬ࠿ࡽ᭱⤊ⓗ࡞ࣉࣟࢲࢡࢺရ㉁ࢆண ࡍࡿ㸬PCPQ ࣔࢹࣝࡢᵓ⠏ࡣࣉ ࣟࢪ࢙ࢡࢺࡢ㛤Ⓨࣉࣟࢭࢫࡢ」㞧ࡉࢆ♧ࡋࡓ Process Complexity ್㸦௨ୗ PC ್㸧࡜᭱ ⤊ⓗ࡞ࣉࣟࢲࢡࢺࡢရ㉁࡛࠶ࡿ㞀ᐖẚ㔜ࡢ್ࢆ฼⏝ࡍࡿ㸬ࡇࢀࢆྠ୍⤌⧊ࡢ」ᩘࣉࣟ ࢪ࢙ࢡࢺ࡟࡚ィ ࡋ㸪ྛࣉࣟࢪ࢙ࢡࢺࡢ᭱⤊ⓗ࡞ PC ್࡜㞀ᐖẚ㔜ࡢ್࡟࡚ࣔࢹࣝࢆ ᵓ⠏ࡍࡿ㸬ᵓ⠏ࡉࢀࡓࣔࢹࣝࢆ౑ࡗ࡚㸪ྠ୍⤌⧊ෆࡢ௚ࡢࣉࣟࢪ࢙ࢡࢺࡢ PC ್࠿ࡽ ᭱⤊ࣉࣟࢲࢡࢺࡢရ㉁ࢆண ࡍࡿࡇ࡜ࡀ࡛ࡁࡿ㸬PC ್ࡢィ ᪉ἲ࡜ࡋ࡚㸪ᐇ㊶ⓗ࡞ࣉ ࣟࢪ࢙ࢡࢺ୍࡛⯡ⓗ࡟฼⏝ࡉࢀ࡚࠸ࡿᕤ⛬⟶⌮⾲ࢆ⏝࠸ࡿ[4]㸬ᕤ⛬⟶⌮⾲࠿ࡽࣉࣟࢪ ࢙ࢡࢺᙜึ࡟ィ⏬ࡉࢀࡓࣉࣟࢭࢫ㸦௨ୗ࣮࣋ࢫࣉࣟࢭࢫ㸧࡜ணᮇࡏࡎ㏣ຍࡉࢀࡓࣉࣟ ࢭࢫ㸦௨ୗࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫ㸧ࢆᢳฟࡍࡿ㸬PC ್ࡢࣃ࣓࣮ࣛࢱࡣᢳฟࡉࢀࡓࣉࣟ ࢭࢫࡢྠ᫬ᐇ⾜ࣉࣟࢭࢫᩘ㸪㛤Ⓨࢢ࣮ࣝࣉᩘཬࡧࣉࣟࢭࢫࡢᐇ⾜ᮇ㛫ࡢ್࡛࠶ࡿ㸬ࣉ ࣟࢪ࢙ࢡࢺࡢ㐍ᤖ࡟క࠸ኚ໬ࡍࡿᕤ⛬⟶⌮⾲ࡢᵓᡂ⟶⌮ࡼࡾ PC ್ࡢኚ໬ࢆࣜ࢔ࣝࢱ ࢖࣒࡛ィ ࡛ࡁࡿ㸬ࡲࡓ㞀ᐖẚ㔜ࡢ್ࡣ⤌⧊ࡈ࡜࡟సᡂࡉࢀࡓ㞀ᐖ⟶⌮⾲࠿ࡽồࡵࡿ㸬 ࣮ࣜࣜࢫᚋ࡟Ⓨ⏕ࡋࡓ㞀ᐖࡢ㔜せᗘࣛࣥࢡ㸦౛࠼ࡤࢩࢫࢸ࣒ࢲ࢘ࣥ➼ࡣ᭱㔜せࣞ࣋ࣝ. ᑿⰼᑗ㍤†  ⰼᕝ඾Ꮚ†† 㣤⏣ඖ†  ࢯࣇࢺ࢙࢘࢔㛤Ⓨࣉࣟࢪ࢙ࢡࢺ࡛ࡣ᝿ᐃࡋ࡚࠸ࡓ㛤Ⓨィ⏬࡜ࣉࣟࢪ࢙ࢡࢺ⤊஢ ᚋࡢ㛤Ⓨᐇ⦼࡟ࡣ኱ࡁ࡞㝸ࡓࡾࡀ࠶ࡿ㸬౛࠼ࡤ㸪㢳ᐈࡢせᮃ࡛ᶵ⬟せ௳ࡀኚ᭦ࡉ ࢀ㸪ࡑࢀ࡟క࠸ኚ᭦సᴗࣉࣟࢭࢫࡀィ⏬࡟㏣ຍࡉࢀࡿ➼࡛࠶ࡿ㸬ணᮇࡏࡎ㏣ຍࡉ ࢀࡓࣉࣟࢭࢫ㸦ࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫ㸧ࡣ㛤Ⓨࣉࣟࢭࢫ඲యࢆ」㞧໬ࡍࡿ㸬」㞧 ࡟࡞ࡗࡓࣉࣟࢭࢫࡣࣉࣟࢲࢡࢺရ㉁࡟ᙳ㡪ࡍࡿ࡜ண᝿ࡉࢀࡿࡀ㸪ᚑ᮶ࡢ◊✲࡛ࡣ ࣉࣟࢭࢫ࡜ࣉࣟࢲࢡࢺࡢ㛵ಀࡀ᫂☜࡟♧ࡉࢀ࡚࠸࡞࠸㸬ࡑࡇ࡛㸪ᮏ✏࡛ࡣࣉࣟࢭ ࢫࡢ」㞧ࡉ࡟╔┠ࡋࡓ PCPQ (Process Complexity - Product Quality)ࣔࢹࣝࢆᥦ᱌ࡍ ࡿ㸬PCPQ ࣔࢹࣝࡣࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࡢ㏣ຍ࡟ࡼࡗ࡚」㞧໬ࡋࡓࣉࣟࢭࢫ࠿ ࡽ࣮ࣜࣜࢫᚋࡢࣉࣟࢲࢡࢺရ㉁ࢆண ࡍࡿࣔࢹ࡛ࣝ࠶ࡿ㸬⏘ᴗ⏺࡟࠾ࡅࡿ㸴ࡘࡢ ࣉࣟࢪ࢙ࢡࢺࢆ⏝࠸࡚ PCPQ ࣔࢹࣝࢆᵓ⠏ࡋࡓ㸬ᵓ⠏ࡋࡓࣔࢹࣝࢆ⏝࠸࡚㸪௚ࣉ ࣟࢪ࢙ࢡࢺࡢ࣮ࣜࣜࢫᚋࡢࣉࣟࢲࢡࢺရ㉁ࢆண ࡋࡓ⤖ᯝ㸪ᐇ ್࡟㏆࠸ရ㉁ࢆ ண ࡛ࡁࡓ㸬ࡲࡓ㸪᫬⣔ิኚ໬ࡍࡿࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࡢ≉ᚩ࡟╔┠ࡍࡿࡇ࡜ ࡛㸪࣮ࣜࣜࢫᚋࡢ㞀ᐖࡢ✀㢮ࢆ≉ᐃࡍࡿࡇ࡜ࡢྍ⬟ᛶ࡟ࡘ࠸࡚ࡶ᳨ウࡋࡓ㸬. A process complexity based product quality model for software development MASAKI OBANA† NORIKO HANAKAWA††  HAJIMU IIDA†  In software development projects, large gaps between planned development processes and actual development exist. For example, processes of the requirement repeat the definitions by sudden demands of customers in a design process. We call the added process a fragment process. A development process becomes complicated by addition of such fragment processes, and product quality decreases. Therefore, we propose a PCPQ (Process Complexity - Product Quality) model with process complexity. A PCPQ model consists of two elements; process complexity, and product quality. Process complexity is measured by fragment processes. Product quality means a final specific gravity of post-release faults. Because a PCPQ model is constructed at each organization, post-release product quality can be predicted using the PCPQ model in the same organization. We constructed a PCPQ model using six industrial projects. After that,. †. ዉⰋඛ➃⛉Ꮫᢏ⾡኱Ꮫ㝔኱Ꮫ  Nara Institute of Science and Technology.  㜰༡኱Ꮫ  Hannan University . ††. 1. © 2011 Information Processing Society of Japan.

(2) ソフトウェアエンジニアリングシンポジウム 2011 ➼㸧࡜ࡑࡢ㞀ᐖ௳ᩘ࠿ࡽ㞀ᐖẚ㔜ࢆồࡵࡿ㸬ᕤ⛬⟶⌮⾲ࡸ㞀ᐖ⟶⌮⾲ࡣ⤌⧊ẖ࡟グ㏙ ᪉ἲࡸ⟶⌮㡯┠ࡢ⢏ᗘࡀ␗࡞ࡿ㸬ࡋ࠿ࡋ㸪PCPQ ࣔࢹࣝࡣ⤌⧊ẖ࡟సᡂࡍࡿࡓࡵ㸪⟶ ⌮㡯┠ࡢ⢏ᗘࡀ␗࡞ࡗࡓ࡜ࡋ࡚ࡶᵓ⠏࡛ࡁࡿỗ⏝ⓗ࡞ࣔࢹ࡛ࣝ࠶ࡿ㸬PCPQ ࣔࢹࣝࢆ ⏝࠸࡚ࣉࣟࢪ࢙ࢡࢺᐇ⾜୰ࡢ PC ್࠿ࡽ᭱⤊ࣉࣟࢲࢡࢺࡢရ㉁ࢆண ࡍࡿ஦ࡀ࡛ࡁࡿ㸬 ࡋࡓࡀࡗ࡚㸪㢳ᐈࡢせ௳ኚ᭦➼ࡢィ⏬እࡢసᴗᐇ⾜ࡀ᭱⤊ࣉࣟࢲࢡࢺရ㉁࡟୚࠼ࡿᙳ 㡪ࢆ᪩ᮇ࡟ุ᩿ࡋ㸪ィ⏬ࡢ෌タィࡢ᪉㔪ࢆỴᐃࡍࡿࡇ࡜࡟฼⏝࡛ࡁࡿࣔࢹ࡛ࣝ࠶ࡿ㸬  㸰❶࡛ࡣࣉࣟࢭࢫ࣓ࢺࣜࢡࢫ࡜ࣉࣟࢪ࢙ࢡࢺࣜࢫࢡ⟶⌮ࡢ㛵㐃◊✲ࢆ♧ࡋ㸪㸱❶࡛ ࡣࣉࣟࢭࢫࡢ」㞧ࡉࡢィ ᡭἲ࡜ PCPQ ࣔࢹࣝࢆᥦ᱌ࡍࡿ㸬㸲❶࡛ࡣ㸴ࡘࡢᐇࣉࣟࢪ ࢙ࢡࢺ࡬ࡢ㐺⏝஦౛ࢆ♧ࡋ㸪㸳❶ࡢࣉࣟࢭࢫࡢ」㞧ࡉ࡜㞀ᐖⓎ⏕࡟ࡘ࠸࡚⪃ᐹࡋ㸪㸴 ❶࡛ࡲ࡜ࡵ࡜௒ᚋࡢㄢ㢟ࢆ㏙࡭ࡿ㸬. ᱌ࡍࡿ PCPQ ࣔࢹࣝࡣࣉࣟࢭࢫ࡜ࣉࣟࢲࢡࢺရ㉁ࡢ㛵ಀࡲ࡛ゝཬࡍࡿⅬࡀ␗࡞ࡿ㸬  ࣉࣟࢭࢫ࡜ࣉࣟࢲࢡࢺရ㉁ࡢ㛵ಀ࡟ゝཬࡋࡓ◊✲ࡣ㸪㟷ᮌࡽࡀ࢔ࢪࣕ࢖ࣝ㛤Ⓨࡢᐇ ドࢹ࣮ࢱ࡟࡚ࣉࣟࢭࢫ࡜ࣉࣟࢲࢡࢺࡢ㛵ಀࢆᑟ࠸ࡓ[12]㸬ࣞࣅ࣮ࣗᅇᩘࡸࢸࢫࢺࢣ࣮ ࢫᅇᩘ➼ࡢࣉࣟࢭࢫ࣓ࢺࣜࢡࢫ್࡜ࢩࢫࢸ࣒ࢸࢫࢺᕤ⛬ࡢࣇ࢛࣮ࣝࢺᩘࡢ㛵ಀࢆ㔜ᅇ ᖐᘧ࡟࡚ồࡵࡓ㸬ᮏ◊✲ࡣࣉࣟࢭࢫ࡜ࣉࣟࢲࢡࢺࡢ㛵ಀࢆ᫂☜࡟ࡍࡿ࡜࠸࠺◊✲┠ⓗ ࡣྠࡌ࡛࠶ࡿࡀ㸪ᡃࠎࡣࣉࣟࢭࢫࡢ」㞧ࡉࢆ⏝࠸ࡿࡢ࡟ᑐࡋ㸪ࣉࣟࢭࢫ࣓ࢺࣜࢡࢫࢆ ィ⏬ࣇ࢙࣮ࢬ. ศᯒ. ศᯒࣇ࢙࣮ࢬ. ศᯒ. タィ. ᐇ⿦. タィ. ᐇ⿦. ࣮࣋ࢫࣉࣟࢭࢫ. ࢸࢫࢺ. ࢸࢫࢺ. ࣇࣛࢢ࣓ࣥࢺ ࣇࣛࢢ࣓ࣥࢺ ࣉࣟࢭࢫ ࣉࣟࢭࢫ ୍ 㒊 ࡢ ᶵ ⬟ ࢆ ࣉ ࣟ ࢺ ࢱ ࢖ ࣉ ୍㒊ࡢᶵ⬟ࢆḟᅇࣂ࣮ࢪࣙࣥ ࡛ࡢ㛤Ⓨ࡜ࡍࡿ 㛤Ⓨࡍࡿ.. 2. 㛵㐃◊✲  ࢯࣇࢺ࢙࢘࢔㛤Ⓨࣉࣟࢭࢫࢆ࣓ࢺࣜࢡࢫ࡛ィ ࡍࡿ◊✲ࡣከࡃᐇ᪋ࡉࢀ࡚࠸ࡿ㸬 CMM ࡣࣁࣥࣇ࣮ࣜࡀ♧ࡍࣉࣟࢭࢫᡂ⇍ᗘࣔࢹ࡛ࣝ࠶ࡾ㸪⤌⧊࡟࠾ࡅࡿࣉࣟࢭࢫࡢᡂ ⇍࡟㛵ࡍࡿ㸳ࣞ࣋ࣝࢆᥦ᱌ࡋ࡚࠸ࡿ[5]㸬ࣞ࣋ࣝࢆỴᐃࡍࡿ㝿࡟ᵝࠎ࡞࣓ࢺࣜࢡࢫ㸦⥲ ྜヨ㦂Ḟ㝗⋡㸪ヨ㦂ᐦᗘ㸪ࣞࣅ࣮ࣗᐦᗘ➼㸧್ࡀ཰㞟ࡉࢀࡿ㸬ࡲࡓ㸪ᆏᮏࡽࡣ௻ᴗෆ ࡛࢛࣮࢘ࢱࣇ࢛࣮ࣝ㛤Ⓨࡢࣉࣟࢭࢫᨵၿࢆ⤌⧊ⓗ࡟ᐇ᪋ࡋࡓ㸬ࣞࣅ࣮ࣗᐇ᪋ᅇᩘࡸᣦ ᦬஦㡯ᩘࢆィ ࡍࡿ࣓ࢺࣜࢡࢫ࡜ࡋ࡚㸪ࣉࣟࢭࢫᨵၿᗘྜ࠸ࢆィ ࡋࡓ[6]㸬 ࡲࡓ㸪ࣉࣟࢭࢫࣔࢹࣜࣥࢢ࡟ࡘ࠸࡚ࡢ◊✲ࡶከࡃᥦ᱌ࡉࢀ࡚࠸ࡿ㸬Cugola ࡽࡣᐜ᫆ ࡟ࢱࢫࢡࢆ㏣ຍࡍࡿࡇ࡜ࡀ࡛ࡁࡿࣉࣟࢭࢫࣔࢹࣝゝㄒࢆᥦ᱌ࡋ࡚࠸ࡿ[7]㸬Fuggetta ࡽ ࡣࢯࣇࢺ࢙࢘࢔㛤Ⓨ⎔ቃ࡟࠾ࡅࡿၥ㢟Ⅼࡸᵝࠎ࡞㛤Ⓨࣉࣟࢭࢫ࡟࠾ࡅࡿၥ㢟ࢆゎỴࡍ ࡿࡓࡵࡢࢶ࣮ࣝࢆᥦ᱌ࡋ࡚࠸ࡿ[8]㸬ࡉࡽ࡟㸪Garcia ࡽࡣࣉࣟࢭࢫࣔࢹࣝࡢಖᏲᛶࡸኚ ᭦ᐜ᫆ᛶ࡞࡝ࢆ㸪GQM ࣮࣋ࢫࡢ࣓ࢺࣜࢡࢫ࡛ホ౯ࡋ࡚࠸ࡿ[9]㸬ಟṇసᴗࡢ㏣ຍࢆኚ ᭦ᐜ᫆ᛶ࡜ࡋ࡚╔┠ࡋ࡚࠸ࡿⅬࡣᡃࠎࡢᥦ᱌ࡍࡿࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫ࡜ఝ࡚࠸ࡿ㸬 ࡇࢀࡽࡢࣉࣟࢭࢫࣔࢹࣜࣥࢢࡣࣉࣟࢪ࢙ࢡࢺࢆࢩ࣑࣮ࣗࣞࢺࡍࡿࡇ࡜࡛ࣉࣟࢭࢫࡢホ ౯ࡸᨵၿࢆࡍࡿࡇ࡜ࡀ┠ⓗ࡛࠶ࡿ㸬ᡃࠎࡢ◊✲࡛ࡣ㸪ࣉࣟࢪ࢙ࢡࢺෆ࡛ࣉࣟࢭࢫࡢ」 㞧ࡉࡢኚ໬ࢆィ ࡋ㸪ࣉࣟࢭࢫ࡜ࣉࣟࢲࢡࢺ࡜ࡢ㛵ಀࢆ᫂☜࡟ࡍࡿࡇ࡜ࡀ┠ⓗ࡛࠶ࡿ㸬 ୍᪉㸪ᐇ㊶ⓗ࣋ࢫࢺࣉࣛࢡࢸ࢕ࢫࡢ⤒㦂ࢆࡶ࡜࡟㸪」ᩘࡢࣉࣟࢭࢫࢆ⤫ྜࡋ࡚ᡂ㛗 ࡋࡓᐇ㊶ⓗ࡞ࣛࢩࣙࢼࣝ⤫୍ࣉࣟࢭࢫࡀᥦ᱌ࡉࢀ࡚࠸ࡿ[10]㸬཯᚟ᆺ㛤Ⓨ㸪࣮ࣘࢫࢣ ࣮ࢫ㥑ື㸪ࣜࢫࢡ㥑ື➼ࡢ⪃࠼᪉ࢆྲྀࡾධࢀ㸪࢔ࢪࣕ࢖ࣝࡸ.NET ➼ࡢ᭱᪂ᢏ⾡ࢸ࣮࣐ ࡟ࡶᑐᛂࡋࡓᐇ㉁ⓗ࡞⤫ྜࣉࣟࢭࢫ࡛࠶ࡿ㸬⟶⌮ࡢၥ㢟ࡸつᶍࡢၥ㢟ࡶ࠶ࡿࡀ㸪య⣔ ⓗ࡞ࣉࣟࢭࢫࡢᐇ㊶࡟ࡣ᭷┈࡞⤫ྜࣉࣟࢭࢫ࡛࠶ࡿ[11]㸬ࡦ࡜ࡘࡢࣉࣟࢪ࢙ࢡࢺ࡛」 ᩘࡢࣉࣟࢭࢫࡀΰᅾࡍࡿ࡜࠸࠺⪃࠼᪉ࡣᡃࠎࡢࣉࣟࢭࢫࡢ」㞧ࡉࡢ⪃࠼࡟ఝ࡚࠸ࡿ㸬 ࡋ࠿ࡋ㸪ࣉࣟࢭࢫయ⣔࡛࠶ࡿࣛࢩࣙࢼࣝ⤫୍ࣉࣟࢭࢫ࡜㸪ࣉࣟࢪ࢙ࢡࢺᐇ⾜୰࡟⣽࠿ ࡞ࣉࣟࢭࢫࡀⓎ⏕ࡍࡿࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࡣ᰿ᮏⓗ࡟␗࡞ࡿⓎ᝿࡛࠶ࡿ㸬ࡉࡽ࡟ᥦ. タィࣇ࢙࣮ࢬ. ศᯒ. タィ. ᐇ⿦. ࢸࢫࢺ ࣇࣛࢢ࣓ࣥࢺ ࣉࣟࢭࢫ. ௚ࢩࢫࢸ࣒࡜ࡢ㐃ᦠᶵ⬟㛤 Ⓨࡢࡳࢆᚋࡢసᴗ࡜ࡍࡿ. せ௳ᐃ⩏ࡢ࣑ࢫ࡛෌タィసᴗ. ᐇ⿦ࣇ࢙࣮ࢬ ศᯒ. タィ. ᐇ⿦. ࢸࢫࢺ. ࣇࣛࢢ࣓ࣥࢺ ࣉࣟࢭࢫ せ௳ᐃ⩏ࡢ࣑ࢫ୍࡛㒊ࡢᶵ⬟ࡢ ෌タィ࡜෌ᐇ⿦. 㛤Ⓨ㐜ᘏࡢࡓࡵ㸪୍㒊ࡢᶵ⬟ࡢ ᐇ⌧ࢆḟᅇࣂ࣮ࢪࣙࣥ࡬.. ࢸࢫࢺࣇ࢙࣮ࢬ ศᯒ. タィ. ᐇ⿦. ࢸࢫࢺ. ᛶ⬟ᨵၿࡢࡓࡵ࡟㸪୍㒊ࡢᶵ⬟ࡢ ෌タィ㸪෌ᐇ⿦㸪෌ࢸࢫࢺ. ࣇࣛࢢ࣓ࣥࢺ ࣉࣟࢭࢫ. ᅗ 1 ࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࡢᴫᛕ Figure 1 A concept of fragment process 2. © 2011 Information Processing Society of Japan.

(3) ソフトウェアエンジニアリングシンポジウム 2011 (1) ࠶ࡽࡺࡿᕤ⛬⟶⌮⾲࠿ࡽᐜ᫆࡟ᢳฟ࡛ࡁࡿᇶᮏⓗ࡞せ⣲ࡢࡳࢆ฼⏝ࡍࡿ㸬ࡇࢀ ࡟ࡼࡾᚑ᮶ࡢᐃ㔞ⓗࣉࣟࢭࢫ⟶⌮ᡭἲ[14] ࡢᑐ㇟࡛࠶ࡿ CMM ࣞ࣋ࣝ㸳௨ୖࡢ ⤌⧊࡛࠶ࡿᚲせࡀ࡞ࡃ࡞ࡿ㸬 (2) ᢳฟ࡛ࡁࡿせ⣲ࡢ࠺ࡕ㸪ࣉࣟࢭࢫᐇ⾜ࡢ」㞧ࡉ࡟ᙳ㡪ࡍࡿせ⣲࡟↔Ⅼࢆ⤠ࡿ㸬 (3) ࡦ࡜ࡘࡢࣉࣟࢭࢫࣇࣛࢢ࣓ࣥࢺࡢ」㞧ࡉࡣ㸪」ᩘせ⣲ࡀ࠾஫࠸࡟┦஌ⓗ࡟ᙳ㡪 ࡍࡿࡢ࡛㸪ᢳฟࡉࢀࡓせ⣲ࢆ஌⟬ࡋ࡚ồࡵࡿ㸬 (4) 」ᩘࡢࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࡀྠ᫬ᐇ⾜ࡍࡿሙྜ㸪ࣉࣟࢭࢫ඲యࡢ」㞧ࡉࡣྠ ᫬ᐇ⾜ࡍࡿࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࡢ」㞧ࡉࡢ⥲࿴࡜ࡍࡿ㸬 (5) ྠ୍⤌⧊ࡢᕤ⛬⟶⌮⾲࡟グ㍕ࡉࢀࡓ㡯┠ࡸࡑࡢ⢏ᗘࡣྠ୍ࡢࡶࡢ࡜௬ᐃࡍࡿ㸬 ୖグࡢ᪉㔪࡟ᇶ࡙ࡁ㸪ᥦ᱌ࡍࡿࣉࣟࢭࢫࡢ」㞧ࡉࡢ PC ್ࢆ௨ୗ࡟♧ࡍ㸬. ⏝࠸࡚࠸ࡿⅬ࡛␗࡞ࡿ㸬ࡲࡓ㸪ࣉࣟࢭࢫ࣓ࢺࣜࢡࢫࡣࣉࣟࢪ࢙ࢡࢺࡀ⤊஢ࡋࡓ᫬Ⅼ࡛ ☜ᐃࡍࡿ್࡛࠶ࡿࡓࡵ㸪ࣉࣟࢪ࢙ࢡࢺ㏵୰࡛ィ ࡛ࡁ࡞࠸Ⅼࡀᮏ◊✲࡜ࡣ␗࡞ࡿ㸬. 3. Process Complexity ࡢィ ᪉ἲ࡜ PCPQ ࣔࢹࣝࡢᥦ᱌  PCPQ ࣔࢹࣝࡣࣉࣟࢭࢫࡢ」㞧ࡉ࠿ࡽ᭱⤊ⓗ࡞ࣉࣟࢲࢡࢺࡢရ㉁ࢆண ࡍࡿࡶࡢ࡛ ࠶ࡿ㸬ᮏ❶࡛ࡣ PCPQ ࣔࢹࣝࢆᵓ⠏ࡍࡿࡓࡵࡢ Process Complexity ್㸦௨ୗ PC ್㸧࡟ ࡘ࠸࡚ㄝ᫂ࡋࡓᚋ㸪PCPQ ࣔࢹࣝࡢᥦ᱌࡜ᵓ⠏᪉ἲࢆ㏙࡭ࡿ㸬 3.1 ࣮࣋ࢫࣉࣟࢭࢫ࡜ࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫ ࢯࣇࢺ࢙࢘࢔㛤Ⓨ࡟࠾࠸࡚㸪㛤Ⓨ඲యࢆࡦ࡜ࡘࡢࣉࣟࢭࢫ࡜ࡋ࡚ィ⏬ࡋᐇ⾜ࡍࡿࡇ ࡜ࡀከ࠸㸬ࡋ࠿ࡋ㸪ᐇ㝿ࡢࣉࣟࢪ࢙ࢡࢺ࡛ࡣィ⏬ᕤ⛬࡛ணᐃࡋࡓ㛤Ⓨࣉࣟࢭࢫ࡛ࣉࣟ ࢪ࢙ࢡࢺࡀ⤊஢ࡍࡿࡇ࡜ࡣ⛥࡛࠶ࡿ㸬౛࠼ࡤ࢛࣮࢘ࢱࣇ࢛࣮ࣝ㛤Ⓨࣉࣟࢭࢫ࡛㛤Ⓨィ ⏬ࢆసᡂࡋࡓ࡜ࡋ࡚ࡶ㸪㢳ᐈࡢせᮃ࡟ࡼࡿࣉࣟࢺࢱ࢖ࣉࡢసᡂࡸ㸪௙ᵝኚ᭦㸪ࡲࡓࢸ ࢫࢺᕤ⛬୰ࡢࣉࣟࢢ࣒ࣛኚ᭦➼࡟ࡼࡾ㏣ຍసᴗࡀ㝶᫬Ⓨ⏕ࡋ㸪ࣉࣟࢪ࢙ࢡࢺ඲య࡜ࡋ ࡚ࡢ㛤Ⓨࣉࣟࢭࢫࡣ」㞧໬ࡍࡿ㸬ᮏ✏࡛ࡣࣉࣟࢪ࢙ࢡࢺࡢィ⏬ẁ㝵࡛Ỵᐃࡉࢀࡓ㛤Ⓨ ࣉࣟࢭࢫࢆ࣮࣋ࢫࣉࣟࢭࢫ࡜࿧ࡧ㸪ࣉࣟࢪ࢙ࢡࢺ୰࡟Ⓨ⏕ࡋࡓィ⏬እࡢࣉࣟࢭࢫࢆࣇ ࣛࢢ࣓ࣥࢺࣉࣟࢭࢫ࡜࿧ࡪ㸬ࣇࣛࢢ࣓ࣥࢺ࡜ࡣࠕ᩿∦ࠖ࡜࠸࠺ព࿡࡛࠶ࡾ㸪࣮࣋ࢫࣉ ࣟࢭࢫ࡟᩿∦ⓗ࡟㏣ຍࡉࢀ㸪୪⾜ᐇ⾜ࡉࢀࡿᵝ࠿ࡽࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫ࡜࿨ྡࡋࡓ㸬 㐣ཤࡢ஦౛ࡢ୍㒊ࢆ⏝࠸ࡓࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࡢᴫᛕࢆᅗ㸯࡟♧ࡍ㸬ィ⏬ࣇ࢙࣮ ࢬ࡛ࡣศᯒ㸪タィ㸪ᐇ⿦㸪ࢸࢫࢺࡢ༢⣧࡞ࣉࣟࢭࢫ࡛࠶ࡗࡓ㸬ከࡃࡢሙྜ㸪ィ⏬᫬࡟ ࡣࢩࢫࢸ࣒࡟㛵ࡍࡿ᝟ሗࡀᑡ࡞࠸㸦ศᯒࡉࢀ࡚࠸࡞࠸㸧ࡓࡵ㸪⣽࠿࡞ࣉࣟࢭࢫ࡜࠸࠺ ࡼࡾࡶ኱ࡲ࠿࡞ࣉࣟࢭࢫ㸦࣐ࢡࣟࣉࣟࢭࢫ㸧[13]࡛ィ⏬ࡍࡿࡇ࡜ࡀከ࠸㸬ࡋ࠿ࡋ㸪ࣉ ࣟࢪ࢙ࢡࢺࡀ㐍⾜ࡍࡿ࡜᝟ሗ㔞ࡀከࡃ࡞ࡾ㸪ࣉࣟࢭࢫࡶ」㞧࡟ኚ໬ࡍࡿ㸬ᅗ㸯ࡢሙྜ㸪 ศᯒ᫬࡟ࡣᙜึணᐃࡋ࡚࠸࡞࠿ࡗࡓࣉࣟࢺࢱ࢖ࣉ㛤Ⓨࡀ㢳ᐈࡢせᮃ࡟ࡼࡾ㏣ຍࡉࢀࡓ㸬 ࡲࡓศᯒ⤖ᯝ࠿ࡽᮇ㛫࡜ࢥࢫࢺไ⣙࡟ࡼࡾ඲࡚ࡢᶵ⬟ࡢᐇ⿦ࡀ㞴ࡋ࠸ࡇ࡜ࡀศ࠿ࡾ㸪 ୍㒊ࡢᶵ⬟ࢆḟࣂ࣮ࢪࣙࣥ࡬⛣⾜ࡋࡓ㸬ࡉࡽ࡟㸪タィࣇ࢙࣮ࢬ࡛ࡣせ௳ᐃ⩏࣑ࢫࢆⓎ ぢࡋせ௳ᐃ⩏ࡢࡸࡾ┤ࡋసᴗࡸ㸪௚ࢩࢫࢸ࣒ࡢ㐃ᦠタィ࡛ࡣ௚ࢩࢫࢸ࣒㛤Ⓨ㐍ᤖࡢ㐜 ࢀ࡟ࡼࡾ㐃ᦠ㒊ศࡢᐇ⿦ࢆᚋ࡟ࡍࡿ➼࡟ࡼࡾィ⏬ࡣኚ᭦ࡉࢀࡓ㸬ᐇ⿦ࣇ࢙࣮ࢬ࡛ࡣせ ௳ᐃ⩏࣑ࢫࡸタィ࣑ࢫ࡟ࡼࡿࡸࡾ┤ࡋసᴗࡀⓎ⏕ࡋ㸪ࢸࢫࢺࣇ࢙࣮ࢬ࡛ࡣᛶ⬟ࢸࢫࢺ ⤖ᯝ࡟ᇶ࡙ࡁタィࡢࡸࡾ┤ࡋసᴗࡀⓎ⏕ࡋࡓ౛ࡀᅗ㸯࡛࠶ࡿ㸬 ࡇࡢࡼ࠺࡟㢳ᐈࡢせᮃኚ᭦㸪௚ࢩࢫࢸ࣒㛵㐃࡞࡝࡟ࡼࡾ᪂ࡓ࡟Ⓨ⏕ࡋࡓ⣽࠿࡞ࣉࣟ ࢭࢫࡀࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫ࡛࠶ࡿ㸬ࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫ࡟ࡣ⡆༢࡞௙ᵝ᭩ࡢಟṇ సᴗ࠿ࡽࡦ࡜ࡘࡢᶵ⬟ࢆタィ࣭ᐇ⿦࣭ࢸࢫࢺ࡞࡝ࡢ኱ࡁ࡞సᴗ➼㸪ᵝࠎ࡞⢏ᗘࡀᏑᅾ ࡍࡿࡀ㸪ࡇࡇ࡛ࡣᙜึィ⏬࡟࡞࠸඲࡚ࡢ୍㐃ࡢసᴗࢆࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫ࡜ࡍࡿ㸬 3.2 PC ್ࡢィ ᪉ἲ Process Complexity ࢆᐃ⩏ࡍࡿ㝿ࡢ᪉㔪ࢆ௨ୗ࡟♧ࡍ㸬. N (t ). PC ( t ) =  ( Num _ dev ( t ) i × L( t ) i × term ( t ) i ) i =1. ࣭࣭࣭ 㸦㸯㸧. PC(t):. ᫬้ t ࡢࣉࣟࢭࢫࡢ」㞧ࡉ㸦᫬้ 0㹼t ࡲ࡛ࡢ⤊஢ࣉࣟࢭࢫࡶྵࡴ㸧. N(t):. ᫬้ t ࡢ࣮࣋ࢫࣉࣟࢭࢫࢆྵࡴ඲ࣉࣟࢭࢫ⥲ᩘ㸦᫬้ 0㹼t ࡲ࡛ࡢ⤊஢ࣉ ࣟࢭࢫࡶྵࡴ㸧㸬. Num_dev(t)i:. ᫬้ t ࡢ i ␒┠ࡢࣉࣟࢭࢫ࡟࠿࠿ࢃࡿ㛤Ⓨ⪅ࢢ࣮ࣝࣉᩘ㸬. L(t)i:. ᫬้ t ࡢ i ␒┠ࡢࣉࣟࢭࢫࡢྠ᫬ᐇ⾜ࣉࣟࢭࢫᩘ㸬. term(t)i:. ᫬้ t ࡢ i ␒┠ࡢࣉࣟࢭࢫࡢᐇ⾜ᮇ㛫ࡢ඲య㛤Ⓨᮇ㛫࡟ᑐࡍࡿ๭ྜ㸬ࡘࡲ ࡾ㸪1.0 ࡟㏆࠸ሙྜࡣࣉࣟࢭࢫࡢᐇ⾜ᮇ㛫ࡀ࡯ࡰ㛤Ⓨᮇ㛫඲య࡟ࢃࡓࡿ㸬. ᥦ᱌ࡍࡿ PC ್ࡢࣃ࣓࣮ࣛࢱࡣ㸪Num_dev(t)i ࡀ᫬้ t ࡢ i ␒┠ࡢࣉࣟࢭࢫ࡟࠿࠿ࢃࡿ 㛤Ⓨ⪅ࢢ࣮ࣝࣉᩘ࡛࠶ࡾ㸪L(t)i ࡣ᫬้ t ࡢ i ␒┠ࡢࣉࣟࢭࢫ࡜ྠ᫬ᐇ⾜ࡍࡿࣉࣟࢭࢫᩘ㸪 term(t)i ࡣ᫬้ t ࡢ i ␒┠ࡢࣉࣟࢭࢫࡢࣉࣟࢪ࢙ࢡࢺ඲యࡢ㛤Ⓨᮇ㛫࡟ᑐࡍࡿᐇ⾜ᮇ㛫ࡢ ๭ྜࢆ♧ࡍ㸬ᕤ⛬⟶⌮⾲࠿ࡽᢳฟ࡛ࡁࡿせ⣲ࡢ࠺ࡕ㸪Num_dev(t)i ࡢ㛤Ⓨ⪅ࢢ࣮ࣝࣉᩘ ࡣ୍ࡘࡢసᴗࢆ」ᩘே࡛ᢸᙜࡍࡿࡇ࡜࡛ᕤᩘࡀቑ࠼ࡿ㸦ࡘࡲࡾ㸪ࣉࣟࢭࢫࡀ」㞧࡟࡞ ࡿ㸧࡜࠸࠺ほⅬ࠿ࡽ㑅ᢥࡋࡓ㸬L(t)i ࡢྠ᫬ᐇ⾜ࡍࡿࣉࣟࢭࢫᩘ࡜ term(t)i ࡢᐇ⾜ᮇ㛫ࡣ సᴗ㛫ࡢྠᮇ(ࢥ࣑ࣗࢽࢣ࣮ࢩࣙࣥ)ࢆ࡜ࡿࡇ࡜ࡢ㞴ࡋࡉࡼࡾ㑅ᢥࡋࡓ㸬㑅ᢥࡉࢀࡓ㸱 せ⣲ࡣ࠾஫࠸࡟┦஌ⓗ࡟ᙳ㡪ࢆ୚࠼ࡿ್࡛࠶ࡿࡢ࡛㸪ࡑࢀࡒࢀࢆ஌⟬ࡋࡓ㸬 ྛせ⣲ࢆヲࡋࡃㄝ᫂ࡍࡿ㸬㛤Ⓨ⪅ࢢ࣮ࣝࣉᩘ Num_dev(t)i ࡢࢢ࣮ࣝࣉ⢏ᗘࡣࣉࣟࢭࢫ ࡢ⢏ᗘ࡟౫Ꮡࡍࡿ㸬౛࠼ࡤ㸪ࣉࣟࢭࢫ࡟ྵࡲࢀࡿసᴗࡢ⢏ᗘࡀ᪥༢఩࡛࠶ࡿ࡜ Num_dev(t)i ࡢࢢ࣮ࣝࣉ⢏ᗘࡣே༢఩ࡀ┦ᙜ࡜⪃࠼ࡿ㸬ࡘࡲࡾ㸪᪥༢఩ࡢసᴗィ⏬࡛⟶ ⌮ࡍࡿࡢࡣ㛤Ⓨ⪅ẖࡢ⟶⌮ࡀ㐺ᙜ࡛࠶ࡿ㸬ྠᵝ࡟㸪ࣉࣟࢭࢫ࡟ྵࡲࢀࡿసᴗ⢏ᗘࡀ㐌 ༢఩࡛࠶ࡿ࡜㸪Num_dev(t)i ࡢࢢ࣮ࣝࣉ⢏ᗘࡣࢳ࣮࣒༢఩ࡀ┦ᙜ࡛࠶ࡿ㸬⤌⧊ࡢᕤ⛬⟶ ⌮⾲ࡢ⟶⌮༢఩ࡈ࡜࡟ Num_dev(t)i ࡢࢢ࣮ࣝࣉ⢏ᗘࡀỴᐃࡉࢀࡿ㸬୍᪉㸪term(t)i ࡣࣉࣟ ࢭࢫࡢࣉࣟࢪ࢙ࢡࢺ඲య࡟୚࠼ࡿ᫬㛫ⓗᙳ㡪㔞ࢆ♧ࡍ㸬ࡶࡋ㸪࠶ࡿࣉࣟࢭࢫࡢᐇ⾜᫬ 㛫ࡀ㠀ᖖ࡟㛗࠸㸪ࡘࡲࡾࣉࣟࢪ࢙ࢡࢺࡢ඲㛤Ⓨᮇ㛫࡟┦ᙜࡍࡿሙྜ㸪ࡑࡢࣉࣟࢭࢫࡣ. 3. © 2011 Information Processing Society of Japan.

(4) ソフトウェアエンジニアリングシンポジウム 2011 ⌧ᅾ. ⌧ᅾ సᴗ. 4/1. 5/1. 6/1. 7/1. 8/1. సᴗ. 9/1. 4/1. 5/1. 6/1. 7/1. 8/1. ࡾ N(t)=4 ࡜࡞ࡿ㸬࣮࣋ࢫࣉࣟࢭࢫࢆ i=1㸪㏣ຍࡉࢀࡓࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࢆ i=2,3,4 ࡜ࡍࡿ࡜㸪᫬้ t ࡀ㸴᭶㸯᪥ࡢ PC ್ࡣ௨ୗࡢィ⟬࡜࡞ࡿ㸬 ձ i=1(࣮࣋ࢫࣉࣟࢭࢫ) (i) Num_dev(t)_1=3 (ii) L(t)_1=4 (iii) term(t)_1=180/180=1.0 ղ i=2(ᅗ୰ࡢ D ࡢࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫ) (i) Num_dev(t)_2=1 (ii) L(t)_2=4 (iii) term(t)_2=30/180=0.166 ճ i=3(ᅗ୰ࡢ E ࡢࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫ) (i) Num_dev(t)_3=1 (ii) L(t)_3=4 (iii) term(t)_3=45/180=0.25 մ i=4(ᅗ୰ࡢ D ࡢࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫ) (i) Num_dev(t)_4=1 (ii) L(t)_4=4 (iii) term(t)_4=60/180=0.333  ᚑࡗ࡚㸪࣮࣋ࢫࣉࣟࢭࢫ࡟㸱ࡘࡢࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࡀ㏣ຍࡉࢀࡓࣉࣟࢭࢫ」㞧 ࡉࡣ㸪PC(t)=12.000+0.664+1.000+1.332=14.996 ࡜࡞ࡿ㸬 3.4 PCPQ ࣔࢹࣝࡢᥦ᱌  PC ್ࡣࣉࣟࢭࢫࡢ」㞧ࡉࢆィ ࡋࡓࡶࡢ࡛࠶ࡿ㸬ࡇࢀ࡟ࡼࡾ㸪㏣ຍࡉࢀࡓࣇࣛࢢ࣓ ࣥࢺࣉࣟࢭࢫࡀࣉࣟࢭࢫ඲య࡟࡝ࡢ⛬ᗘᙳ㡪ࡋ࡚࠸ࡿ࠿ࢆุ᩿࡛ࡁࡿ㸬ࡋ࠿ࡋ㸪PC ್ࡔࡅ࡛ࡣࣉࣟࢲࢡࢺࡢရ㉁ࢆண ࡍࡿࡇ࡜ࡣ࡛ࡁ࡞࠸㸬ࡑࡇ࡛㸪 PCPQ(Process Complexity - Product Quality)ࣔࢹࣝࢆᥦ᱌ࡍࡿ㸬PCPQ ࣔࢹࣝࡣ㸪᭱⤊ⓗ࡞ PC ್࡜㞀 ᐖẚ㔜ࡢ್࠿ࡽᵓ⠏ࡍࡿࡇ࡜࡛㸪௒ᚋࡢࣉࣟࢪ࢙ࢡࢺࡢ᭱⤊ⓗ࡞ࣉࣟࢲࢡࢺရ㉁ࢆண ࡍࡿࣔࢹ࡛ࣝ࠶ࡿ㸬᭱⤊ⓗ࡞ PC ್࡜ࡣࣉࣟࢪ࢙ࢡࢺ⤊஢᫬ࡢ PC ್ࡢࡇ࡜࡛࠶ࡾ㸪 㞀ᐖẚ㔜࡜ࡣ࣮ࣜࣜࢫᚋ࡟Ⓨ⏕ࡋࡓ㞀ᐖࡢᩘ࡜ࡑࡢ㔜せᗘ࡟ᇶ࡙࠸ࡓࣉࣟࢲࢡࢺရ㉁ ࡛࠶ࡿ㸬PCPQ ࣔࢹ࡛ࣝࡣ㸪X ㍈࡟᭱⤊ⓗ࡞ PC ್㸪Y ㍈࡟㞀ᐖẚ㔜ࡢ್࡜ࡋ㸪㐣ཤࡢ 」ᩘࣉࣟࢪ࢙ࢡࢺࡢ㸰ࡘࡢ್ࢆࣉࣟࢵࢺࡍࡿ㸬ࡇࢀ࡟ࡼࡾ㸪 PC ್࡜㞀ᐖẚ㔜ࡢ㛵ಀ ࢆ᫂☜࡟࡛ࡁ㸪ࣔࢹࣝᵓ⠏࡟฼⏝ࡋ࡞࠿ࡗࡓࣉࣟࢪ࢙ࢡࢺࡢ PC ್࠿ࡽ࣮ࣜࣜࢫᚋࡢ 㞀ᐖࢆண ࡍࡿࣔࢹ࡛ࣝ࠶ࡿ㸬ࡲࡓ㸪ᕤ⛬⟶⌮⾲ࡸ࣮ࣜࣜࢫᚋࡢ㞀ᐖ⟶⌮᪉ἲࡀ⤌⧊ ࡈ࡜࡟␗࡞ࡿࡓࡵ㸪⤌⧊ࡈ࡜ࡢ PCPQ ࣔࢹࣝࢆసᡂࡍࡿᚲせࡀ࠶ࡿ㸬౛࠼ࡤ㸪࠶ࡿ⤌ ⧊ࡢ⟶⌮⪅ࡣ᪥ẖࡢᕤ⛬⟶⌮⾲ࢆసᡂࡍࡿࡀ㸪௚ࡢ⤌⧊ࡢ⟶⌮⪅ࡣ㐌༢఩ࡢᕤ⛬⟶⌮ ⾲ࢆసᡂࡍࡿ㸬ᥦ᱌ࡍࡿ PC ್ࡢࣉࣟࢭࢫࡢ⢏ᗘࡣᕤ⛬⟶⌮⾲ࡢ⢏ᗘ࡟౫Ꮡࡍࡿࡢ࡛㸪 ⤌⧊ࡈ࡜ࡢ PCPQ ࣔࢹࣝ࡜࡞ࡿ㸬ྠ᫬࡟㞀ᐖ⟶⌮᪉ἲࡶ⤌⧊ࡈ࡜࡟␗࡞ࡿ㸬≉࡟㸪㞀. 9/1. A. A B. ࣮࣋ࢫ. B. C. ࣉࣟࢭࢫ. C D E F. 4 ᭶ 1 ᪥⌧ᅾࡢᕤ⛬⟶⌮⾲. ࣇࣛࢢ࣓ࣥࢺ ࣉࣟࢭ ࢫ. 6 ᭶ 1 ᪥⌧ᅾࡢᕤ⛬⟶⌮. ᅗ 2 ᕤ⛬⟶⌮⾲࠿ࡽࡢࣉࣟࢭࢫࣇࣛࢢ࣓ࣥࢺᢳฟ౛ Figure 2 Extracting fragment process from configuration of a workflow management table ኱ࡁࡃࣉࣟࢪ࢙ࢡࢺ඲య࡟ᙳ㡪ࢆཬࡰࡍ㸬཯ᑐ࡟ࣉࣟࢭࢫࡢᐇ⾜᫬㛫ࡀ 1 ᪥⛬ᗘ࡞ࡽ㸪 ࡑࡢࣉࣟࢭࢫࡣࣉࣟࢪ࢙ࢡࢺ࡬ࡢᙳ㡪ࡀᑠࡉ࠸࡜⪃࠼ࡿ㸬ࡘࡲࡾ㸪ከࡃࡢࣉࣟࢭࢫࡀ Ⓨ⏕ࡋ㸪ྛࣉࣟࢭࢫࡢᐇ⾜ᮇ㛫ࡀ㛗ࡃ㸪ྛࣉࣟࢭࢫࡀ୪⾜ᐇ⾜ࡉࢀࡓሙྜ㸪PC ್ࡣ኱ ࡁࡃ࡞ࡿ㸬㏫࡟㸪ࣉࣟࢭࢫࡢⓎ⏕ࡀᑡ࡞ࡃ㸪ྛࣉࣟࢭࢫࡢᐇ⾜ᮇ㛫ࡀ▷ࡃ㸪ྛࣉࣟࢭ ࢫࡀ୪⾜ᐇ⾜ࡉࢀ࡞࠸ሙྜ㸪ࣉࣟࢪ࢙ࢡࢺ࡬ࡢᙳ㡪ࡣᑠࡉ࠸࡜⪃࠼ࡿ 3.3 ࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࡢᢳฟ᪉ἲ࡜ PC ್ࡢィ ౛ PC ್ࡣᕤ⛬⟶⌮⾲࡟グ㍕ࡉࢀࡓ࣮࣋ࢫࣉࣟࢭࢫ࡜ࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫ࡟ᇶ࡙ࡁ ィ ࡍࡿ㸬ᅗ㸰࡟ᕤ⛬⟶⌮⾲ࡢ౛࠿ࡽࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࡢᢳฟ᪉ἲࢆ♧ࡍ㸬⾲ࡢ ᶓ㍈ࡣ᪥௜㸪⦪㍈ࡣసᴗ㸦ࣉࣟࢭࢫ㸧ࢆ♧ࡍ㸬ᅗ㸰ࡢᕥࡢ⾲ࡣィ⏬ẁ㝵࡟࡚సᡂࡉࢀ ࡓ࣮࣋ࢫࣉࣟࢭࢫࡔࡅࢆ♧ࡋ㸪ྑࡢ⾲ࡣ㸳᭶㸯᪥࡟ணᮇࡏࡠせ௳ࡀ㏣ຍࡉࢀ㸪࣮࣋ࢫ ࣉࣟࢭࢫ࡟㸱ࡘࡢࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࡀ㏣ຍࡉࢀࡓᕤ⛬⟶⌮⾲ࢆ♧ࡍ㸬ࡘࡲࡾ㸪ᅗ 㸰ࡢ A㸪B㸪C ࡣ࣮࣋ࢫࣉࣟࢭࢫ࡛࠶ࡾ㸪D㸪E㸪F ࡣࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࢆ♧ࡋ࡚ ࠸ࡿ㸬ࡇࡢ᫬ࡢ㛵ࢃࡗ࡚࠸ࡿ㛤Ⓨ⪅ࡣࢢ࣮ࣝࣉ༢఩࡜ࡋ㸪࣮࣋ࢫࣉࣟࢭࢫࡀ SE㸪PG㸪 㢳ᐈࡢ㸱ࢢ࣮ࣝࣉ㸪ࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࡣ PG ࡀ㛵ࢃࡗ࡚࠸ࡓ࡜ࡍࡿ㸬 ᅗ㸰ࡢᕤ⛬⟶⌮⾲࠿ࡽ㸴᭶㸯᪥࡟ࡣ࣮࣋ࢫࣉࣟࢭࢫ࡜㸱ࡘࡢࣇࣛࢢ࣓ࣥࢺࣉࣟࢭ ࢫࡀྠ᫬ᐇ⾜ࡍࡿࡇ࡜࡜࡞ࡿ㸬ࡘࡲࡾ㸪ࣉࣟࢪ࢙ࢡࢺ㛤ጞ᫬࡜⌧ẁ㝵ࡢᕤ⛬⟶⌮⾲ࡢ ᕪศ࠿ࡽࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࡢᢳฟࡸ PC ್ࡢࣃ࣓࣮ࣛࢱࡢ್ࢆᢳฟࡍࡿࡇ࡜ࡀ࡛ ࡁࡿ㸬ᮏᥦ᱌ࡣᕤ⛬⟶⌮⾲ࡉ࠼Ꮡᅾࡍࢀࡤ࢔ࢪࣕ࢖ࣝ㛤Ⓨࣉࣟࢭࢫ➼ࡢᵝࠎ࡞㛤Ⓨࣉ ࣟࢪ࢙ࢡࢺ࡛ࡶ฼⏝ྍ⬟࡛࠶ࡿ㸬ྠ᫬࡟ࣉࣟࢪ࢙ࢡࢺィ⏬ᙜึࡢ࣮࣋ࢫࣉࣟࢭࢫࡢ」 㞧ࡉࡶィ ࡍࡿࡇ࡜ࡀྍ⬟࡛࠶ࡿ㸬 ḟ࡟ PC ್ࡢィ ౛ࢆ♧ࡍ㸬ᅗ㸰ࡢ౛࡛ࡣ㸪180 ᪥ࡢ࢛࣮࢘ࢱࣇ࢛࣮ࣝࣉࣟࢭࢫ㸦࣋ ࣮ࢫࣉࣟࢭࢫ㸧ࡀ࠶ࡗࡓ࡜ࡍࡿ㸬ࡇࡢࣉࣟࢭࢫ࡟㏣ຍࣉࣟࢭࢫ࡜ࡋ࡚㸪ࣇࣛࢢ࣓ࣥࢺ ࣉࣟࢭࢫ D㸪E㸪F ࡀ 30 ᪥㸪45 ᪥㸪60 ᪥ࡢ㏣ຍసᴗࡀⓎ⏕ࡋࡓ࡜௬ᐃࡍࡿ㸬ࡇࡢẁ㝵 ࡛ࡢࣉࣟࢭࢫ࢖ࣥࢫࢱࣥࢫᩘࡣ࣮࣋ࢫࣉࣟࢭࢫ㸯ࡘ࡜ࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࡀ㸱ࡘ࡞. 4. © 2011 Information Processing Society of Japan.

(5) ソフトウェアエンジニアリングシンポジウム 2011. 4. PCPQ ࣔࢹࣝࡢ㐺⏝ 4.1 㸴ࣉࣟࢪ࢙ࢡࢺ࡬ࡢ㐺⏝  PC ್ࢆ⏘ᴗ⏺ࡢ㸴ࣉࣟࢪ࢙ࢡࢺ㸦⾲㸯ཧ↷㸧࡟࡚ィ ࡋࡓ㸬ࡇࢀࡽࡢࣉࣟࢪ࢙ࢡࢺ ࡣᩍ⫱⣔ࡢ࢔ࣉࣜࢣ࣮ࢩࣙࣥࢆᑓ㛛࡟㛤Ⓨࡍࡿྠ୍⤌⧊ࡢࣉࣟࢪ࢙ࢡࢺ࡛࠶ࡿ㸬㸴ࣉ ࣟࢪ࢙ࢡࢺ࡜ࡶ࡟ྠ୍⤌⧊࡟ࡼࡿ኱Ꮫࡢᩍ⫱⣔ࢩࢫࢸ࣒ࡢ㛤Ⓨ࡛࠶ࡿࣉࣟࢪ࢙ࢡࢺ A ࡜ࣉࣟࢪ࢙ࢡࢺ C ࡣ᪂つ㛤Ⓨ࡛࠶ࡿࡀ㸪ࡑࢀ௨እࡢࣉࣟࢪ࢙ࢡࢺࡣẕయࢩࢫࢸ࣒ࡢࣂ ࣮ࢪࣙࣥ࢔ࢵࣉ࡛࠶ࡗࡓ㸬 4.2 㸴ࣉࣟࢪ࢙ࢡࢺࡢ PC ್ࡢ᥎⛣  ᅗ㸱࡟㸴ࣉࣟࢪ࢙ࢡࢺࡢ PC ್ࡢ᥎⛣ࢆ♧ࡍ㸬᭱ࡶ㧗࠸ PC ್ࡣࣉࣟࢪ࢙ࢡࢺ D ࡢ 44.4 ࡛࠶ࡾ㸪᭱ࡶప࠸್ࡣࣉࣟࢪ࢙ࢡࢺ F ࡢ 15.4 ࡛࠶ࡿ㸬ࡋࡓࡀࡗ࡚㸪ࣉࣟࢪ࢙ࢡࢺ D ࡣከࡃࡢࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࢆྵࡴ」㞧࡞ࣉࣟࢭࢫ࡛࠶ࡿࡇ࡜ࡀࢃ࠿ࡾ㸪ࣉࣟࢪ ࢙ࢡࢺ F ࡣࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࡀᑡ࡞࠸ࢩࣥࣉࣝ࡞ࣉࣟࢭࢫ࡛࠶ࡿࡇ࡜ࡀࢃ࠿ࡿ㸬  ࡲࡓ㸪ࣉࣟࢪ࢙ࢡࢺ A ࡣ᪂つ㛤Ⓨࢩࢫࢸ࣒࡛࠶ࡾ㸪ࣉࣟࢪ࢙ࢡࢺ D ࡟ḟ࠸࡛ PC ್ ࡀ㧗࠸ࣉࣟࢪ࢙ࢡࢺ࡛࠶ࡿ㸬㛤Ⓨ⪅࡬ࡢ࢖ࣥࢱࣅ࣮ࣗ࡟ࡼࡿ࡜㸪㢳ᐈࡀ᪂ࡋ࠸ࢩࢫࢸ ࣒ࢆ᪩ᮇ࡟࢖࣓࣮ࢪࡍࡿࡇ࡜ࡀ㞴ࡋࡃ㸪㢳ᐈࡢせồࡀ㢖⦾࡟ኚ᭦ࡉࢀ㸪㏣ຍసᴗࡀከ ࡃ࡞ࡗࡓ㸬ࡘࡲࡾ㸪せồኚ᭦࡟ࡼࡾ㏣ຍసᴗࡀከࡃ࡞ࡾ㸪ࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࡢቑ ຍ࡟ࡘ࡞ࡀࡗࡓ࡜⪃࠼ࡽࢀࡿ㸬ྠᵝ࡟ࣉࣟࢪ࢙ࢡࢺ C ࡶ᪂つ㛤Ⓨࢩࢫࢸ࣒࡛࠶ࡾ㸪㢳 ᐈࡣࢩࣥࣉࣝ࡞ GUI ࢆせᮃࡋࡓࡀ㸪㛤Ⓨ⪅ࡀ࢖࣓࣮ࢪ࡛ࡁࡎ㸪⤖ᯝࣉࣟࢺࢱ࢖ࣉࢆస ᡂࡍࡿࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࡀⓎ⏕ࡋࡓ㸬ࡲࡓ㸪ࢸࢫࢺᕤ⛬࡛ࡣࢿࢵࢺ࣮࣡ࢡ࢚࣮ࣛ ࡟ࡼࡿࢿࢵࢺ࣮࣡ࢡࢳ࣮ࣗࢽࣥࢢࡢࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࡀⓎ⏕ࡍࡿ➼࡟ࡼࡾ PC ್ ࡀቑຍࡋࡓ㸬ࡑࢀ࡟ᑐࡋ࡚㸪ࣉࣟࢪ࢙ࢡࢺ B ࡣࡍ࡛࡟✌ാࡋ࡚࠸ࡿẕయࢩࢫࢸ࣒ࡢࣂ ࣮ࢪࣙࣥ࢔ࢵࣉ࡛࠶ࡗࡓ㸬㢳ᐈࡶẕయࢩࢫࢸ࣒ࢆ⇍▱ࡋ㸪㏣ຍࡍࡿᶵ⬟ࡢ࢖࣓࣮ࢪࡶ ᢕᥱࡋ࡚࠸ࡿࡓࡵせồኚ᭦ࡀ㢖⦾࡟ࡉࢀࡿࡇ࡜ࡣ࡞࠿ࡗࡓ㸬⤖ᯝ࡜ࡋ࡚㸪ࣉࣟࢪ࢙ࢡ ࢺ B ࡛ࡣ 15 㐌┠ࡢ࿘㎶୍࡛᫬ⓗ࡟ PC ್ࡀቑຍࡍࡿࡀ㸪඲య࡜ࡋ࡚ప࠸್ࢆ⥔ᣢ࡛ࡁ ࡓ࡜⪃࠼ࡽࢀࡿ㸬ࡲࡓ㸪ࣉࣟࢪ࢙ࢡࢺ D ࡣẕయࢩࢫࢸ࣒ࡢࣂ࣮ࢪࣙࣥ࢔ࢵࣉ࡛࠶ࡗࡓ ࡀ㸪PC ್ࡣ㛤Ⓨᮇ㛫ࢆ㏻ࡋ࡚ᖖ࡟㧗࠿ࡗࡓ㸬㛤Ⓨ⪅࡬ࡢ࢖ࣥࢱࣅ࣮ࣗ࡟ࡼࢀࡤ㸪ࣉࣟ ࢪ࢙ࢡࢺ D ࡣ๓ࣂ࣮ࢪࣙࣥࡢࢩࢫࢸ࣒࡟ከࡃࡢ㞀ᐖࡀⓎ⏕ࡋ㸪ࡑࡢ㞀ᐖᑐᛂ࡜ࣉࣟࢪ ࢙ࢡࢺ D ࡛ᮏ᮶ᐇ᪋ࡍ࡭ࡁ㛤Ⓨసᴗࡢྠ᫬㐍⾜ࡀ⾜ࢃࢀࡓ㸬ࡘࡲࡾ㸪ィ⏬ࡉࢀࡓ᪂つ ᶵ⬟ࡢ㛤Ⓨࢆ⾜࠸࡞ࡀࡽ㸪ከࡃࡢ㞀ᐖᑐᛂ࡜࠸࠺ࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࡀⓎ⏕ࡋࡓࡇ ࡜࡜࡞ࡿ㸬⤖ᯝ࡜ࡋ࡚㸪ࣉࣟࢪ࢙ࢡࢺ D ࡢ PC ್ࡣᖖ࡟㧗࠸್ࢆ♧ࡋࡓ㸬ࣉࣟࢪ࢙ࢡ ࢺ E ࡣẕయࢩࢫࢸ࣒ࡢࣜࣇ࢓ࢡࢱࣜࣥࢢࡀ୺࡞㛤Ⓨ࡛࠶ࡗࡓ㸬ࡋࡓࡀࡗ࡚㸪᪂ࡓ࡞ᶵ ⬟㛤Ⓨࢆ⾜ࢃࡎࣜࣇ࢓ࢡࢱࣜࣥࢢ࡟㞟୰ࡋࡓࡓࡵ㸪PC ್ࡀẚ㍑ⓗపࡃ࡞ࡗࡓ࡜⪃࠼ࡽ ࢀࡿ㸬ࡑࡢᚋࣉࣟࢪ࢙ࢡࢺ F ࡣࣉࣟࢪ࢙ࢡࢺ E ࡛ᐇ⿦ணᐃ࡛࠶ࡗࡓᶵ⬟ࡢ㛤Ⓨ࡛࠶ࡗ ࡓࡓࡵ㸪ᶵ⬟ෆᐜࡸ㢳ᐈࡢពᛮࢆ࠿࡞ࡾ⇍▱ࡋ࡚࠾ࡾ㸪ࡲࡓẕయࢩࢫࢸ࣒ࡶᏳᐃࡋ࡚ ࠸ࡓࡓࡵ඲యࢆ㏻ࡋ࡚ PC ್ࡣప࠸್ࢆ⥔ᣢࡋࡓ㸬. ᅗ 3 㸴ࣉࣟࢪ࢙ࢡࢺࡢ PC ್ࡢ᥎⛣ Figure 3 Changes of values of process complexities (moment version) of 6 projects ᐖࡢ㔜せᗘࡣ⤌⧊࡟ࡼࡗุ࡚᩿ࡀ␗࡞ࡿ㸬౛࠼ࡤ㸪ࢩࢫࢸ࣒ࢲ࢘ࣥࡀ᭱ࡶ῝้࡞㞀ᐖ ࡜ุ᩿ࡍࡿ⤌⧊࡟ᑐࡋ࡚㸪せ௳ᐃ⩏࢚࣮ࣛࡀ᭱ࡶ῝้࡞㞀ᐖ࡜ุ᩿ࡍࡿ⤌⧊ࡶ࠶ࡿ㸬 ࡘࡲࡾ㸪ᕤ⛬⟶⌮⾲࡛ࡢ⟶⌮᪉ἲࡸ㞀ᐖࡢ㔜せᗘࡢ⟶⌮᪉ἲࡶ⤌⧊࡟ࡼࡗ࡚␗࡞ࡿࡢ ࡛㸪ᮏࣔࢹࣝࡣ⤌⧊ࡈ࡜࡟ᵓ⠏ࡉࢀࡿ㸬ࡓࡔࡋ PCPQ ࣔࢹࣝࢆᵓ⠏ࡍࡿ࡟ࡣ⤌⧊ẖ࡛ ᕤ⛬⟶⌮⾲࡜㞀ᐖ⟶⌮⾲ࡢ⟶⌮᪉ἲࢆ⤫୍ࡍࡿᚲせࡀ࠶ࡿ㸬PCPQ ࣔࢹࣝࡣ᪂つࡢࣉ ࣟࢪ࢙ࢡࢺ㐍⾜㏵୰࡟㸪ᐃᮇⓗ࡟ PC ್ࢆィ ࡋ㐣ཤࡢࣉࣟࢪ࢙ࢡࢺ࠿ࡽᵓ⠏ࡉࢀࡓ PCPQ ࣔࢹࣝࢆ⏝࠸ࡿࡇ࡜࡛㸪࣮ࣜࣜࢫᚋࡢ㞀ᐖࢆண ࡍࡿࣔࢹ࡛ࣝ࠶ࡿ㸬PCPQ ࣔࢹ ࣝࡣ௨ୗࡢᡭ㡰࡛ᵓ⠏ࡉࢀࡿ㸬 Step1㸸 ྠ୍⤌⧊࡛⤊஢ࡋࡓ」ᩘࣉࣟࢪ࢙ࢡࢺࡢᕤ⛬⟶⌮⾲࡜㞀ᐖ⟶⌮⾲ࢆ ‽ഛࡍࡿ㸬 Step2㸸 ྛࣉࣟࢪ࢙ࢡࢺࡢ᭱⤊ⓗ࡞ PC ್ࢆィ ࡍࡿ㸬 Step3㸸 㞀ᐖ⟶⌮⾲࠿ࡽ࣮ࣜࣜࢫᚋࡢ㞀ᐖࡢ㔜せᗘࢆỴᐃࡍࡿ㸬 Step4㸸 ྛࣉࣟࢪ࢙ࢡࢺࡢ㞀ᐖẚ㔜ࢆィ⟬ࡍࡿ㸬 Step5㸸 X ㍈࡟ PC ್㸪Y ㍈࡟㞀ᐖẚ㔜ࡢ್ࢆࣉࣟࢪ࢙ࢡࢺࡈ࡜࡟ࣉࣟࢵࢺࡋ㸪 ࡑࡢࣉࣟࢵࢺࢆ⤖ࡪ㏆ఝ⥺ࢆồࡵࡿ㸬 ୖグࡢᡭ㡰࡛ồࡵࡽࢀࡓ㏆ఝ⥺ࡀ PCPQ ࣔࢹࣝ࡜࡞ࡿ㸬ḟ❶࡟࡚ᐇ㝿ࡢࣉࣟࢪ࢙ࢡ ࢺࡢᕤ⛬⟶⌮⾲ࢆ⏝࠸ࡓ PCPQ ࣔࢹࣝࡢᵓ⠏ࢆ♧ࡍ㸬 ⾲ 1 㸴ࣉࣟࢪ࢙ࢡࢺࡢヲ⣽ Table 1 Details of 6 projects. ࣉࣟࢪ࢙ࢡࢺྡ 㛤Ⓨᮇ㛫 ࢩࢫࢸ࣒✀㢮 A 㸷ࣨ᭶ ᩍ⫱࣏࣮ࢱࣝWeb࢔ࣉࣜࢣ࣮ࢩࣙࣥࢩࢫࢸ࣒ B 㸵ࣨ᭶ ᩍ⫱࣏࣮ࢱࣝWeb࢔ࣉࣜࢣ࣮ࢩࣙࣥࢩࢫࢸ࣒ C 㸴ࣨ᭶ ࢡࣛ࢖࢔ࣥࢺࢧ࣮ࣂࡢᤵᴗᨭ᥼ࢩࢫࢸ࣒ D E. 㸴ࣨ᭶. ࢡࣛ࢖࢔ࣥࢺࢧ࣮ࣂࡢᤵᴗᨭ᥼ࢩࢫࢸ࣒. 㸴ࣨ᭶. ࢡࣛ࢖࢔ࣥࢺࢧ࣮ࣂࡢᤵᴗᨭ᥼ࢩࢫࢸ࣒. F. 㸴ࣨ᭶. ࢡࣛ࢖࢔ࣥࢺࢧ࣮ࣂࡢᤵᴗᨭ᥼ࢩࢫࢸ࣒. 5. © 2011 Information Processing Society of Japan.

(6) ソフトウェアエンジニアリングシンポジウム 2011. 㻝㻜㻜 㻥㻜 㻤㻜 㻣㻜 㻢㻜 㻡㻜 㻠㻜 㻟㻜 㻞㻜 㻝㻜 㻜.  㸴ࣉࣟࢪ࢙ࢡࢺ࡟ࡼࡿ PCPQ ࣔࢹࣝࡢᵓ⠏౛ࢆ௨ୗ࡟♧ࡍ㸬 Step1㸸 ྠ୍⤌⧊ෆࡢ⤊஢ࡋࡓ㸴ࡘࡢࣉࣟࢪ࢙ࢡࢺࡢᕤ⛬⟶⌮⾲࡜㞀ᐖ⟶⌮⾲ࢆ⏝ ពࡍࡿ㸬 Step2㸸 㸴ࣉࣟࢪ࢙ࢡࢺࡢ᭱⤊ࡢ PC ್ࢆィ ࡍࡿ㸬⾲㸰࡟᭱⤊ⓗ࡞ PC ್ࢆ♧ࡍ㸬 Step3㸸 ࣮ࣜࣜࢫᚋࡢ㞀ᐖ⟶⌮⾲࠿ࡽ㸪ྛ㞀ᐖࡢ㔜せᗘࢆỴᐃࡍࡿ㸬⾲㸰࡟ 5 ẁ㝵ࣛ ࣥࢡ㸦SS㸪S㸪A㸪B㸪C㸧ࡢ㔜せᗘࢆ௜ຍࡉࢀࡓ㞀ᐖࡢ௳ᩘࢆ♧ࡍ㸬ࡇࡢ⤌ ⧊࡛ࡣ SS ࣛࣥࢡࡣࢩࢫࢸ࣒ࢲ࢘ࣥࣞ࣋ࣝࡢ㞀ᐖࢆព࿡ࡋ㸪S ࣛࣥࢡࡣ㔜せ ࡞ᶵ⬟ࡢḞዴࡸᛶ⬟ၥ㢟ࢆព࿡ࡍࡿ㸬A ࣛࣥࢡࡣ୰⛬ᗘࡢ㔜せ࡞ᶵ⬟࡛ࡢၥ 㢟㸪B ࣛࣥࢡࡣ࣮ࣘࢨ࢖ࣥࢱࣇ࢙࣮ࢫࡢၥ㢟㸪C ࣛࣥࢡࡣ㸪࣓ࢵࢭ࣮ࢪࡸྡ ⛠ࡢၥ㢟ࢆព࿡ࡍࡿ㸬ྛ㞀ᐖࡣ࣮ࣜࣜࢫᚋࡢ㞀ᐖ⟶⌮⾲࡛⟶⌮ࡉࢀ㸪ྛ㞀ᐖ ࡢ㔜せᗘࡣ⟶⌮⪅࡜㢳ᐈ࡟࡚Ỵᐃࡉࢀࡓ㸬 Step4㸸 㞀ᐖẚ㔜ࢆィ ࡍࡿ㸬㞀ᐖẚ㔜ࡣ㞀ᐖ௳ᩘ࡜㔜せᗘࡢ✚⟬࡛ồࡵࡿ㸬౛࠼ࡤ㸪 SS ࢆ㸳㸪S ࢆ㸲㸪A ࢆ㸱㸪B ࢆ㸰㸪C ࢆ㸯ࡢᐃᩘ࡟タᐃࡍࡿ࡜㸪ࣉࣟࢪ࢙ࢡ ࢺ A ࡢ㞀ᐖẚ㔜ࡣ 5*4 + 4*4 + 3*6 +2*9 +1*11=83 ࡜࡞ࡿ㸦⾲㸰㞀ᐖẚ㔜ཧ↷㸧㸬 ྠᵝ࡟㸪ࣉࣟࢪ࢙ࢡࢺ B ࡣ 66㸪ࣉࣟࢪ࢙ࢡࢺ C ࡣ 82㸪ࣉࣟࢪ࢙ࢡࢺ D ࡣ 88㸪ࣉࣟࢪ࢙ࢡࢺ E ࡣ 37㸪ࣉࣟࢪ࢙ࢡࢺ F ࡣ 28 ࡜࡞ࡿ㸬 Step5㸸 ྛࣉࣟࢪ࢙ࢡࢺࡢ᭱⤊ࡢ PC ್࡜㞀ᐖẚ㔜ࡢ㛵ಀࢆࣉࣟࢵࢺࡍࡿ㸬ᅗ㸲࡟㸪 㸴ࣉࣟࢪ࢙ࢡࢺࡢ㸰ࡘࡢ್ࡢ㛵ಀࢆࣉࣟࢵࢺࡋ㸪ࡑࢀࡽࢆ⤖ࡪ㏆ఝ⥺ࢆ♧ࡍ㸬 ௒ᅇ PCPQ ࣔࢹࣝࢆᵓ⠏ࡋࡓ⤌⧊ࡢ㏆ఝ⥺ࡣ௨ୗࡢᘧ࡜࡞ࡿ㸬  y = −0.0105X3 + 0.9069X2 −22.017X +189.69          ࣭࣭࣭㸦㸰㸧. ⾲ 2 PCPQ ࣔࢹࣝᵓ⠏࡟⏝࠸ࡿ್ Table 2 Parameter values of a PCPQ model 㞀ᐖ⟶⌮ ⾲࡟ࡼࡿ㞀ᐖ ࣞ࣋ࣝ SS A. 43. 83. S 4. A 4. 6. B 9. C 11 13. B. 28. 66. 2. 1. 6. 10. C. 35.4. 82. 2. 3. 19. 1. 1. D E. 44.4 26.3. 88 37. 10 3. 6 3. 4 2. 1 1. 0 2. F. 15.4. 28. 0. 0. 7. 3. 1. 㻯. 㻭. 㻠㻜. 㻮. 㻟㻜 㻞㻜. 䝥䝻䝆䜵䜽䝖㻌㻲. 㻱. 㻝㻜. 㼥㻌㻩㻌㻙㻜㻚㻜㻝㻜㻡㼤㻟㻌㻗㻌㻜㻚㻥㻜㻢㻥㼤㻞㻌㻙㻌㻞㻞㻚㻜㻝㻣㼤㻌㻗㻌㻝㻤㻥㻚㻢㻥 㻾㻞㻌㻩㻌㻜㻚㻥㻝㻟㻤 㻝㻜. 㻞㻜. 㻟㻜. 㻠㻜. ᫬㛫. 㻜 PC್. 㻝. 㻟. 㻡. 㻣. 㻥. 㻝㻝 㻝㻟 㻝㻡 㻝㻣 㻝㻥 㻞㻝 㻞㻟 㻞㻡. 㻡㻜. ᅗ 5 ࣉࣟࢪ࢙ࢡࢺ G ࡢ PC ್ࡢኚ໬ Figure 5 Change of process complexity of Project G. ௒ᅇࡢ⤌⧊࡛ࡢ 3&34 ࣔࢹࣝࡢỴᐃಀᩘࡣ  ࡛࠶ࡾ㸪᭷ពᛶࡀ㧗࠸࡜ุ ᩿ࡍࡿ㸬ࡲࡓ㸪㏆ఝ⥺ࡢồࡵ᪉ࡣ⤌⧊ẖ࡟ồࡵ᪉ࢆኚ᭦ࡍࡿᚲせࡀ࠶ࡿ㸬ࡇ ࡢ⤌⧊ࡢ 3&34 ࣔࢹࣝᘧ 

(7) ࡣከ㡯ᘧࡀỴᐃಀᩘࡀ㧗࠿ࡗࡓࡀ㸪௚⤌⧊࡛ࡣ⤌ ⧊ẖ࡟࠶ࡗࡓ㏆ఝ⥺ࢆ᳨ウࡍࡿᚲせࡀ࠶ࡿ㸬ࡘࡲࡾ㸪⤌⧊ẖ࡛ᕤ⛬⟶⌮⾲ࡸ 㞀ᐖ⟶⌮⾲ࡢ⟶⌮⢏ᗘࡢ␗࡞ࡾࡀ࠶ࡿࡓࡵ㸪⥺ᙧ㏆ఝ㸪ᑐᩘ㏆ఝ㸪ᣦᩘ㏆ఝ ࡞࡝ࡢᵝࠎ࡞㏆ఝ⥺ࡢ୰࡛᭱ࡶඃ఩ᛶࡢ㧗࠸㏆ఝ⥺ࡢồࡵ᪉ࢆ฼⏝ࡍࡿ஦ ࡛ 3&34 ࣔࢹࣝ 

(8) ࢆồࡵࡿᚲせࡀ࠶ࡿ㸬 4.4 PCPQ ࣔࢹࣝࢆ฼⏝ࡋࡓࣉࣟࢲࢡࢺရ㉁ࡢண  ᅗ㸲ࡢ PCPQ ࣔࢹࣝࢆ⏝࠸࡚㸪௚ࡢࣉࣟࢪ࢙ࢡࢺࡢࣉࣟࢲࢡࢺရ㉁ࡢண ࢆ⾜࠺㸬 ࣉࣟࢪ࢙ࢡࢺ G ࡣྠ୍⤌⧊ෆ࡛ᐇ᪋ࡉࢀࡓ e-learning ࢩࢫࢸ࣒㛤Ⓨࡢࣉࣟࢪ࢙ࢡࢺ࡛ ࠶ࡿ㸬ࡶࡕࢁࢇ㸪ࣉࣟࢪ࢙ࢡࢺ G ࡣ PCPQ ࣔࢹࣝᵓ⠏࡛฼⏝ࡋࡓ 6 ࣉࣟࢪ࢙ࢡࢺ࡜ࡣ ␗࡞ࡿ⊂❧ࡋࡓࣉࣟࢪ࢙ࢡࢺ࡛࠶ࡿ㸬ࣉࣟࢪ࢙ࢡࢺ G ࡢ PC ್ࡢ᥎⛣ࢆᅗ㸳࡟♧ࡍ㸬 13 㐌┠࡟㸪PC ್ࡣ 25.21 ࡟ᛴቑࡋࡓ㸬᪂ࡋ࠸సᴗࣉࣟࢭࢫࡀィ⏬࡟㏣ຍࡉࢀࡓ࡜⪃࠼ ࡽࢀࡿ㸬ࡇࡢ್ࢆᘧ(2)ࡢ PCPQ ࣔࢹࣝࡢ x ್࡬㐺⏝ࡍࡿ㸬㞀ᐖẚ㔜ࡣ 42.78 ࡜ィ⟬ࡉ ࢀࡿ㸬ࡋࡓࡀࡗ࡚㸪ࣉࣟࢪ࢙ࢡࢺ G ࡢ࣮ࣜࣜࢫᚋࡢ㞀ᐖⓎ⏕ࡣࣉࣟࢪ࢙ࢡࢺ E ࡼࡾከ ࡃ㸪ࣉࣟࢪ࢙ࢡࢺ B ࡼࡾᑡ࡞࠸ࡇ࡜ࡀண ࡉࢀࡓ㸬  ḟ࡟㸪ࣉࣟࢪ࢙ࢡࢺ G ࡢ࣮ࣜࣜࢫᚋࡢ㞀ᐖ⟶⌮⾲ࡼࡾᐇ㝿ࡢ㞀ᐖẚ㔜ࢆィ ࡋࡓ㸬 ࣮ࣜࣜࢫᚋࡢ㞀ᐖ௳ᩘࡣ 20 ௳࡛࠶ࡾ㸪SS ࡜ S ࣛࣥࢡࡢ㞀ᐖࡣ 0 ௳㸪A ࣛࣥࢡࡀ 8 ௳㸪 B ࣛࣥࢡࡀ 9 ௳㸪C ࣛࣥࢡࡀ 3 ௳࡛࠶ࡗࡓ㸬ࡇࢀࡽ࠿ࡽ㞀ᐖẚ㔜ࢆィ ࡋࡓ⤖ᯝ 45 ࡜ ࡞ࡗࡓ㸬PCPQ ࣔࢹ࡛ࣝண ࡋࡓ㞀ᐖẚ㔜ࡣ 42.78 ࡛࠶ࡾ㸪㏆࠸್࡜࡞ࡗࡓ㸬ᅗ㸲࡟™ ࡛ࣉࣟࢵࢺࡋࡓ⟠ᡤࡀ㸪ࣉࣟࢪ࢙ࢡࢺ G ࡢ᭱⤊ PC ್࡜㞀ᐖẚ㔜ࡢ್ࡢ㛵ಀࡢ఩⨨࡛ ࠶ࡿ㸬ࡘࡲࡾ㸪ࣉࣟࢪ࢙ࢡࢺ G ࡢ 13 㐌┠㸦඲ࣉࣟࢪ࢙ࢡࢺᮇ㛫ࡣ 25 㐌㸧ࡢ᫬Ⅼ࡛㸪 ࣮ࣜࣜࢫᚋࡢࣉࣟࢲࢡࢺࡢရ㉁ࡢண ࡀฟ᮶ࡓࡇ࡜࡟࡞ࡿ㸬ࡶࡋ㸪࣮ࣜࣜࢫᚋࡢࣉࣟ. ᘧ 

(9) ࡀࡇࡢ⤌⧊ࡢ 3&34 ࣔࢹࣝ࡜࡞ࡿ㸬ࡇࡢ᫬ồࡵࡓ㏆ఝ⥺ࡀ᭷ព࠿ࢆุ᩿ ࡍࡿ┠Ᏻ࡜ࡋ࡚Ỵᐃಀᩘࢆ⏝࠸ࡿ㸬ồࡵࡓ 3&34 ࣔࢹࣝࡢỴᐃಀᩘࡀᑠࡉࡍ ࡂࡿሙྜ㸪ࡇࡢ⤌⧊࡛ࡢ 3&34 ࣔࢹࣝࡣ᭷ពᛶࡀప࠸࡜࠸࠺ุ᩿ࢆᨭ᥼ࡍࡿ㸬. 㞀ᐖẚ㔜. 䝥䝻䝆䜵䜽䝖㻳. 㻡㻜. 㻰. ᅗ 4 PC ್࡜㞀ᐖẚ㔜ࡢ㏆ఝ⥺ Figure 4 An approximate value curve of relation between process complexities and specific gravities of failures.    x: ᭱⤊ࡢ PC ್. ᭱⤊ⓗ ࡞3&್. 㻼㻯್㻌㻙㻌㞀ᐖẚ㔜. 㻜.    y: 㞀ᐖẚ㔜ࡢ್. ࣉࣟࢪ ࢙ࢡࢺྡ. PC(t)_accumulate. 㞀ᐖẚ㔜. 4.3 㸴ࣉࣟࢪ࢙ࢡࢺ࡟ࡼࡿ PCPQ ࣔࢹࣝࡢᵓ⠏. 6. © 2011 Information Processing Society of Japan.

(10) ソフトウェアエンジニアリングシンポジウム 2011. 㻼㻯㻔㼠㻕㼋㼙㼛㼙㼑㼚㼠. 㻠㻜. 㻠㻜. 㻟㻜. 㻟㻜. 㻟㻜. 㻞㻜. 㻞㻜. 㻞㻜. 㻝㻜. 㻝㻜. 㻝㻜. 㻜. 㻜. 㻝. 㻢. 㻝㻝. 㻝㻢. 䝥䝻䝆䜵䜽䝖D. 㻝. 㻞㻝. 㻢. 㻝㻝. 㻝㻢. 㻞㻝. 㐌. 䝥䝻䝆䜵䜽䝖E. 㐌 㻼㻯㻔㼠㻕㼋㼙㼛㼙㼑㼚㼠. 㻼㻯㻔㼠㻕㼋㼙㼛㼙㼑㼚㼠. 㻜 㻝. 㻠㻜. 㻟㻜. 㻟㻜. 㻟㻜. 㻞㻜. 㻞㻜. 㻞㻜. 㻝㻜. 㻝㻜. 㻝㻜. 㻢. 㻝㻝. 㻝㻢. 䝥䝻䝆䜵䜽䝖C. 㻞㻝. 㐌. 㻝㻝. 㻝㻢. 㻞㻝. 䝥䝻䝆䜵䜽䝖F. 㐌. 㻠㻜. 㻜. 㻜. 㻝. 㻢. 㻼㻯㻔㼠㻕㼋㼙㼛㼙㼑㼚㼠. 㻠㻜. 㻜. ࡜ࣉࣟࢪ࢙ࢡࢺ D ࡢ▐㛫 PC ್ࡣࣉࣟࢪ࢙ࢡࢺᮇ㛫୰࡟࠾࠸࡚ᖖ࡟㧗࠸್ࢆ♧ࡍ㸬ࡘ ࡲࡾ㸪ࣉࣟࢪ࢙ࢡࢺ A ࡜ࣉࣟࢪ࢙ࢡࢺ D ࡢ㛤Ⓨᮇ㛫୰㸪ከࡃࡢࣉࣟࢭࢫࡣ୪⾜ᐇ⾜ࡉ ࢀ࡚࠸ࡿࡇ࡜ࡀศ࠿ࡿ㸬ࡲࡓ㸪ࣉࣟࢪ࢙ࢡࢺ A㸪B㸪E ࡣࣉࣟࢪ࢙ࢡࢺ⤊஢࡟ྥࡅ࡚▐ 㛫 PC ್ࡀῶᑡࡋ࡚࠸ࡿᵝᏊࡀぢཷࡅࡽࢀࡿࡀ㸪ࣉࣟࢪ࢙ࢡࢺ C㸪D ࡣ▐㛫 PC ್ࡀ཰ ᮰ࡏࡎ࡟ቑຍഴྥࡢࡲࡲࣉࣟࢪ࢙ࢡࢺ⤊஢ࢆ㏄࠼࡚࠸ࡿ஦ࡀࢃ࠿ࡿ㸬㏻ᖖࡣࣉࣟࢪ࢙ ࢡࢺ⤊஢࡟ྥࡅ࡚ከࡃࡢࣉࣟࢭࢫࡀ⤊஢ࡋ㸪▐㛫 PC ್ࡀῶᑡഴྥࢆ♧ࡍ࡟ࡶ㛵ࢃࡽ ࡎ㸪▐㛫 PC ್ࡀቑຍഴྥ࡛ࣉࣟࢪ࢙ࢡࢺ⤊஢ࢆ㏄࠼ࡓ㸬ࡘࡲࡾ㸪ࣉࣟࢪ࢙ࢡࢺ୰࡟ ㏣ຍసᴗ➼ࡀ཰᮰ࡏࡎ⣡ᮇࢆ㏄࠼ࡓࡇ࡜ࡀண᝿࡛ࡁࡿ㸬⾲㸰ࡢࣉࣟࢪ࢙ࢡࢺ C㸪D ࡢ 㞀ᐖẚ㔜ࡢ್ࡶ௚ࡢࣉࣟࢪ࢙ࢡࢺ࡟ẚ࡭࡚኱ࡁࡃ㸪▐㛫 PC ್ࡢࣉࣟࢪ࢙ࢡࢺ⤊஢᫬ ࡢῶᑡഴྥࡲࡓࡣቑຍഴྥ࠿ࡽࡶ᭱⤊ࣉࣟࢲࢡࢺࡢရ㉁ࢆண ࡍࡿࡇ࡜ࡶྍ⬟࡜⪃࠼ ࡿ㸬 5.2 ྍど໬ࢶ࣮ࣝ ▐㛫 PC ್ࡢ᥎⛣ࢆྍど໬ࡍࡿࢶ࣮ࣝࢆసᡂࡋࡓ㸬ᅗ㸵࡟ࣉࣟࢪ࢙ࢡࢺ A㸪D㸪E ࡢ ▐㛫 PC ್ࡢྍど໬⤖ᯝࢆ♧ࡍ㸬ྍど໬࡛ࡣࡦ࡜ࡘࡢࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࢆࡦ࡜ࡘ ࡢࣈࣟࢵࢡ࡜ࡋ࡚⾲⌧ࡍࡿ㸬ࡦ࡜ࡘࡢࣈࣟࢵࢡࡀ኱ࡁࡃ࡞ࢀࡤ」㞧࡞ࣉࣟࢭࢫࡢྍ⬟ ᛶࡀ࠶ࡾ㸪㏫࡟ᑠࡉ࡞ࣈࣟࢵࢡࡣ」㞧࡛࡞࠸ࣉࣟࢭࢫࢆ♧ࡍ㸬ᅗ㸵ࡢ X ㍈ࡣ᫬้ࢆ♧ ࡋ㸪Y ㍈ࡣᘧ(3)ࡢ L(t)ࡢ್ࢆ♧ࡋ㸪Z ㍈ࡣᘧ(3)ࡢ Nun_dev(t)ࢆ♧ࡍ㸬ࡘࡲࡾ㸪X ㍈᪉ྥ ࡟㛗࠸ࣈࣟࢵࢡࡣᐇ⾜ᮇ㛫ࡢ㛗࠸ࣉࣟࢭࢫ࡛࠶ࡾ㸪Y ㍈᪉ྥ࡟㛗࠸ࣈࣟࢵࢡࡣ୪⾜ᐇ ⾜ࡍࡿ௚ࡢࣉࣟࢭࢫࡀከ࠸ࡇ࡜ࢆ♧ࡋ㸪Z ㍈᪉ྥ࡟㛗࠸ࣈࣟࢵࢡࡣከࡃࡢ㛤Ⓨࢢ࣮ࣝ ࣉࡀ㛵୚ࡍࡿࣉࣟࢭࢫࢆព࿡ࡍࡿ㸬ࡲࡓⰍࡣྠࡌసᴗࢆ♧ࡋ࡚࠾ࡾ㸪⤊஢ࡋࡓసᴗࡀ ෌ᗘ㏣ຍసᴗ࡜ࡋ࡚㏣ຍࡉࢀࡓ➼ࡶᢕᥱྍ⬟࡜࡞ࡗ࡚࠸ࡿ㸬 ྍど໬ࢶ࣮ࣝ࠿ࡽࣉࣟࢪ࢙ࢡࢺ A ࡢᚋ༙࡛ࡣከࡃࡢࣉࣟࢭࢫࡀⓎ⏕ࡋࡓࡇ࡜ࡀศ࠿ ࡿ㸬ࡋ࠿ࡋ㸪ࣉࣟࢪ࢙ࢡࢺ A ࡣ X ㍈᪉ྥ࡟ࡣ▷࠸ࣈࣟࢵࢡࡀከ࠸㸬ࡘࡲࡾ㸪ྠ᫬ᐇ⾜ ࡍࡿࣉࣟࢭࢫࡣከ࠸ࡀ㸪ಶࠎࡢࣉࣟࢭࢫࡣẚ㍑ⓗࡍࡄ࡟⤊ࢃࡿసᴗ࡛࠶ࡿࡇ࡜ࡀࢃ࠿ ࡿ㸬ࡲࡓ㸪ࣉࣟࢪ࢙ࢡࢺ A ࡢࣈࣟࢵࢡࡣ Y ㍈᪉ྥ࡟ከࡃ✚ࡳ㔜࡞ࡗ࡚࠾ࡾ㸪ࣉࣟࢪ࢙ ࢡࢺ D,E ࡟ẚ࡭࡚୪⾜ᐇ⾜ࡍࡿࣉࣟࢭࢫࡀከ࠸㸬ࡇࡢࡼ࠺࡟㸪ࣉࣟࢪ࢙ࢡࢺࡈ࡜ࡢࣉ ࣟࢭࢫࡢ」㞧ࡉࡢ≉ᚩࢆ⾲⌧࡛ࡁࡿࢶ࣮࡛ࣝ࠶ࡿ㸬 5.3 ▐㛫 PC ್࡜㞀ᐖࡢ㔜せᗘ ▐㛫 PC ್࡜Ⓨ⏕ࡋࡓ㞀ᐖࡢ㔜せᗘࡢ㛵ಀ࡟ࡘ࠸࡚⪃ᐹࡍࡿ㸬ࣉࣟࢪ࢙ࢡࢺ A ࡜ࣉ ࣟࢪ࢙ࢡࢺ D ࡣ୧⪅࡜ࡶ⣼✚ࡢ PC ್ࡀ㧗ࡃ㸪㞀ᐖẚ㔜ࡢ್ࡶ኱ࡁ࠸㸦⾲㸰ཧ↷㸧㸬ఝ ࡓࡼ࠺࡞ࣉࣟࢪ࢙ࢡࢺࡢ≉ᚩࢆᣢࡘ࡜⪃࠼ࡽࢀࡿࡀ㸪ᅗ㸵࡟♧ࡍࡼ࠺࡟㸪ࣉࣟࢭࢫࡀ 」㞧࡟࡞ࡗࡓせᅉࡢࣉࣟࢭࢫࡢ✀㢮ࡀ␗࡞ࡿ㸬ࣉࣟࢪ࢙ࢡࢺ A ࡣ⣽࠿࡞ࣉࣟࢭࢫࡀከ ࡃⓎ⏕ࡋࡓࡢ࡟ᑐࡋ㸪ࣉࣟࢪ࢙ࢡࢺ D ࡣẚ㍑ⓗᮇ㛫ࡢ㛗࠸኱ࡁ࡞ࣉࣟࢭࢫࡀⓎ⏕ࡋࡓ㸬 ≉࡟㸪ࡦ࡜ࡘࡢࣉࣟࢭࢫࡀ Z ㍈᪉ྥ࡟㛗࠸ࡢࡀ≉ᚩ࡛࠶ࡿ㸬ࡘࡲࡾ㸪ࡦ࡜ࡘࡢࣉࣟࢭ ࢫ࡟」ᩘࡢ㛤Ⓨࢢ࣮ࣝࣉࡀ࠿࠿ࢃࡿࣉࣟࢭࢫࡀⓎ⏕ࡋࡓ࡜⪃࠼ࡽࢀࡿ㸬࡜ࡶ࡟ PC ್ ࡀ኱ࡁ࠸ࣉࣟࢪ࢙ࢡࢺ࡛࠶ࡿࡀ㸪ࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࡢ≉ᚩࡀ␗࡞ࡿ㸬. 㻼㻯㻔㼠㻕㼋㼙㼛㼙㼑㼚㼠. 㻼㻯㻔㼠㻕㼋㼙㼛㼙㼑㼚㼠. 㻠㻜. 㻝. 㻢. 㻝㻝. 㻝㻢. 㻞㻝. 㻞㻢. 䝥䝻䝆䜵䜽䝖A. 㻟㻝. 㻟㻢. 㐌. 㻝. 㻢. 㻝㻝. 㻝㻢. 䝥䝻䝆䜵䜽䝖B. 㻞㻝. 㻞㻢. 㐌. ᅗ 6 㸴ࣉࣟࢪ࢙ࢡࢺࡢ▐㛫 PC ್ࡢ᥎⛣ Figure 6 Changes of values of process complexities (moment) of 6 projects ࢲࢡࢺရ㉁ࢆࣉࣟࢪ࢙ࢡࢺ E ⛬ᗘ࡟ྥୖࡉࡏࡓ࠸࡞ࡽࡤ㸪13 㐌┠࡟ィ⏬ࡉࢀࡓ㏣ຍస ᴗࡢぢ┤ࡋ➼࡟ࡼࡿィ⏬ࡢ෌タィࢆᐇ᪋ࡍࡿ➼㸪⟶⌮సᴗࡢ┠Ᏻ࡜࡞ࡿ㸬. 5. ⪃ᐹ 5.1 ▐㛫 PC ್. PCPQ ࣔࢹࣝࡢ PC ್ࡣ࣮࣋ࢫࣉࣟࢭࢫ࡜ࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࡢࡍ࡭࡚ࡢ⣼✚࠿ࡽ ィ ࡋࡓ㸬ࡇࢀࡼࡾ㸪ࣉࣟࢭࢫࡢほⅬ࠿ࡽࣉࣟࢲࢡࢺࡢရ㉁ࢆண ࡋ㸪ࣉࣟࢪ࢙ࢡࢺ ඲యࡢ≉ᚩࢆ♧ࡍࡇ࡜ࡀ࡛ࡁࡓ㸬ࡋ࠿ࡋ㸪㸯ࡘࡢࣉࣟࢪ࢙ࢡࢺ㐍⾜୰࡟࠾࠸࡚ࡶࣉࣟ ࢭࢫࡢ」㞧ࡉࡣ㝶᫬ኚ໬ࡍࡿ㸬౛࠼ࡤ㸪๓ࣂ࣮ࢪࣙࣥࡢࢩࢫࢸ࣒࡟㞀ᐖࡀⓎ⏕ࡋ㞀ᐖ ᑐᛂసᴗࡀᛴ㑉㏣ຍࡉࢀࡓ᫬ᮇࡣ୍᫬ⓗ࡟ PC ್ࡀቑຍࡍࡿࡀ㸪㞀ᐖᑐᛂࡀ཰᮰ࡍࡿ ࡜ PC ್ࡣඖ࡟ᡠࡿ㸬ࡇࡢࡼ࠺࡞ PC ್ࡢ᫬⣔ิኚ໬ࢆ♧ࡍ▐㛫 PC ್ࢆ௨ୗ࡟♧ࡍ㸬. PC( t ) _ moment =. N ( t _ moment ).  ( Num _ dev i =1. (t )i. × L( t ) i × term( t ) i ). ࣭࣭࣭㸦㸱㸧. PC(t)_moment:. ᫬้ t ࡢࣉࣟࢭࢫࡢ」㞧ࡉ㸦⤊஢ࣉࣟࢭࢫࢆྵࡲ࡞࠸㸧. N(t_moment):. ᫬้ t ࡢ✌ാ୰ࡢࣉࣟࢭࢫ⥲ᩘ㸦⤊஢ࣉࣟࢭࢫࢆྵࡲ࡞࠸㸧.  ᇶᮏⓗ࡟ PC(t)࡜ྠࡌᘧ࡛࠶ࡿࡀ㸪ࣃ࣓࣮ࣛࢱ N(t_moment)ࡢࣉࣟࢭࢫࡢ⥲ᩘ࡟⤊஢ࡋࡓ ࣉࣟࢭࢫࢆྵࡲ࡞࠸㸬ࡘࡲࡾ㸪᫬้ t ࡟✌ാࡋ࡚࠸ࡿࣉࣟࢭࢫࡔࡅࢆᑐ㇟࡟ィ ࡍࡿ㸬 ࡇࢀ࡟ࡼࡾ㸪᫬⣔ิ࡟ኚ໬ࡍࡿ▐㛫 PC ್ࢆồࡵࡿࡇ࡜ࡀ࡛ࡁࡿ㸬  ▐㛫 PC ್ࢆ๓❶ࡢ㸴ࣉࣟࢪ࢙ࢡࢺ࡟㐺⏝ࡋࡓ⤖ᯝࢆᅗ㸴࡟♧ࡍ㸬ࣉࣟࢪ࢙ࢡࢺ A. 7. © 2011 Information Processing Society of Japan.

(11) ソフトウェアエンジニアリングシンポジウム 2011 ࣝࢆసᡂࡍࡿࡇ࡜࡛㸪࣮ࣜࣜࢫᚋ࡟Ⓨ⏕ࡍࡿ㞀ᐖࡢ✀㢮ࢆண ࡛ࡁࡿྍ⬟ᛶࡶ♧၀࡛ ࡁࡓ㸬௒ᚋࡣ PCPQ ࣔࢹࣝࢆ᭦࡟ホ౯ࡍࡿࡓࡵ࡟㸪௚ࡢከࡃࡢ⤌⧊࡛ PCPQ ࣔࢹࣝࢆ ᵓ⠏ࡋ㸪⤌⧊ࡈ࡜ࡢࣉࣟࢭࢫ࡜ࣉࣟࢲࢡࢺࡢ㛵ಀࢆㄪᰝࡍࡿணᐃ࡛࠶ࡿ㸬. Y Y. Y. Z Z. ㅰ㎡ ᮏ◊✲ࡢ୍㒊ࡣᩥ㒊⛉Ꮫ┬⛉Ꮫ◊✲㈝ᇶ┙◊✲(C)22500027㸪࠾ࡼࡧᩥ㒊⛉Ꮫ ┬⛉Ꮫ◊✲㈝ᇶ┙◊✲(C)21500045 ࡢ⿵ຓࢆཷࡅࡓ㸬. X. Z. ཧ⪃ᩥ⊩. X. X ࣉࣟࢪ࢙ࢡࢺ A. ࣉࣟࢪ࢙ࢡࢺ D. 1) Walker Royce.: Software Project Management: A unified Framework, Addison-Wesley Professional, USA(1998). 2) ᾏ㇂἞ᙪ㸪໭⃝┤ᖾ㸪㛗⏣᫭㸪ᾏᑼ㈼஧ : 㢮ఝ᪤Ꮡࢩࢫࢸ࣒ࡢ᝟ሗࢆ฼⏝ࡋࡓせồ⋓ᚓᨭ᥼ ࢩࢫࢸ࣒ࡢ㛤Ⓨ࡜ホ౯, 㟁Ꮚ᝟ሗ㏻ಙᏛ఍ㄽᩥㄅ, Vol.J93-D, No.10, pp.1836-1850(2010). 3) ୰㇂ከဢᏊ㸪⸨㔝᫭ᘏ : ࣮ࣟࣝ࡟╔┠ࡋࡓࣅࢪࢿࢫ㡿ᇦ࡟࠾ࡅࡿせồ⋓ᚓᡭἲ RODAN ࡢᥦ ᱌, ᝟ሗฎ⌮Ꮫ఍ㄽᩥㄅ, Vol.48, No.8, pp.2534-2550(2007). 4) Guide to the Software Engineering Body of Knowledge (SWEBOK) , http://www.computer.org/portal/web/swebok 5) Humphrey Watts, S.: Managing the software process. Addison-Wesley Professional, USA(1989). 6) ᆏᮏၨྖ㸪⏣୰ᩄᩥ㸪ᴋᮏ┿஧㸪ᯇᮏ೺୍㸪⳥㔝஽ 㸸฼┈ண ࡟ᇶ࡙ࡃࢯࣇࢺ࢙࢘࢔ࣉࣟࢭ ࢫᨵၿࡢヨࡳ 㸪㟁Ꮚ᝟ሗ㏻ಙᏛ఍ㄽᩥㄅ㸪Vol.J83-D1 㸪No.7 㸪pp.740-748(2000). 7) Cugola, G.: Tolerating Deviations in Process Support Systems via Flexible Enactment of Process Models , IEEE Transaction of Software Engineering, Vol.24, No.11, pp.982-1001(1998). 8) Fuggetta, A. and Ghezzi, C.: State of the art and open issues in process-centered software engineering environments, Journal of Systems and Software, Vol.26, No.1 pp.53-60(1994). 9) Garcia, F., Ruiz, F., Piattini, M.: Definition and empirical validation of metrics for software process models. Proceedings of the 5th International Conference Product Focused Software Process Improvement, pp.146-158(2004). 10) Kruchten, R.: The Rational Unified Process, Addison-Wesley Professional, USA(2000). 11) Manzoni, L.V., Price, R.T.: Identifying extensions required by RUP (rational unified process) to comply with CMM (capability maturity model) levels 2 and 3, IEEE Transactions of Software Engineering , Vol.29 , No.2, pp.181-192(2003). 12) 㟷ᮌ ಇᶞ㸪ᒣ⏣ ⱱ :ࣉࣟࢭࢫࢹ࣮ࢱ࡟ᇶ࡙ࡃࢯࣇࢺ࢙࢘࢔㛤Ⓨࣉࣟࢪ࢙ࢡࢺࡢရ㉁ᣦྥᆺ ᐃ㔞ⓗホ౯ἲ࡟㛵ࡍࡿ⪃ᐹ (୙☜ᐇ࡞≧ἣ࡟࠾ࡅࡿពᛮỴᐃࡢ⌮ㄽ࡜ᛂ⏝) ᩘ⌮ゎᯒ◊✲ᡤㅮ ✲㘓 ,1589 ,pp215-221(2008) 13) Obana, M. Hanakawa, N. Yoshida N. Iida, H.: Process Fragment Based Process Complexity with Workflow Management Tables. International Workshop on Empirical Software Engineering in Practice, pp.7-12(2010). 14) Bill,Curtis. Girish, V, Seshagiri. Donald, Reifer. Iraj, Hirmanpour and Gargi, Keeni.: The Case for Quantitative Process Management, IEEE Software, vol.25 , No.3, pp.24-28(2008).. ࣉࣟࢪ࢙ࢡࢺ E. ᅗ 7 ▐㛫 PC ್ࡢྍど໬ Figure 7 Visualized images of changing process complexities.. ࡑࡇ࡛㸪⾲㸰ࡢⓎ⏕ࡋࡓ㞀ᐖࡢ㔜せᗘ࡟╔┠ࡍࡿ㸬ࣉࣟࢪ࢙ࢡࢺ A ࡢ㞀ᐖⓎ⏕௳ᩘ ࡣከ࠸ࡀ㸪SS ࢡࣛࢫ㸦᭱㔜せ㸧ࡢ㞀ᐖࡣ 4 ௳࡛㸪B㸪C ࢡࣛࢫࡢ㞀ᐖࡀ 20 ௳࡜㔜せᗘ ࡢప࠸㞀ᐖࡀከ࠸㸬཯ᑐ࡟ࣉࣟࢪ࢙ࢡࢺ D ࡛ࡣ SS ࢡࣛࢫࡀ 10 ௳࡛㸪B㸪C ࢡࣛࢫࡀ ࢃࡎ࠿ 1 ௳࡛࠶ࡿ㸬ࡍ࡞ࢃࡕ㸪ࣉࣟࢪ࢙ࢡࢺ A ࡛ࡣ㞀ᐖ௳ᩘࡣከ࠸ࡀ㍍ᗘ࡞㞀ᐖࡀ୺ ࡛࠶ࡾ㸪ࣉࣟࢪ࢙ࢡࢺ D ࡛ࡣ㞀ᐖ௳ᩘࡣከࡃ࡞࠸ࡀ㔜せ࡞㞀ᐖࡀከࡃⓎ⏕ࡋࡓ㸬ࡇࡢ 㞀ᐖࡢ≉ᚩࢆᅗ㸵࡜ẚ㍑ࡍࡿ࡜㸪ᑠࡉ࡞ࣉࣟࢭࢫࡀ㔜࡞ࡿሙྜ㸪㍍ᗘ࡞㞀ᐖࡢⓎ⏕ࡀ ከࡃ㸪኱ࡁ࡞ࣉࣟࢭࢫ㸪≉࡟」ᩘࢢ࣮ࣝࣉࡀ㛵ࢃࡿࣉࣟࢭࢫࡀⓎ⏕ࡍࡿሙྜ㸪㔜኱࡞ 㞀ᐖࡀⓎ⏕ࡍࡿ࡜⪃࠼ࡽࢀࡿ㸬ࡇࡢࡼ࠺࡟㸪 PC ್࠿ࡽࡣ඲యࡢ㞀ᐖࡋ࠿ண ࡛ࡁ࡞ ࠸ࡀ㸪▐㛫 PC ್ࡣⓎ⏕ࡍࡿ㞀ᐖࣞ࣋ࣝࡢ✀㢮ࢆண ࡛ࡁࡿྍ⬟ᛶࡀ࠶ࡿ࡜⪃࠼ࡿ㸬. 6. ࠾ࢃࡾ࡟ ᮏ✏࡛ࡣ㸪ࣉࣟࢭࢫࡢ」㞧ࡉ࡜ࣉࣟࢲࢡࢺࡢရ㉁ࡢ㛵ಀࢆ♧ࡍ PCPQ ࣔࢹࣝࡢᵓ⠏ ᪉ἲࢆᥦ᱌ࡋࡓ㸬PCPQ ࣔࢹࣝࡣ」ᩘࣉࣟࢪ࢙ࢡࢺࡢ᭱⤊ⓗ࡞ PC ್࡜㞀ᐖẚ㔜ࡢ್ࢆ ⏝ពࡋ㸪ࡑࢀࡽࢆ㏆ఝ⥺ࢆồࡵࡿ஦࡛ࣔࢹࣝࢆᵓ⠏ࡍࡿ㸬PC ್ࡣྛ⤌⧊ࡢᕤ⛬⟶⌮⾲ ࡟グ㏙ࡉࢀ࡚࠸ࡿ࣮࣋ࢫࣉࣟࢭࢫ࡜ࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫ࠿ࡽィ ࡉࢀࡿ㸬ࡲࡓ㸪㞀 ᐖẚ㔜ࡣྛ⤌⧊࡛⏝࠸ࡽࢀ࡚࠸ࡿ㞀ᐖ⟶⌮⾲ࡢ㞀ᐖ௳ᩘ࡜㔜せᗘࣞ࣋ࣝ࠿ࡽ⟬ฟࡉࢀ ࡿ㸬ᕤ⛬⟶⌮⾲ࡢ⟶⌮㡯┠ࡢ⢏ᗘࡸ㞀ᐖࡢ㔜せᗘࣞ࣋ࣝࡢỴࡵ᪉ࡣ⤌⧊ࡈ࡜࡟␗࡞ࡿ ࡀ㸪PCPQ ࣔࢹࣝࡣ⤌⧊ẖ࡟ᵓ⠏ࡉࢀࡿࡓࡵ㸪≉ᐃࡢ⟶⌮᪉ἲ࡟౫Ꮡࡋ࡞࠸ỗ⏝ⓗ࡞ ࣔࢹࣝᵓ⠏᪉ἲ࡛࠶ࡿ㸬ᮏᥦ᱌ࢆ⏘ᴗ⏺࡟࠾ࡅࡿྠ୍⤌⧊ෆࡢ㸵ࡘࡢࣉࣟࢪ࢙ࢡࢺ࡟ 㐺⏝ࡋࡓ㸬6 ࡘࡢࣉࣟࢪ࢙ࢡࢺ࡛ PCPQ ࣔࢹࣝࢆᵓ⠏ࡋ㸪ྠ୍⤌⧊ࡢูࣉࣟࢪ࢙ࢡࢺ ࡟࠾࠸࡚ࣉࣟࢭࢫࡢ」㞧ࡉ࠿ࡽ࣮ࣜࣜࢫᚋࡢࣉࣟࢲࢡࢺࡢရ㉁ࢆண ࡍࡿࡇ࡜ࡀ࡛ࡁ ࡓ㸬ࡲࡓ㸪ࣉࣟࢪ࢙ࢡࢺᐇ᪋୰ࡢࣉࣟࢭࢫࡢ」㞧ࡉࡢ᫬⣔ิኚ໬ࢆ♧ࡍ▐㛫 PC ್ࡶ ᥦ᱌ࡋࡓ㸬ࣇࣛࢢ࣓ࣥࢺࣉࣟࢭࢫࡢ㔜࡞ࡾ᪉ࡸ኱ࡁࡉࡀࣅࢪࣗ࢔ࣝ࡟☜ㄆ࡛ࡁࡿࢶ࣮. 8. © 2011 Information Processing Society of Japan.

(12)

Figure 2 Extracting fragment process from configuration of a workflow management table
Figure 3 Changes of values of process complexities (moment version) of 6 projects
Figure 4 An approximate value curve of  relation between process complexities and
Figure 6 Changes of values of process complexities (moment) of 6 projects
+2

参照

関連したドキュメント

This study, as a case study of urban plan system of Pudong large-scale development project in Shanghai, China, examines how land use control has been planned by urban plan system

主として、自己の居住の用に供する住宅の建築の用に供する目的で行う開発行為以外の開

This product includes software developed by the OpenSSL Project for use in the OpenSSL

In particular, building on results of Kifer 8 and Kallsen and K ¨uhn 6, we showed that the study of an arbitrage price of a defaultable game option can be reduced to the study of

Other important features of the model are the regulation mechanisms, like autoregulation, CO 2 ¼ reactivity and NO reactivity, which regulate the cerebral blood flow under changes

In what follows, we will combine the Hardy-Littlewood k-tuple conjecture with extreme value statistics to better predict the sizes of maximal gaps between prime k-tuples of any

NIST - Mitigating the Risk of Software Vulnerabilities by Adopting a Secure Software Development Framework (SSDF).

12月 米SolarWinds社のIT管理ソフトウェア(orion platform)の