首页> 外文会议>2010 3rd International Conference on Advanced Computer Theory and Engineering >Automatic synthesis of multiple ranking functions with supporting invariants via DISCOVERER
【24h】

Automatic synthesis of multiple ranking functions with supporting invariants via DISCOVERER

机译:通过DISCOVERER自动合成多个排序函数并支持不变量

获取原文

摘要

We present a new method for the generation of total degree ordering linear ranking functions supported by inductive linear invariants for loops with linear guards and transitions. Our method, based on Gordan's Theorem, synthesizes linear ranking functions with supporting linear invariants over linear loops by extracting non-linear constraints on the coefficients of a predefined template from a program. The real algebraic tool DISCOVERER is utilized to solve these derived constraints. Two well-known programs are presented to demonstrate this technique. Moreover, our method is complete due to DISCOVERER.
机译:我们提出了一种新的方法,用于生成具有线性保护和过渡的循环的归纳线性不变式支持的总度排序线性排名函数。我们的方法基于Gordan定理,通过从程序中提取预定义模板的系数的非线性约束来合成线性排序函数,并在线性循环上支持线性不变式。真正的代数工具DISCOVERER用于解决这些导出的约束。提供了两个著名的程序来演示此技术。而且,由于使用了DISCOVERER,我们的方法是完整的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号