首页> 外文会议>24th international conference on computers and their applications 2009 >SUPER-RECURSIVE ALGORITHMS IN TESTING DISTRIBUTED SYSTEMS
【24h】

SUPER-RECURSIVE ALGORITHMS IN TESTING DISTRIBUTED SYSTEMS

机译:测试分布式系统中的超递归算法

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we show necessity of super-recursive algorithms for software testing and analyze how super-recursive algorithms can make testing more powerful, exact and efficient. The main goal is to find what kinds of testing lead to correct reliable software, to elaborate general principles for efficient testing software, and to make testing more an engineering discipline than an art. We introduce a new technological schema for testing based on super-recursive algorithms, compare testing abilities of recursive and super-recursive algorithms and demonstrate that testing software based on super-recursive algorithms can estimate much more properties of software than testing software based on recursive algorithms.
机译:在本文中,我们展示了用于软件测试的超递归算法的必要性,并分析了超递归算法如何使测试更加强大,准确和高效。主要目标是找出哪种测试可以导致正确的可靠软件,详细说明有效测试软件的一般原则,并使测试更多地是工程学科而不是艺术。我们介绍了一种基于超递归算法的测试新技术方案,比较了递归算法和超递归算法的测试能力,并证明与基于递归算法的测试软件相比,基于超递归算法的测试软件可以估计更多的软件属性。 。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号