検証容易性 :: システム開発文書品質研究会

用語wiki検証容易性

Page Top

参考定義 anchor.png

Page Top

IEEE std 830-1998 (Verifiable) anchor.png

An SRS is verifiable if, and only if, every requirement stated therein is verifiable. A requirement is verifiable if, and only if, there exists some finite cost-effective process with which a person or machine can check that the software product meets the requirement. In general any ambiguous requirement is not verifiable.

Nonverifiable requirements include statements such as "works well," "good human interface," and "shall usually happen." These requirements cannot be verified because it is impossible to define the terms "good," "well," or "usually." The statement that "the program shall never enter an infinite loop" is nonverifiable because the testing of this quality is theoretically impossible.

An example of a verifiable statement is

Output of the program shall be produced within 20 s of event x 60% of the time; and shall be produced within 30 s of event x 100% of the time.

This statement can be verified because it uses concrete terms and measurable quantities.

If a method cannot be devised to determine whether the software meets a particular requirement, then that requirement should be removed or revised.

Page Top

IEEE std 830-1998 和訳例 anchor.png

SRSに含まれるすべての要求に対して有限のコストで評価可能な手続きが存在して検証できること
(月刊「ビジネスコミュニケーション」((株)ビジネスコミュニケーション社)の「要求工学」第3回「要求仕様」による)


トップ   凍結 差分 バックアップ 複製 名前変更 リロード   ページ新規作成 全ページ一覧 単語検索 最新ページの一覧   ヘルプ   最新ページのRSS 1.0 最新ページのRSS 2.0 最新ページのRSS Atom
Counter: 2074, today: 1, yesterday: 0
Last-modified: 2013-07-22 (月) 04:59:31 (JST) (1889d) by ShioyaAtsuko