首页> 外文会议>Frontiers of combining systems >A Combination of Rewriting and Constraint Solving for the Quantifier-Free Interpolation of Arrays with Integer Difference Constraints
【24h】

A Combination of Rewriting and Constraint Solving for the Quantifier-Free Interpolation of Arrays with Integer Difference Constraints

机译:具有整数差值约束的数组的无量词插值的重写和约束求解的组合

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

摘要

The use of interpolants in model checking is progressively gaining importance. The application of encodings based on the theory of arrays, however, is limited by the impossibility of deriving quantifier-free interpolants in general. To overcome this problem, we have recently proposed a quantifier-free interpolation solver for a natural variant of the theory of arrays. However, arrays are usually combined with fragments of arithmetic over indexes in applications, especially those related to software verification. In this paper, we propose a quantifier-free interpolation solver for the variant of arrays considered in previous work when combined with integer difference logic over indexes.
机译:在模型检查中使用内插法变得越来越重要。然而,基于阵列理论的编码的应用通常受到不可能生成无量词插值的限制。为了克服这个问题,我们最近针对阵列理论的自然变体提出了一种无量词的插值求解器。但是,数组通常与应用程序中索引的算术片段(尤其是与软件验证有关的片段)结合在一起。在本文中,我们针对与索引上的整数差值逻辑结合使用的先前工作中考虑的数组变体,提出了一种无量词的插值求解器。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号