1 / 12

Program Slice

Program Slice. Program slice was a concept first discussed by Mark Weiser in the early 1980’s He especially noticed that when people debug, they trace a specific of interest variable backwards in the program to the point where the variable is defined (assigned a value)

lane-mendez
Download Presentation

Program Slice

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Program Slice • Program slice was a concept first discussed by Mark Weiser in the early 1980’s • He especially noticed that when people debug, they trace a specific of interest variable backwards in the program to the point where the variable is defined (assigned a value) • This traced path is a condensed path of execution that allows us to check processing of that variable of interest.

  2. A simple example of Program Slice - Consider that our variable of interest is y at statement 7. - We would pick up statements: 7 6 4 (because the loop influences statement 6) 2 1 (because limit influences statement 4) - Statements <1,2,4,6,7 > form a Program Slice - Note that: in executing just this slice, the value of y is the same at statement 7 as executing the whole example Pseudo code example 1. int limit = 10; 2. int y = 0; 3. int x = 0; 4. for (int i = 0; i < limit ; i++) 5. {x = x + i; 6. y = y + i2 ; } 7. print (“ x = “, x , “y =“, y);

  3. Program Slice and Cohesion • Besides, debugging, the notion of program slice also allow people to reduce the program to its “essentials” by looking at “key” variables. • e.g. the major output may be a key variable. • This view allowed the possibility of looking at program cohesion through a set of program cohesion metrics.

  4. Using Program and Data Slices to Measure Program Cohesion • Bieman and Ott (early 1990’s) introduced a measure of program cohesion using the following concepts from program and dataslices: • A data token is any variable or constant in the program • A slice within a program is the collection of all the statements that can affect the value of some specific variable of interest. • A data slice is the collection of all the data tokens in the slice that will affect the value of a specific variable of interest. • Glue tokens are the data tokens in the program that lie in more than one data slice. • Super glue tokens are the data tokens in the program that lie in every data slice of the program Measure Program Cohesion through 2 metrics: - weak functional cohesion = (# of glue tokens) / (total # of data tokens) - strong functional cohesion = (#of super glue tokens) / (total # of data tokens)

  5. Data Tokens: z1 n1 end1 min1 max1 i1 end2 n2 max2 z2 01 min2 z3 02 i2 03 i3 end3 i4 z4 i5 max3 max4 z5 i6 z6 i7 min3 min4 z7 i8 max5 min5 (33) Slice max: z1 n1 end1 max1 i1 end2 n2 max2 z2 01 i2 03 i3 end3 i4 z4 i5 max3 max4 z5 i6 max5 (22) Slice min: z1 n1 end1 min1 i1 end2 n2 min2 z3 02 i2 03 i3 end3 i4 z6 i7 min3 min4 z7 i8 min5 (22) Glue Tokens: z1 n1 end1 i1 end2 n2 i2 03 i3 end3 i4 (11) Super Glue: z1 n1 end1 i1 end2 n2 i2 03 i3 end3 i4 (11) A Pseudo-Code Example of Functional Cohesion Measure Finding the maximum and the minimum values procedure: MinMax ( z, n) Integer end, min, max, i ; end = n ; max = z[0] ; min = z[0] ; For ( i = 0, i = < end , i++ ) { if z[ i ] > max then max = z[ i ]; if z[ i ] < min then min = z[ i ]; } return max, min;

  6. Example of pseudo-code Cohesion Metrics • For the example of finding min and max, the glue tokens are the same as the super glue tokens. • Super glue tokens = 11 • Glue tokens = 11 • The data slice for min and data slice for max turns out to be the same number, 22 • The total number of data tokens is 33 The cohesion metrics for the example of min-max are: weak functional cohesion = 11 / 33 = 1/3 strong functional cohesion = 11 / 33 = 1/3 Note The change But, if we had only computed one function (e.g. only max), then : weak functional cohesion = 22 / 22 = 1 strong functional cohesion = 22/ 22 = 1

  7. Now look at the cohesion of the two earlier program samples - Are they “equally” cohesive based on Bieman and Ott metrics? - Perhaps it is coupling that we need to worry about ? - What type of coupling do you think this is?

  8. Code Sample From Page 343-344 Of Text For Tax problem tax = 0 if (taxable_income == 0) go to EXIT; if (taxable_income > 10000) tax = tax + 1000; else { tax = tax + .10 * taxable_income; goto EXIT; } if (taxable_income > 20000) tax = tax + 1200; else{ tax = tax + .12 * (taxable_income – 10000); goto EXIT; } if (taxable_income > 30000) tax = tax +1500; else{ tax = tax + .15 * (taxable_income – 20000); goto EXIT; } if (taxable_income < 40000) { tax = tax + .18 * (taxable_income – 30000); goto EXIT; } else tax = tax +1800 + .20 * (taxable_income – 40000); EXIT: ; 10% tax for the first $10,000 or less 12% tax for $10,001 to $20,000 15% tax for $20,001 to $30,000 is this correct? See requirements 18% tax for $30,001 to $39,999 20% tax for above $40,000

  9. In Control Flow form Tax = 0.0 yes Inc= 0? no no Inc > 10k yes Tax = Tax + 1,000 Tax = [Tax + .1(Inc ) ] no yes Tax = [Tax + .12(Inc -10k)] Inc > 20k Tax = Tax + 1,200 no yes Inc > 30k Tax = [Tax + .15(Inc -20k)] Tax = Tax + 1,500 no yes Tax = [Tax +1,800+ .2(Inc -40k)] Inc < 40k Tax = [Tax + .18(Inc -30k)] Exit Cyclomatic complexity # = 5 +1 = 6

  10. Code sample from page 344 of text for same problem for (int i=2 ; level = 1; i <= 5; i++ ) { If (taxable_income > bracket [ i ] ) level = level + 1; else {tax = base [ level ] + percent [ level ] * (taxable_income – bracket [level] ) ; i = 6; } } • Tax table showing the bracket, base, and the percent columns • bracket base percent • 0 0 .10 • 1000 .12 • 2200 .15 • 3700 .18 • 40000 5500 .20 Code structure is different because the algorithm is dependent on a table of Information, which may be implemented with 3 arrays e.g. float [ ] percent = {.10, .12, .15, .18, .20} and assume array indexing start with 1

  11. In Control Flow form i=2 L =1 Exit No i <=5 Yes No Inc > bracket[i] Tax = base[L] + ( percent[L] * (inc- bracket[L] )) Yes i = 6 L = L + 1 With 3 defined arrays of: - base {0,10000, ---, 40,000} - bracket {0, 1000, - - -, 5500} - percent {.1, .12, - - -, .2} i = i + 1 Cyclomatic complexity # = 2 + 1 = 3

  12. Reuse • After reviewing these two code examples, what do you think cohesion and coupling have to do with reuse? • Did you not hear that highly cohesive and loosely coupled code is good for re-use? Which one do you think is more re-usable? If you are the reuse producer, would you do anything differently?

More Related