J. Zhao, J. Cheng, and K. Ushijima. Slicing concurrent logic programs. In Proc. 2nd Fuji Int. Workshop on Functional and Logic Programming, Shonan Village Center, Japan, pages 143--162. World Scientific, 1997.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... graph (CHG) to compute class hierarchy slice [6] Christoph Steindl presented an approach for computing intermodular slice in objectoriented program [22] Jianjun Zhao presented basic method to compute object oriented concurrent program slice and dynamic object oriented program slice in his papers[25,26]. Bixin Li introduced a new model called hierarchy slice model based on all of achievements gained by all these pioneers in his Ph.D thesis [17] and a new hybrid algorithm is produced consisting of both graph reachable algorithm and stepwise refinement algorithm, he uses this hybrid algorithm to ....

Jianjun Zhao, Jingde Cheng, and K. Ushijima. Slicing concurrent logic programs. In T. Ida, A. Ohori, and M. Takeichi, editors, Second Fuji International Workshop on Functional and Logic Programming, pages 143-162, 1997.

....of software engineering tools for imperative programs, most of the work on program dependence analysis for logic programs still aims at generating efficient codes, rather than developing software engineering tools. In this section, we introduce a program dependence model first presented in [13] for concurrent logic programs. The model presents three types of primary program dependences called sharing dependence, communication dependence, and unification dependence between arguments in a concurrent logic program and a dependence based representation called the Argument Dependence Net ....

....and is omitted in the figure. Moreover, we use thin solid arcs to represent sharing dependences, thick dashed arcs to represent communication dependences, and thin dashed arcs to represent unification dependences. 5. 3 Building ADNs In this section we introduce a concrete algorithm presented in [13] for building an ADN of a concurrent logic program. The algorithm is based on the condition that mode information of the program has been already known. The algorithm consists of three parts, an algorithm Sha Com Dependence for building a subnet of the ADN concerning sharing and communication ....

[Article contains additional citation context not shown here]

J. Zhao, J. Cheng, and K. Ushijima, "Slicing Concurrent Logic Programs," in T. Ida and A. Ohori (Eds.), "Functional and Logic Programming, " 1997, World Scientific.

....especially Prolog programs. Schoenig and Ducasse [16] also use program dependence information to compute backward slices of Prolog programs. Pereira [13] used the term dependence information to dynamically improve the efficiency of algorithmic debugging of sequential logic programs. Zhao et al. [20] used a dependence graph based approach to slicing concurrent logic programs. Since program dependence analysis and a dependence based representation are very useful in developing software engineering tools for imperative programs, using program dependence information and a dependencebased ....

....a number of methods to compute slices have been proposed for imperative programs [17] as well as logic programs [9, 16] In the following, we describe some notions of a static slice of a concurrent logic program. The formal definition of a static slice of a concurrent logic program can be found in [20]. A reduced literal of a literal l in a concurrent logic program is a literal l 0 that is derived from l by replacing zero, or more arguments of l with anonymous variables. A static slicing criterion for a concurrent logic program P is a 2 tuple (l; ff) where l is a literal in P and ff is ....

Zhao, J., Cheng, J. and Ushijima, K. : Slicing Concurrent Logic Programs, in T. Ida, A. Ohori and M. Takeichi (Eds.), Second Fuji International Workshop on Functional and Logic Programming, pp.143-162, World Scientific (1997).

....true for concurrent logic programming languages. For example, at present there is no programming environment for concurrent logic programs that supports important software engineering activities such as program understanding, debugging, testing, maintenance, and complexity measurement. In [15], we present a technique for program dependence analysis of concurrent logic programs. In order to develop techniques that can be applied to programs written in realistic concurrent logic programming languages, we choice the KL1, the most widely used concurrent logic programming language, as our ....

....system called CLPKIDS, that is based on program dependence analysis, to explicitly support programmers for understanding, testing, debugging, maintenance and complexity measurement of concurrent logic programs. CLPKIDS is a prototype implementation of the technique described in our previous papers [15, 16]. In this paper we give an overview of CLPKIDS. The rest of the paper is organized as follows. Section 2 gives a brief introduction of KL1 and program dependences in concurrent logic programs. Section 3 gives an overview of system CLPKIDS. Concluding remarks are given in Section 4. 2 Background ....

[Article contains additional citation context not shown here]

J. Zhao, J. Cheng, and K. Ushijima, "Slicing Concurrent Logic Programs," in T. Ida and A. Ohori (Eds.), "Fuji International Workshop 96: Functional and Logic Programming," Shonan Village, Japan, November 1996, World Scientific.

....kind of slicing as traditional slicing to distinguish it from a new form of slicing introduced later. Traditional slicing has been studied primarily in the context of conventional programming languages [17] In such languages, slicing is typically performed using dependence graph representations [4, 9, 6, 14, 19, 20]. Traditional slicing has many applications in software engineering activities including program understanding [5] debugging [1] testing [2] maintenance [7] reuse [13] reverse engineering [3] and complexity measurement [14] 3 Technical Report 97 SE 117, pp.85 92, Information Processing ....

Zhao, J., Cheng, J. and Ushijima, K. : Slicing Concurrent Logic Programs, in T. Ida, A. Ohori and M. Takeichi (Eds.), Second Fuji International Workshop on Functional and Logic Programming, pp.143-162, World Scientific (1997). 92

.... in functional programs, logical programs, or programs in other programming paradigms which is intrinsically different from the five types of primary program dependences presented in this paper Can we develop an axiomatic theory for program dependence analysis We are investigating these problems [25, 26, 27]. Until now, almost all, if not all, work on program dependence analysis technique focused their attentions on a single program rather than a large scale distributed system with various programs written in various programming languages. However, it is obvious that as a representation for a single ....

J. Zhao, J. Cheng, and K. Ushijima, "Slicing Concurrent Logic Programs," in T. Ida, A. Ohori, and M. Takeichi (Eds.), "Functional and Logic Programming - Proceedings of the 2nd Fuji International Workshop," World Scientific, 1997.

....: O, L NO] rev:rev,R,L) pop,N,R,S,NS) stack,I,NO,NS) N,0) L, X NL] pop,X,S,NS) NN,N 1) pop,NN,NL,NS,OS) L, OS,S) NS,S) A,answer(X) Figure 2: The partial ADN of the program in Figure 1. for imperative programs [12] as well as logic programs [5, 11, 19]. In the following, we briefly describe some notions of a static slice of a concurrent logic program. The formal definition of a static slice of a concurrent logic program can be found in [19] A reduced literal of a literal l in a concurrent logic program is a literal l 0 that is derived from l ....

....The partial ADN of the program in Figure 1. for imperative programs [12] as well as logic programs [5, 11, 19] In the following, we briefly describe some notions of a static slice of a concurrent logic program. The formal definition of a static slice of a concurrent logic program can be found in [19]. A reduced literal of a literal l in a concurrent logic program is a literal l 0 that is derived from l by replacing zero, or more arguments of l with anonymous variables. A static slicing criterion for a concurrent logic program P is a 2 tuple (l; ff) where l is a literal in P and ff is an ....

[Article contains additional citation context not shown here]

J. Zhao, J. Cheng, and K. Ushijima, "Slicing Concurrent Logic Programs," in T. Ida, A. Ohori and M. Takeichi (Eds.), Second Fuji International Workshop on Functional and Logic Programming, pp.143-162, World Scientific, 1997.

....as traditional slicing to distinguish it from a new form of slicing introduced later. Traditional slicing has been studied primarily in the context of conventional programming languages [21] In such languages, slicing is typically performed by using a control flow graph or a dependence graph [5, 12, 7, 16, 24, 25]. Traditional slicing has many applications in software engineering activities including program understanding [6] debugging [1] testing [3] maintenance [8] reuse [15] reverse engineering [4] and complexity measurement [16] Applying slicing technique to software architectures promises ....

J. Zhao, J. Cheng, and K. Ushijima, "Slicing Concurrent Logic Programs," in T. Ida, A. Ohori and M. Takeichi (Eds.), Second Fuji International Workshop on Functional and Logic Programming, pp.143-162, World Scientific, 1997.

No context found.

J. Zhao, J. Cheng, and K. Ushijima. Slicing concurrent logic programs. In Proc. 2nd Fuji Int. Workshop on Functional and Logic Programming, Shonan Village Center, Japan, pages 143--162. World Scientific, 1997.

No context found.

J. Zhao, J. Cheng, and K. Ushijima. Slicing concurrent logic programs. In Proc. 2nd Fuji Int. Workshop on Functional and Logic Programming, Shonan Village Center, Japan, pages 143--162. World Scientific, 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC