首页> 外文期刊>Science of Computer Programming >Constraint specialisation in Horn clause verification
【24h】

Constraint specialisation in Horn clause verification

机译:Horn子句验证中的约束专业化

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

摘要

We present a method for specialising the constraints in constrained Horn clauses with respect to a goal. We use abstract interpretation to compute a model of a query-answer transformed version of a given set of clauses and a goal. The constraints from the model are then used to compute a specialised version of each clause. The effect is to propagate the constraints from the goal top-down and propagate answer constraints bottom-up. The specialisation procedure can be repeated to yield further specialisation. The approach is independent of the abstract domain and the constraint theory underlying the clauses. Experimental results on verification problems show that this is an effective transformation, both in our own verification tools (based on a convex polyhedra analyser) and as a preprocessor to other Horn clause verification tools.
机译:我们提出了一种方法,用于针对目标限制Horn子句中的约束。我们使用抽象解释来计算给定子句和目标的查询-答案转换版本的模型。然后,将来自模型的约束用于计算每个子句的专用版本。效果是从上至下从目标传播约束,从下至上传播答案约束。可以重复专业化过程以产生进一步的专业化。该方法独立于抽象域和从句所依据的约束理论。关于验证问题的实验结果表明,无论是在我们自己的验证工具(基于凸多面体分析器)中,还是作为其他Horn子句验证工具的预处理器,这都是一种有效的转换。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号