跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:文本讨论软件测试的随机最优停止问题,成本权衡本身不足以归入所列经济计量方向。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
S. R. Dalal
C. L. Mallows

何时应停止软件测试?

研究问题
在继续测试成本与发布后残留缺陷损失之间如何权衡,才能确定软件模块的最优测试停止时点,并利用已发现缺陷信息?
方法与思路
作者设定缺陷总数的 Poisson–gamma 模型与相互独立的发现时间,通过动态规划研究停止规则,并讨论多类缺陷扩展。
材料陈述的贡献
摘要称,特定成本及发现时间条件下最优规则形式简单;固定缺陷强度时按固定时间停止,并给出大强度下的渐近规则。
阅读关注点
应核对成本定义、先验与发现时间分布的已知性假设,以及简单规则所需条件、渐近近似范围和多类缺陷扩展。
阅读边界
仅据版本未注明的 OpenAlex 索引摘要;公式排版含歧义,需查原 PDF;结论依赖已知成本、分布及缺陷发现时间独立性等设定。

原文摘要

We derive an optimal rule for stopping the testing of a module of software prior to release, based on the trade-off between the cost of continued testing and the expected losses due to any bugs that remain in the released code. Our economic assumptions are that testing costs are perfectly predictable, but of arbitrary form f(t), and that the costs of fixing a bug, both during testing and subsequent to release, are known constants. Our stochastic assumptions are as follows: (a) The total number of bugs in the module (N) is unknown; (b) N has a Poisson distribution with a mean λ that is distributed randomly (across modules) according to a known gamma distribution; (c) given a particular bug, the time it takes to find it during testing is random, with a known distribution G of arbitrary form; and (d) the lifetimes of different bugs are independent. With these assumptions, we find conditions on f and G that ensure that the optimal stopping rule has a simple form, which can be found by a dynamic programming argument. The central condition is that f(G -1(1 - e-y )) is convex while finite. When N is Poisson with λ fixed, the optimal strategy is a fixed time stopping rule. When λ is variable and large with high probability, the optimum rule approaches a simple asymptotic form, namely, stop as soon as k, the observed number of bugs, satisfies k ≤ f′(t)G(t)/cG′(t), where c is the difference between the cost of fixing a bug during testing and the cost incurred by finding it after release. Further, the number of bugs remaining has a Poisson limiting distribution with mean f′(t)(1 - G(t))/cG′(t). We extend the theory to allow for several classes of bugs with different characteristics. We suggest that graphical display of the asymptotic stopping rule, for a selection of values of the cost parameters involved, may prove helpful to persons faced with the problem of managing software development. An example of such a display is given.

笔记与分组
相关领域论文