Transformations of logic programs on infinite lists

ALBERTO PETTOROSSI; VALERIO SENNI; MAURIZIO PROIETTI

首页> 外文期刊>Theory and Practice of Logic Programming >Transformations of logic programs on infinite lists

【24h】

Transformations of logic programs on infinite lists

机译：无限列表上逻辑程序的转换

获取原文

获取原文并翻译 | 示例

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

开具论文收录证明 >>

文献代查 >>

页面导航

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

摘要

We consider an extension of logic programs, called ω-programs, that can be used to define predicates over infinite lists, ω-programs allow us to specify properties of the infinite behavior of reactive systems and, in general, properties of infinite sequences of events. The semantics of ω-programs is an extension of the perfect model semantics. We present variants of the familiar unfold/fold rules which can be used for transforming ω-programs. We show that these new rules are correct, that is, their application preserves the perfect model semantics. Then we outline a general methodology based on program transformation for verifying properties of ω-programs. We demonstrate the power of our transformation-based verification methodology by proving some properties of Buechi automata and ω-regular languages.

机译：我们考虑了逻辑程序的扩展，称为ω程序，可用于定义无限列表上的谓词，ω程序使我们可以指定反应性系统的无限行为的性质，并且通常指定事件的无限序列的性质。 ω程序的语义是完美模型语义的扩展。我们介绍了可用于变换ω程序的熟悉的展开/折叠规则的变体。我们证明这些新规则是正确的，也就是说，它们的应用程序保留了完美的模型语义。然后，我们概述了一种基于程序转换的通用方法，用于验证ω程序的属性。我们通过证明Buechi自动机和ω-常规语言的某些特性，证明了我们基于变换的验证方法的力量。

著录项

来源
《Theory and Practice of Logic Programming》 |2010年第6期|P.383-399|共17页
作者
ALBERTO PETTOROSSI; VALERIO SENNI; MAURIZIO PROIETTI;
展开▼
作者单位

DISP, University of Rome Tor Vergata, Via del Politecnico 1, I-00133 Rome, Italy;

rnDISP, University of Rome Tor Vergata, Via del Politecnico 1, I-00133 Rome, Italy;

IASI-CNR, Viale Manzoni 30, I-00185 Rome, Italy;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类
关键词
program transformation; program verification; infinite lists;

机译：程序转换;程序验证;无限列表;

相似文献

外文文献
中文文献
专利

1. Infinite Unfolding and Transformations of Nondeterministic Programs [J] . Bjorn Lisper Fundamenta Informaticae . 2005,第4期

机译：不确定性程序的无限展开和转换
2. Transformations of logic programs with goals as arguments [J] . ALBERTO PETTOROSSI, MAURIZIO PROIETTI Theory and Practice of Logic Programming . 2004,第Pt4期

机译：以目标为参数的逻辑程序的转换
3. Beyond Tamaki-Sato style unfold/fold transformations for normal logic programs [J] . Abhik Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, International Journal of Foundations of Computer Science . 2002,第3期

机译：超越Tamaki-Sato样式的普通逻辑程序的展开/折叠转换
4. Workshop on Logic, Graph Transformations, Finite and Infinite Structures [C] . Bruno Courcelle, David Janin International Conference on Graph Transformations . 2004

机译：逻辑，图形转换，有限和无限结构的研讨会
5. Generalized Boole transformations with infinitely many singularities [D] . Chen, Yu-Yuan. 2016

机译：具有无限多个奇点的广义Boole变换
6. An organic jelly made fractal logic gate with an infinite truth table [O] . Subrata Ghosh, Daisuke Fujita, Anirban Bandyopadhyay -1

机译：具有无限真值表的有机果冻形分形逻辑门
7. TRANSFORMATIONS OF LOGIC PROGRAMS ON INFINITE LISTS [O] . Consiglio Nazionale, Delle Ricerche, A. Pettorossi, 2016

机译：无限列表逻辑程序的转换
8. Logic Programming and the Refinement Calculus: Semantics Based ProgramTransformations [R] . Kok, J. N. 1990

机译：逻辑编程和细化微积分：基于语义的程序转换

Transformations of logic programs on infinite lists

摘要

著录项

相似文献

相关主题

期刊订阅