首页> 外文期刊>Journal of Logic and Algebraic Programming >Verifying an infinite systolic algorithm using third-order equational methods
【24h】

Verifying an infinite systolic algorithm using third-order equational methods

机译:使用三阶方程式方法验证无限收缩算法

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

摘要

We consider using third-order equational methods to formally verify that an infinite systolic algorithm correctly implements a family of convolution functions. The detailed case study we present illustrates the use of third-order algebra as a formal framework for developing families of computing systems. It also provides an interesting insight into the use of infinite algorithms as a means of verifying a family of finite algorithms. We consider using purely equational reasoning in our verification proofs and in particular, using the rule of free variable induction. We conclude by considering how our verification proofs can be automated using rewriting techniques. (C) 2005 Elsevier Inc. All rights reserved.
机译:我们考虑使用三阶方程式方法来正式验证无限心跳算法正确实现了一系列卷积函数。我们目前的详细案例研究说明了将三阶代数用作开发计算系统系列的正式框架。它还提供了关于使用无限算法作为验证一系列有限算法的一种有趣的见解。我们考虑在验证证明中使用纯方程式推理,尤其是使用自由变量归纳法则。最后,我们考虑使用重写技术如何使我们的验证证明自动化。 (C)2005 Elsevier Inc.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号