首页> 外文会议>Proceedings of the 2012 ACM SIGPLAN principles and practice of declarative programming >Automatic Synthesis of Specifications for First Order Curry Programs
【24h】

Automatic Synthesis of Specifications for First Order Curry Programs

机译:自动合成一阶咖喱程序的规格

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

摘要

This paper presents a technique to automatically infer algebraic property-oriented specifications from first-order Curry programs. Curry is a lazy functional logic language and the interaction between laziness and logical variables raises some additional difficulties with respect to other proposals for functional languages. Our technique statically infers from the source code of a Curry program a specification which consists of a set of equations relating (nested) operation calls that have the same behavior. We propose a (glass-box) semantic-based inference method which relies on a fully-abstract (condensed) semantics for achieving, to some extent, the correctness of the inferred specification, differently from other (black-box) approaches based on testing techniques.
机译:本文提出了一种从一阶Curry程序中自动推导面向代数性质的规范的技术。 Curry是一种懒惰的功能逻辑语言,相对于针对功能语言的其他建议,懒惰和逻辑变量之间的交互带来了一些额外的困难。我们的技术从Curry程序的源代码中静态推断出一个规范,该规范包括一组与行为相同的(嵌套)操作调用相关的方程式。我们提出了一种基于(玻璃盒)语义的推理方法,该方法依赖于完全抽象(压缩的)语义以在某种程度上实现推断规范的正确性,这与基于测试的其他(黑盒)方法不同技术。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号