On Proving Operational Termination Incrementally with Modular Conditional Dependency Pairs

Masaki Nakamura; Kazuhiro Ogata; Kokichi Futatsugi

首页> 外文期刊>IAENG Internaitonal journal of computer science >On Proving Operational Termination Incrementally with Modular Conditional Dependency Pairs

【24h】

On Proving Operational Termination Incrementally with Modular Conditional Dependency Pairs

机译：关于模块化条件相关对逐步证明操作终止的研究

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

OBJ algebraic specification languages support semi-automated verification of algebraic specifications based on equational reasoning by term rewriting systems (TRS). Termination is one of the most important properties of TRSs. Termination guarantees that any execution of the specification terminates in finite times. Another important feature of OBJ languages is a module system with module imports to describe large and complex specifications in a modular way. In this study, we focus on a way to prove termination of OBJ specifications incrementally, based on the notion of modular conditional dependency pairs (MCDP).

机译：OBJ代数规范语言支持基于术语重写系统（TRS）进行方程式推理的代数规范半自动验证。终止是TRS最重要的特性之一。终止保证规范的任何执行都在有限的时间内终止。 OBJ语言的另一个重要功能是带有模块导入的模块系统，以模块方式描述大型和复杂的规范。在本研究中，我们基于模块化条件依赖对（MCDP）的概念，着重于逐步证明OBJ规范终止的方法。

著录项

来源
《IAENG Internaitonal journal of computer science》 |2013年第2期|117-123|共7页
作者
Masaki Nakamura; Kazuhiro Ogata; Kokichi Futatsugi;
展开▼
作者单位

Department of Information Systems Engineering, Toyama Prefectural University, Japan;

School of Information Science, Japan Advanced Institute of Science and Technology (JAIST);

School of Information Science, Japan Advanced Institute of Science and Technology (JAIST);

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类
关键词
Term rewriting; Operational termination; Conditional Dependency Pairs; Algebraic specification; OBJ languages;

机译：术语重写;运营终止;条件依赖对;代数规格;OBJ语言;

相似文献

外文文献
中文文献
专利

1. Dependency pairs for proving termination properties of conditional term rewriting systems [J] . Lucas Salvador, Meseguer Jose Journal of Logic and Algebraic Programming . 2017,第1期

机译：证明条件项重写系统终止特性的依赖对
2. Proving Termination by Dependency Pairs and Inductive Theorem Proving [J] . Carsten Fuhs, Jiirgen Giesl, Michael Parting, Journal of Automated Reasoning . 2011,第2期

机译：用依赖对和归纳定理证明终止
3. Characterizing and proving operational termination of deterministic conditional term rewriting systems [J] . Felix Schernhammer, Bernhard Gramlich Journal of Logic and Algebraic Programming . 2010,第7期

机译：确定并证明确定性条件词重写系统的操作终止
4. 2D Dependency Pairs for Proving Operational Termination of CTRSs [C] . Salvador Lucas, Jose Meseguer European joint conference on theory and practice of software;International workshop on rewriting logic and its applications . 2012

机译：用于证明CTRS的操作终止的2D依赖对
5. Automatically proving the termination of functional programs. [D] . Vroon, Daron. 2007

机译：自动证明功能程序的终止。
6. Relative Termination via Dependency Pairs [O] . José Iborra, Naoki Nishida, Germán Vidal, -1

机译：通过依赖对的相对终止
7. Proving Termination by Dependency Pairs and Inductive Theorem Proving [O] . Carsten Fuhs, Jürgen Giesl, Michael Parting, 2012

机译：通过依赖对和归纳定理证明终止

On Proving Operational Termination Incrementally with Modular Conditional Dependency Pairs

摘要

著录项

相似文献

相关主题

期刊订阅