arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0012014cs.SE
收藏

约束逻辑程序的切片

Slicing of Constraint Logic Programs

Gyongyi Szilagyi, Tibor Gyimothy, Jan Maluszynski

摘要:

切片是一种最初为命令式语言开发的程序分析技术。它有助于理解数据流和调试。本文讨论了约束逻辑程序的切片问题。约束逻辑程序设计(CLP)是一种新兴的软件技术,其应用越来越广泛.约束程序中的数据流不是显式的,因此切片的概念和命令式语言的切片技术不能直接应用。本文阐述了适用于CLP的切片的声明性概念。它们为定义基于变量共享的切片技术(动态和静态)提供了基础。通过使用接地信息进一步扩展的技术。一个原型的CLP程序实现所提出的思想的动态切片器进行了简要描述,连同一些切片实验的结果。

英文摘要:

Slicing is a program analysis technique originally developed for imperative languages. It facilitates understanding of data flow and debugging. This paper discusses slicing of Constraint Logic Programs. Constraint Logic Programming (CLP) is an emerging software technology with a growing number of applications. Data flow in constraint programs is not explicit, and for this reason the concepts of slice and the slicing techniques of imperative languages are not directly applicable. This paper formulates declarative notions of slice suitable for CLP. They provide a basis for defining slicing techniques (both dynamic and static) based on variable sharing. The techniques are further extended by using groundness information. A prototype dynamic slicer of CLP programs implementing the presented ideas is briefly described together with the results of some slicing experiments.

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

↑