• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>Software engineering and formal methods >Finding Boundary Elements in Ordered Sets with Application to Safety and Requirements Analysis
【24h】

Finding Boundary Elements in Ordered Sets with Application to Safety and Requirements Analysis

机译：在有序集中查找边界元素及其在安全性和需求分析中的应用

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The motivation for this study comes from various sources such as parametric formal verification, requirements engineering, and safety analysis. In these areas, there are often situations in which we are given a set of configurations and a property of interest with the goal of computing all the configurations for which the property is valid. Checking the validity of each single configuration may be a costly process. We are thus interested in reducing the number of such validity queries. In this work, we assume that the configuration space is equipped with a partial ordering that is preserved by the property to be checked. In such a case, the set of all valid configurations can be effectively represented by the set of all maximum valid (or minimum invalid) configurations w.r.t. the ordering. We show an algorithm to compute such boundary elements. We explain how this general setting applies to consistency and redundancy checking of requirements and to finding minimum cut-sets for safety analysis. We further discuss various heuristics and evaluate their efficiency, measured primarily by the number of validity queries, on a preliminary set of experiments.
机译：这项研究的动机来自各种来源，例如参数形式验证，需求工程和安全分析。在这些区域中，通常情况下，我们会得到一组配置和一个感兴趣的属性，目的是计算该属性有效的所有配置。检查每个单个配置的有效性可能是一个昂贵的过程。因此，我们对减少此类有效性查询的数量感兴趣。在这项工作中，我们假设配置空间配备了部分顺序，该顺序由要检查的属性保留。在这种情况下，所有有效配置的集合可以由所有最大有效（或最小无效）配置的集合有效地表示。订购。我们展示了一种计算此类边界元素的算法。我们将说明此一般设置如何应用于需求的一致性和冗余检查，以及如何找到用于安全分析的最小割集。我们将在一组初步的实验中进一步讨论各种启发式方法，并评估其效率（主要通过有效性查询的数量来衡量）。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号