• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Logic for Programming, Artificial Intelligence, and Reasoning(LPAR 2005); 20051202-06; Montego Bay(JM) >Termination of Fair Computations in Term Rewriting
【24h】

Termination of Fair Computations in Term Rewriting

机译：术语重写中公平计算的终止

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The main goal of this paper is to apply rewriting termination technology - enjoying a quite mature set of termination results and tools- to the problem of proving automatically the termination of concurrent systems under fairness assumptions. We adopt the thesis that a concurrent system can be naturally modeled as a rewrite system, and develop a reductionistic theoretical approach to systematically transform, under reasonable assumptions, fair-termination problems into ordinary termination problems of associated relations, to which standard rewriting termination techniques and tools can be applied. Our theoretical results are combined into a practical proof methodology for proving fair-termination that can be automated and can be supported by current termination tools. We illustrate this methodology with some concrete examples and briefly comment on future extensions.
机译：本文的主要目的是将重写终止技术（具有相当成熟的终止结果和工具集）应用于在公平性假设下自动证明并发系统终止的问题。我们采用这样的论点，即可以将并发系统自然地建模为重写系统，并开发一种简化理论方法，在合理的假设下将公平终止问题系统地转换为关联关系的普通终止问题，标准重写终止技术和可以应用工具。我们的理论结果被结合到一个实践证明方法中，用于证明公平终止，该方法可以自动化并且可以由当前的终止工具支持。我们将通过一些具体示例说明此方法，并简要评论将来的扩展。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号