首页> 外文学位 >Automating and evaluating assume-guarantee reasoning.
【24h】

Automating and evaluating assume-guarantee reasoning.

机译:自动化和评估假设保证推理。

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

摘要

Software systems are taking on an increasingly important role in society and are being used in critical applications where their failure could result in human casualties or substantial economic loss. Thus, it is important to validate software systems to ensure their quality. One technique for validating software systems is finite-state verification, in which a finite model of a system is analyzed to ensure that it satisfies a property that specifies a desired system behavior. Unfortunately, the cost of finite-state verification can be exponential in the size of the system being analyzed.; Compositional analysis is a "divide-and-conquer" approach to verification that aims to reduce the cost of verification. One proposed compositional technique is assume-guarantee reasoning. With this technique a system is decomposed into subsystems and these subsystems are analyzed individually. By composing the results of these analyses, it can be determined whether or not a system satisfies a property. Because each subsystem is smaller than the whole system, analyzing each subsystem individually may reduce the overall cost of verification. Often the behavior of a subsystem is dependent on the subsystems with which it interacts, and thus it is usually necessary to provide assumptions about the environment in which a subsystem executes. Because developing assumptions has been a difficult manual task, the evaluation of assume-guarantee reasoning has been limited.; In this thesis we present an algorithm that automatically learns assumptions. Using this algorithm, we undertook a study to determine if assume-guarantee reasoning provides an advantage over monolithic verification. Using two different verifiers, we considered all two-way decompositions for a set of systems and properties. By increasing the number of repeated tasks in these systems, we evaluated the decompositions as they were scaled. We found that in only a few cases can assume-guarantee reasoning verify properties on larger systems than monolithic verification can and in these cases the systems that can be analyzed are only a few sizes larger. Although these results are discouraging, they provide insight about research directions that should be pursued and highlight the importance of experimental evaluation.
机译:软件系统在社会中扮演着越来越重要的角色,并被用于一些可能导致人员伤亡或重大经济损失的关键应用中。因此,重要的是验证软件系统以确保其质量。验证软件系统的一种技术是有限状态验证,其中分析系统的有限模型以确保其满足指定所需系统行为的属性。不幸的是,有限状态验证的成本可能在被分析系统的大小上成指数增长。成分分析是一种“分而治之”的验证方法,旨在降低验证成本。一种提出的合成技术是假设保证推理。使用这种技术,系统可以分解为子系统,并且可以分别分析这些子系统。通过组合这些分析的结果,可以确定系统是否满足特性。因为每个子系统都比整个系统小,所以单独分析每个子系统可以减少验证的总成本。子系统的行为通常取决于与之交互的子系统,因此通常有必要提供有关子系统执行环境的假设。由于发展假设是一项艰巨的手动任务,因此对假设保证推理的评估受到限制。在本文中,我们提出了一种自动学习假设的算法。使用此算法,我们进行了一项研究,以确定假设担保推理是否比整体验证更具优势。使用两个不同的验证器,我们考虑了一组系统和属性的所有双向分解。通过增加这些系统中重复任务的数量,我们评估了分解的规模。我们发现,在少数情况下,与单片验证相比,可以在较大的系统上假设保证推理的验证属性,并且在这些情况下,可以分析的系统只有几个大小。尽管这些结果令人沮丧,但它们提供了有关应遵循的研究方向的见解,并突出了实验评估的重要性。

著录项

  • 作者

    Cobleigh, Jamieson M.;

  • 作者单位

    University of Massachusetts Amherst.;

  • 授予单位 University of Massachusetts Amherst.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2007
  • 页码 167 p.
  • 总页数 167
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号