L. M. Ott and J. M. Bieman. Program slices as an abstraction for cohesion measurement. Information and Software Technology, 40(11-12):691--700, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....to a variable v, independently of any program point. It is given by the union of the static slices computed with respect to the variable v and all possible program points p. Other applications of program slicing include software testing [9, 36, 42, 38, 43] program debugging [85, 70] measurement [75, 7, 73, 74], validation [63] program parallelization [86] program integration [44] reverse engineering and program comprehension [6, 29] program restructuring [52, 16, 21, 64, 51] and identification of reusable functions [17, 22, 65] In particular, the identification of an internal reusable function ....

L.M. Ott and J.M. Bieman, "Program slices as an abstraction for cohesion measurement", Information and Software Technology, vol. 40, no. 11/12, 1998, pp. 691-700.

....slices for KSA and CDA it will be necessary to determine the principal variables of an arbitrary set of statements. The principal variables are those which might be considered to be the result of the set of statements. As Bieman and Ott point out in their work on slice based cohesion measurement [18, 25], the decision as to what variables are principal is somewhat arbitrary; changing it can, of course, alter the results of the algorithms upon which it is based. Therefore, the de nition of what constitutes a principal variable should be treated as a parameter of the concept slicing approach ....

....of these slices contains the statements which contribute to the computation of every principal variable; in other words, the key statements of the concept. We call this the BiemanOtt style algorithm, because it is inspired by Bieman and Ott s work on measuring cohesion using slicing [2, 18, 25, 26, 27]. Speci cally, the intersection of slices on principal variables is the set used to compute the Tightness metric introduced by Ott and Thuss [26] Tightness was later developed into a theory of cohesion measurement based on slicing [2, 25] An alternative KSA algorithm is presented in Figure ....

[Article contains additional citation context not shown here]

L. M. Ott and J. M. Bieman. Program slices as an abstraction for cohesion measurement. In M. Harman and K. Gallagher, editors, Information and Software Technology Special Issue on Program Slicing, volume 40, pages 681-699. Elsevier, 1998.

....that the variable is defined in a branch other than k. The notation means that here is a def use chain [1] from a statement defining to a statement defining . 22] Lakhotia and Nandigam s approach of assessing cohesion has an important advantage over methods that assign numeric values [6, 30]. The rule based approach does not just assign levels of cohesion to a module, it can also give the rationale behind that assignment. As a result we find Lakhotia and Nandigam s formalization is especially suitable for program restructuring. 4. Restructuring technique The automated restructuring ....

Linda Ott and James Bieman. Program slices as an abstraction for cohesion measurement. Journal of Information and Software technology, 40(1112) :691--699, November 1998.

No context found.

L. M. Ott and J. M. Bieman. Program slices as an abstraction for cohesion measurement. Information and Software Technology, 40(11-12):691--700, 1998.

No context found.

L. Ott and J. Bieman. Program slices as an abstraction for cohesion measurement. Information & Software Technology, 40(11--12):691--699, Nov. 1998. Special Issue: Program Slicing.

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