权益分类	功能权益	普通用户	{{item.name}}会员
{{category.name}}	{{benefitItem.name}}

A General Theory of Program Dependencies in Imperative and Declarative Concurrent Programs and Its Applications

命令式和声明式并发程序中程序依赖关系的一般理论及其应用

基本信息

批准号：
06452394
负责人：
CHENG Jingde
金额：
$ 3.9万
依托单位：
Kyushu University
依托单位国家：
日本
项目类别：
Grant-in-Aid for Scientific Research (B)
财政年份：
1994
资助国家：
日本
起止时间：
1994 至 1996
项目状态：
已结题

项目摘要

1.We extended the nondeterministic parallel control-flow net and nondeterministic parallel definition-use net, which are two representations for imperative concurrent programs originally introduced by Cheng, such that they cab be used to represent multiple control flows and multiple data flows in declarative concurrent programs.2.We introduced three new types of primary program dependencies between arguments in concurrent logic programs, named the sharing dependence, communication dependence, and unification dependence, and proposed algorithms to analyze these program dependences. We also proposed a new program representation for concurrent logic programs, named the argument dependence net, which is a kind of arc-classified digraph to explicitly represent the three types of primary program dependencies in the programs. Based on the argument dependence net, we formally defined various notions about slicing concurrent logic programs and also proposed algorithms to compute various slices in the programs.3.We proposed a new program representation for concurrent object-oriented programs, named the system dependence net, which is a kind of arc-classified digraph to explicitly represent various types of primary program dependencies in constructs and the structure of the constructs in the programs, and showed that once a concurrent object-oriented program is represented by its system dependence net, the slices of the program can be computed based on the net as a simple reachability problem in the net.4.We proposed two new program representations for functional programs, named the evaluation order graph and binding evaluation graph, and showed their applications including understanding, analysis, testing, debugging, maintenance, and complexity measurement of functional programs. We are developing a tool to transform a functional program into its evaluation order graph and binding evaluation graph.

1.对Cheng提出的命令式并发程序的两种表示方法--非确定性并行控制流网和非确定性并行定义使用网进行了扩展，使其可以表示声明式并发程序中的多个控制流和多个数据流; 2.提出了并发逻辑程序中参数间的三种新的主程序依赖，即共享依赖，通信依赖和统一依赖，并提出了算法来分析这些程序依赖。我们还提出了一种新的并发逻辑程序表示方法--参数依赖网，它是一种弧分类有向图，用来显式表示程序中的三种主要程序依赖。基于变元依赖网，形式化地定义了并发逻辑程序切片的各种概念，并给出了计算并发逻辑程序切片的算法。3.提出了一种新的并发面向对象程序的程序表示方法--系统依赖网，这是一种弧形分类有向图以显式地表示构造中的各种类型的主程序依赖关系以及程序中的构造的结构，4.提出了两种新的函数式程序表示方法：赋值顺序图和绑定赋值图，并给出了它们在理解、分析、测试等方面的应用，调试、维护和功能程序的复杂性度量。我们正在开发一个工具，将函数式程序转换成它的求值顺序图和绑定求值图。