| Research Abstract |
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.
|
