arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1207.6816cs.PL
收藏

将挣扎转化为成功

Transforming floundering into success

Lee Naish

摘要:

我们展示了如何逻辑程序与“延迟”可以转换为程序没有延迟的方式,保留有关挣扎(也称为死锁)的信息。这允许使用声明式(模型理论)、自底向上或目标独立的方法来分析和调试与挣扎相关的属性。我们依赖于一些以前介绍的限制延迟原语和一个关键的观察,允许属性,如接地进行分析,通过近似(地面)成功集。这篇论文发表在《逻辑程序设计理论与实践》(Theory and Practice of Logic Programming,TPLP)上。关键词:挣扎,延迟,协同编程,程序分析,抽象解释,程序转换,声明式调试

英文摘要:

We show how logic programs with "delays" can be transformed to programs without delays in a way which preserves information concerning floundering (also known as deadlock). This allows a declarative (model-theoretic), bottom-up or goal independent approach to be used for analysis and debugging of properties related to floundering. We rely on some previously introduced restrictions on delay primitives and a key observation which allows properties such as groundness to be analysed by approximating the (ground) success set. This paper is to appear in Theory and Practice of Logic Programming (TPLP). Keywords: Floundering, delays, coroutining, program analysis, abstract interpretation, program transformation, declarative debugging

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑