|
Foundations of Software Testing Errata
|
Reward
for reporting an error: US$2/first report. Minimum amount given US$5.
Reward
given twice an year: Jan 1 and July 1. |
|
|
Aditya P. Mathur |
Errata |
|
|
|
||
|
|
||
|
|
||
Sincere thanks to Praveen Ranjan Srivastava,
BITS, Pilani, India, Vahid Garousi, University of Calgary, Canada, Trupti
Gandhi, Patni Computers, Eric Wong, UT Dallas, Wang Feng, Beijing, China, and Marco Aurélio Graciotto Silva, ICMP, Brazil, Jim Mapel, Cyberonics, Rakesh Veeramacheneni, Purdue, Bryan Tomayko, Cyberonics, Lyle Goldman, Florida Atlantic University, Yu Leng, Purdue and Natalia Silvis, for a careful
reading and reporting of errors.
Latest
update: April 19, 2011.
The errors listed below have been removed from the second edition of the book. The second edition is expected to be on the market in fall 2012.
Total
errors reported: 169.
Lyle Goldman: 67 (US), Vahid Garousi (US): 34.
Wang Feng (US): 20. Author: 17. Praveen Srivastava (India):. 13. Natalia Silvis (Netherlands): 4. Eric Wong (US): 3. Marco Aurélio Graciotto Silva (Brazil): 3. Trupti
Gandhi (India): 1.
| Location
(-x
points to a line from the bottom of the page) |
Replace (or edit) this
|
by this
|
First reported by |
| Page ix, right column, entry for chapter 5 | Minimizations | Minimization | Author. 5/9/00 |
| Page xiv, paragraph 3, line 3 | Part I illustrate | Part I illustrates | Lyle Goldman. August 29, 2010 |
| Page xv, paragraph 4, line 2 | heart simulator | a heart simulator | Lyle Goldman. August 29, 2010 |
| Page xvii, | Table 4 | Table is badly formatted. See the corrected table following this errata. | Vahid Garousi. 7/17/08 |
| Page 6, Figure 1.1, the No link in the oval labeled "are these the same?" | failure | failure | Natalia Silvis. March 16, 2011 |
| Page 11, last line of first paragraph following Example 1.3 | illustrates the incompleteness Requirement 1 | illustrates the incompleteness of Requirement 1 | Lyle Goldman. August 29, 2010 |
| Page 11, third line of second paragraph under Example 1.3 | of sort program | of the sort program | Lyle Goldman. August 29, 2010 |
| Page 12, Example 1.4, last line | pair integers | pair | Lyle Goldman. August 29, 2010 |
| Page 15, last par, line 2 | incorrect result | an incorrect result | Lyle Goldman. August 29, 2010 |
| Page 18, Fig 1.2, Condition box with text "Cause of error to be determined now?"" | Outgoing arrows are not labelled | Left arrow should be labelled "No" and the right arrow labelled "Yes" | Lyle Goldman. August 29, 2010 |
| Page 18, Fig 1.2, Condition box with text "Error to be fixed now?" | Outgoing arrows are not labelled | Left arrow should be labelled "No" and the right arrow labelled "Yes" | Lyle Goldman. August 29, 2010 |
| Page 21, Figure 1.4 | num_item | num_items | Natalia Silvis. March 16, 2011 |
| Page 21, first para, line 2 | get-input | get_input | Lyle Goldman. August 29, 2010 |
| Page 21, first para, line 4 | in-numbers | in_numbers | Natalia Silvi. March 16, 2011 |
| Page 21, second para, next -to-last-line | print-sequence | print_sequence | Lyle Goldman. August 29, 2010 |
| Page 23, Example 1.15, lines 4-5 | pulling down of the menu | the pulling down of the menu | Lyle Goldman. August 29, 2010 |
| Page 23, Example 1.15, line 7 | open as one of several options. When the open option | Open as one of several options. When the Open option | Natalia Silvis. March 16, 2011 |
| Page 25, second full para, line 2 | might make error | might make an error | Lyle Goldman. August 29, 2010 |
| Page 26, first para of 1.5.6, line next-to-last-line | automated oracle | an automated oracle | Lyle Goldman. August 29, 2010 |
| Page 31, Table 1.3 | Lower subscript of the summation (n=1) | i=1 | Lyle Goldman. August 29, 2010 |
| Page 32, second para, 1.6.7, line 4 | dynamic metric | a dynamic metric | Lyle Goldman. August 29, 2010 |
| Page 36, last line | the AT&T | AT&T | Lyle Goldman. August 29, 2010 |
| Page 40, Fig. 1.12 | missing arrow | Add an arrow from the box lwith text "Algebraic and logic specifications | Lyle Goldman. August 29, 2010 |
| Page 41, last para before 1.12, fourth line from the end | effected | affected | Lyle Goldman. August 29, 2010 |
| Page 44, line 2 (not counting the figure caption) | bock | block | Lyle Goldman. August 29, 2010 |
| Page 44, line 6 (not counting figure) | bock | block | Lyle Goldman. August 29, 2010 |
| Page 47, Program P1.2, line 12 | unindented line power=power-1; | indent this line to align with the line above | Lyle Goldman. August 29, 2010 |
| Page 48, first paragraph in 1.14.2, last sentence | Node Start that has no incoming edge and node End that has no outgoing edge. | Node Start has no incoming edge and node End has no outgoing edge. | Lyle Goldman. August 29, 2010 |
| Page 49, Example 1.24 | --- | Add (8, 9) to E | Lyle Goldman. August 29, 2010 |
| Page 50, Para 2, line 2 | (3, 5), 6, 8) | (3, 5), (6, 8) | Lyle Goldman. August 29, 2010 |
| Page 51, Fig. 1.17 | --- | Make edge 7-8 bold and 7-9 normal | Lyle Goldman. August 29, 2010 |
| Page 51, line 1 | paths of lengths 4 and 5 | paths of lengths 3 and 4 | Lyle Goldman. August 29, 2010 |
| Page 51, line 15 | paths of lengths 11 and 8 | paths of lengths 10 and 7 | Lyle Goldman. August 29, 2010 |
| Page 53, Program P1.3 | , power | Nothing (this variable is useless) | Praveen Ranjan Srivastava. 2/20/08 |
| Page 55, second para, line 1 | n is the immediate | n is the immediate | Lyle Goldman. August 29, 2010 |
| Page 56, last para, line 3 | an output statement | output statement | Lyle Goldman. August 29, 2010 |
| Page 59, para 3, line 6 | | s | | | s | | Lyle Goldman. August 29, 2010 |
| Page 60, text under "Regular Expression", last line of last bulleted item | { e } L1 U L2 | L1 U L2 | Lyle Goldman. August 29, 2010 |
| Page 68, second para from the bottom, line 2 | to testing of programs | to the testing of programs | Lyle Goldman. August 29, 2010 |
| Page 68, second para from the bottom, last sentence | black-box and white-box category | black-box and white-box categories | Lyle Goldman. August 29, 2010 |
| Page 69, para 2, line 1 | batch-processing application | a batch-processing application | Lyle Goldman. August 29, 2010 |
| Page69, para 2, line 3 | cardiac pacemaker is where | cardiac pacemaker, is where | Lyle Goldman. August 29, 2010 |
| Page 73, Example 1.32, first para, line 3 | Fahrenheit scale | the Fahrenheit scale | Lyle Goldman. August 29, 2010 |
| Page 79, para 4, line 2 | resorting | resorting | Lyle Goldman. August 29, 2010 |
| Page 79, para 4, line 4 | All of Part II | Part II | Author. October 4, 2010 |
| Page 83, first column, line 18 | [183]. | [183] | Lyle Goldman. August 29, 2010 |
| Page 88, Exercise 1.19, line 2 | might not be | would not be | Lyle Goldman. August 29, 2010 |
| Page 97, para 1, lines 5-6 | inputs less than or equal to | inputs less than | Lyle Goldman. September 27, 2010 |
| Page 99, line 1 | message on either of the | message on each of the | Lyle Goldman. September 27, 2010 |
| Page 99, table, line 3 | Kellog | Kellogg's | Lyle Goldman. September 27, 2010 |
| Page 102, section 2.3.3, first para, line 2 | in the table | in the tables | Lyle Goldman. September 27, 2010 |
| Page 105, line 8 | digit | a digit | Lyle Goldman. September 27, 2010 |
| Page 107, Example 2.7, line 4 | 2.2 x and y | 2.2 to x and y | Lyle Goldman. September 27, 2010 |
| Page 109, Para 2 (step 1), line 9 | tested, is likely | tested are likely | Lyle Goldman. September 27, 2010 |
| Page 109, Para (step 2) , line 5 | on the the expected | on the expected | Lyle Goldman. September 27, 2010 |
| Page 110, line 2 | Sections 2.2, 2.6, | Sections 2.2 and 2.6, | Lyle Goldman. September 27, 2010 |
| Page 110, step 4, line 3 | during test | during a test | Lyle Goldman. September 27, 2010 |
| Page 110, step 4, last line of first para | certain equivalence class | certain equivalence classes | Lyle Goldman. September 27, 2010 |
| Page 111, para above table, line 5 | requirements, identify | requirements and identify | Lyle Goldman. September 27, 2010 |
| Page 112, table , second row | f_valid | f_valid | Lyle Goldman. September 27, 2010 |
| Page 112, table, third row | {c-invalid} | c_invalid} | Author. October 5, 2010 |
| Page 112, table, last row | {t_valid}, {t_invalid} | t_valid, t_invalid | Author. October 5, 2010 |
| Page 113, line 14 | with similar argument | with a similar argument | Lyle Goldman. September 27, 2010 |
| Page 116, para 1, last line | set to 10 | set to -5 | Lyle Goldman. September 27, 2010 |
| Page 116, Example 2.10, line 3 | classes to only 18 | classes to only 14 | Lyle Goldman. September 27, 2010 |
| Page 116, line 6 from bottom | GUI, a file | GUI, a_file | Lyle Goldman. September 27, 2010 |
| Page 116, last line | classes of each | class of each | Lyle Goldman. September 27, 2010 |
| Page 118, line 2 from the bottom | GUI needs to be | the GUI needs to be | Lyle Goldman. September 27, 2010 |
| Page 122, Example 2.12, line 5 | integer x such that if x>=0 | integer p such that if p>=0 | Lyle Goldman. September 27, 2010 |
| Page 122, Example 2.12, line 6 | value of x implies | value of p implies | Lyle Goldman. September 27, 2010 |
| Page 122, Example 2.12, last para | x=0 | p=0 | Lyle Goldman. September 27, 2010 |
| Page 122, Example 2.12 | apply boundary-value analysis | apply the boundary-value analysis | Lyle Goldman. September 27, 2010 |
| Page 123, line 1 | x=0 | p=0 | Lyle Goldman. September 27, 2010 |
| Page 122, Example 2.12, para 3, line 6 | E1 and E2 contain | E1 and E3 contain | Lyle Goldman. September 27, 2010 |
| Page 123, fourth line after definition of T | to generate t3 | to generate t4 | Lyle Goldman. September 27, 2010 |
| Page 124, test t6 | s="Laughter" | s="Laugh" | Lyle Goldman. September 27, 2010 |
| Page 139, second para, line 4 | effects E1 through E4 | effects Ef1 through Ef4 | Author. 5/9/08 |
| Page 144, second para, line 2 | first and fourth combinations | second and fourth combinations | Praveen Ranjan Srivastava. 2/20/08 |
| Page 144, table below the second para, second row | 1 0 1 0 | 1 0 0 1 | Trupti Gandhi. 9/17/08 |
| Page 155, Example 2.23, line 1 | Consider the predicate p | Consider the predicate pr | Author |
| Page 158, row 7 column t1 of Table 2.6 | true | false | Fabian Alenius. 10/6/2009 |
| Page 162, para 3 | SN1 on the left side of each of the three equations | SN4 | Praveen Ranjan Srivastava. 2/25/08 |
| Page 164, first equation for SN4 | ^ | "onto" operator | Praveen Ranjan Srivastava. 2/25/08 |
| Page 164, second equation for SN4 | < | "set union" operator | Praveen Ranjan Srivastava. 2/25/08 |
| Page 165, Table 2.8 header | BOR-constraints for predicate p2 derived in Example 2.28 | BRO-constrains for predicate pr derived in Example 2.29 |
Eric Wong. 9/15/08 |
| Page 165, Table 2.8 , label of column 3 from the left | p | pr | Eric
Wong. 9/15/08
|
| Page 190, Exercise 2.31, first line | p: | pr: | Eric Wong. 9/15/08 |
| Page 202, line -11 | ……if O1(qi, r)=O2(qj, r) for any set V. | ……if O1(qi, s)=O2(qj, s) for any set V. | Wang Feng. 10/23/08 |
| Page 202, line -6 | ……, such that σ and a＇are equivalent and …… | ……, such that σ and σ＇ are equivalent and …… | Wang Feng. 10/23/08 |
| Page 210 Figure 3.10, M2 | Replace label a/0 in q0 by label a/1. Add a link from q2 to q1and label it as b/0. | Bryan Tomayko. 1/7.2010 | |
| Page 210, line -10 | In figure 3.9, machine M4 has q1 missing when compared with machine M4. | In figure 3.9, machine M4 has q1 missing when compared with machine M. | Wang Feng. 10/23/08 |
| Page 211, line -5 | We caution the reader in that the technique …… | We caution the reader that the technique …… | Wang Feng. 10/23/08 |
| Page 219, line -4 | zb=b | z=zb | Wang Feng. 10/23/08 |
| Page 219, line -2 | Step 2(b)(ii) | Step 2(b)(iii) | Wang Feng. 10/23/08 |
| Page 220, line -17 | 2(b)(ii) | 2(b)(ii) and (iii) | Wang Feng. 10/23/08 |
| Page 220, line -16 | We now have p1=q1 and p2=q5. | We now have p1=q5 and p2=q1. | Wang Feng. 10/23/08 |
| Page 220, line -5 | As O(q3, a)=O(q4, a), | As O(q3, a)≠O(q4, a), | Wang Feng. 10/23/08 |
| Page 221, line 19 | for some j, | for any j, | Wang Feng. 10/23/08 |
| Psge 224, Figure 3.14 | The link from q2 to q1 should be labeled a and that from q2 to q5 should be labeled b. | Rakesh Veeramacheneni. 12.17.2009 | |
|
Page 225, line -6 |
ba, baa, baaa, bbaaa, bba, |
ba, baa, baaa, bbaaa, |
Wang Feng. 10/23/08 |
|
Page 228, line -15 |
M(t)=M1(t) |
M(t)≠M1(t) |
Wang Feng. 10/23/08 |
|
Page 229, line -13 |
Thus, instead of moving to state qk’, where qk’=δ(qi, a), the IUT moves to state qk, where qk=δ(qi, a). |
Thus, instead of moving to state qk, where qk=δ(qi, a), the IUT moves to state qk’, where qk’=δ(qi, a). |
Wang Feng. 10/23/08 |
Page 230, Example 3.15second para, line 2 |
IUT contains M states | IUT contains m states |
Author 10/21/09 |
|
Page 232, line -6 |
δ(q1, bab) = q5 |
δ(q1, bab) = q1 |
Wang Feng. 10/23/08 |
|
Page 233, line 5 |
T2=R⊗ω=({a}‧W1)∪({bb}‧W4)∪({bab}‧W5)∪({baab}‧W5)∪({baaab}‧W5)∪({baaaa}‧W1)
|
T2=R⊗ω=({a}‧W1)∪({bb}‧W4)∪({bab}‧W1)∪({baab}‧W5)∪({baaab}‧W5)∪({baaaa}‧W1)
={abaaa, aaa, aa}∪{bba,
bbaaa}∪{babbaaa,
babaa, baba}∪
{baaba, baabaaa}∪{baaaba,
baaabaaa}∪
{baaaabaaa, baaaaaa, baaaaa} |
Wang Feng. 10/23/08 |
|
Page 236, line 8 |
baaaba, baaabaa, baaabaaa, baaabaaa |
baaaba, baaabaa, baaabaaa, baaabbaaa |
Wang Feng. 10/23/08 |
| Page 236, line 13 | =(R⊗ω)∪R‧X⊗ω) | =(R⊗ω)∪((R‧X)⊗ ω) | Wang Feng. 10/23/08 |
| Page 236, line 14 | R⊗ω=({a}‧W1)∪({bb}‧W4)∪({baab}‧W5)∪{bab}‧W1∪{baaab}‧W1∪{baaaa}‧W5 ={abaaa, aaa, aa, bba, bbaaa, baaaba, baaabaaa} | R⊗ω=({a}‧W1)∪({bb}‧W4)∪({bab}‧W1)∪({baab}‧W5)∪({baaab}‧W5)∪({baaaa}‧W1) ={abaaa, aaa, aa, bba, bbaaa, babbaaa, babaa, baba, baaba, baabaaa, baaaba, baaabaaa, baaaabaaa, baaaaaa, baaaaa} | Wang Feng. 10/23/08 |
| Page 236, line 17 | R‧Xω=(aa‧W1)∪(ab‧W4)∪
|
(R‧X) ⊗ω={aa, ab, bba, bbb, baba, babb, baaba, baabb, baaaba,baaabb,
baaaaa, baaaab}⊗W
=(aa‧W1)∪(ab‧W4)∪
|
Wang Feng. 10/23/08 |
| Page 237, line -1 | δ(s, in(UIO(s))=out(UIO(s)). | δ(s, in(UIO(s))) = t and O(s, in(UIO(s))) = out(UIO(s)). | Wang Feng. 10/23/08 |
| Page 263, Figure 3.24 | q2: b/1 and a/0 | q2: b/0 and a/1 | Author. 10/20/2009 |
| Page 263, first line below Figure 3.24 | qk=δ(qi, b, and qi... | qk=δ(qi, b), and qi... | Author. 10/20/2009 |
| Page 263, Example 3.38, second para, line 2 | ..output error in state q3.. | ...transfer error in state q3.. | Author. 10/20/2009 |
| Page 268, line 1 | ..test seqences.. | "..test sequences.. | Author. 10/20/2009 |
| Page 290, Example 4.9, line 2 | fault in Example 4.1 | fault in Program 4.1 | Author. 10/20/2009 |
| Page 290, Example 4.9, para 2, line 2 | x, y∈{-1, 1} | x∈{-1, 1}, y∈{-1, 0} | Yu Leng. October 6, 2010 |
| Page 291, line above section 4.3.1 | x=-1, y=1, z=1 | x=1, y=-1, z=1 | Yu Leng. October 6, 2010 |
| Page 293, second para from the bottom, line 2 | module arithmetic | modulo arithmetic | Author. 10/20/2009 |
| Page 299, end of line 1 in Step 1 in the algorithm | 2k-i |
2k-1
|
Praveen Ranjan Srivastava.
4/21/08
|
| Page 308, table, block 3, row 2, column 3 | 4 | 2 | Author. 11/4/2009 |
| Page 333, Exercise 4.23, first line below Factor Coupling | where s and s belong to | where r and s belong to | Aditya Mathur. 11/1/2009 |
| Page 333, Exercise 4.23, line 5 below Factor Coupling | among one of more factors | among one or more factors | Aditya Mathur. 11/1/2009 |
| Page 350, table at the top, row corresponding to test t3 | main.2, g1.start, g1.1, g1.2, g1.End, main.2 | main3, g2.start, g2.1, g2.3, g2.End, main.3 | Praveen Ranjan Srivastava. 5/14/08 |
| Page 355, line 7 from the top | Mark G.main.1 | Mark G.main.2 | Praveen Ranjan Srivastava. 3/9/09 |
| Page 375. Section 5.8.2. First two lines of Input. | C(i,j) is 0 if test ti covers entity j, else it is 1 | C(i,j) is 1 if test ti covers entity j, else it is 0 | Praveen Ranjan Srivastava. 3/6/09 |
| Page 381, line just above Program P7.4 | containerprogram | container program | Praveen Ranjan Srivastava. 3/26/08 |
| Page 413, line labled 10 in the program | while (request ≠ exit) | while (true) | Aditya Mathur 4/19/2011 |
| Page 413, line below the program | three tests have been | three tests has been | Aditya Mathur 4/15/2009 |
| Page 418, Section 6.2.2, oara 2, line 4 | <, <, > | <, <=, > | Marco Aurèlio Graciotto Silva. 12/8/2009 |
| Page 420, line 4 above Section 6.2.3 | decesion | decision |
Jim Mapel, 7/23/2009 |
| Page 421, Program P6.7, line 7 | Indentation of comment | Correct the indentation of that part of the comment which overflows to the following line. | Vahid Garousi. 7/17/08 |
| Page 421, equation just above the last para | T'' | T' | Vahid Garousi. 7/17/08 |
| Page 421, line 1 of last para | all tests in T | all test in T' | Vahid Garousi. 7/17/08 |
| Page 424, Table 6.1, entry in ast row and last column | foo1(x, y) | No change needed. Note that this is a specification and not what P6.8 actually computes. The error was reported incorrectly. | Praveen Ranjan Srivastava. 2/20/08. Change on April 7, 2009 by Aditya Mathur. |
| Page 425, Program P6.9, line 5 | foo-1 | foo1 | Vahid Garousi. 7/17/08 |
| Page 425, Program P6.9, line 7 | foo-2 | foo2 | Vahid Garousi. 7/17/08 |
| Page 426, line 5 | multiple-condition-coverage criterion | condition/decision coverage criterion | Marco Aurèlio Graciotto Silva. 12/8/2009 |
| Page 427, line 1 | 1 and 3 | 1 and 4 | Vahid Garousi. 7/17/08 |
| Page 427, line 2 | 2 and 4 | 2 and 3 | Vahid Garousi. 7/17/08 |
| Page 427, test set T' | t4: <A=2, B=1, C=5> | t4: <A=2, B=1, C=1> | Vahid Garousi. 7/17/08 |
| Page 427, definition of Multiple condition coverage, line 6 | if the condition coverage of T | if the multiple condition coverage of T | Marco Aurèlio Graciotto Silva. 12/8/2009 |
| Page 430, Example 6.10, line 2 | font of g | Change the font of g | Vahid Garousi. 7/17/08 |
| Page 441, formula for MCc |  |
 |
Roc Zhang. 10/26/2010 |
| Page 450, second table, row labeled t3, rightmost column | No | Yes | Vahid Garousi. 7/17/08 |
| Page 470, third line from the bottom | the second occurrence of 6-2 | 6-3 | Praveen Ranjan Srivastava. 5/14/08 |
| Page 470, Example 6.37, second para, line 1 | labeled y>0 is | labeled y>= 0 is | Vahid Garousi. 7/17/08 |
| Page 471, para 3, line 1 | the second occurrence of 6-2 | 6-3 | Author. 5/14/08 |
| Page 475, Section 6.4.7, line 3 | OEDC(K) | OEDC(k) | Vahid Garousi. 7/17/08 |
| Page 475, section 6.4.7, second item in the enumerated list | arrives at n along | arrives at k along | Vahid Garousi. 7/17/08 |
|
Page 494, Table 6.12, rightmost column |
f3(x,y,z) |
f2(x,y,z) |
Vahid Garousi. 7/17/08 |
|
Page 494, Table 6.12, rightmost column |
f4(x,y,z) |
f2(x,y,z) |
Vahid Garousi. 7/17/08 |
|
Page 494, Table 6.12, rightmost column |
f3(x,y,z) |
1, 2, 3, and 4 should be subscripts for f1, f2, f3, and f4 |
Vahid Garousi. 7/17/08 |
|
Page 497, Exercise 6.23, line 6 |
C=C1 or C2 or .... |
C=C1 or C2 or ... [1 becomes subscript in C1.] |
Vahid Garousi. 7/17/08 |
|
Page 497, Exercise 6.23, line 7 |
i1 |
i-1 |
Vahid Garousi. 7/17/08 |
|
Page 497, 6.24, statement labeled 14 |
(x<y or |
(x<y) or |
Vahid Garousi. 7/17/08 |
|
Page 497, 6.26, line 3 |
LCSAJ(MC/DC) |
MC/DC(LCSAJ) |
Vahid Garousi. 7/17/08 |
|
Page 498, 6.29, line 1 |
Is test case t in |
Is the test set T containing t only est case tp in |
Vahid Garousi. 7/17/08 |
|
Page 498, 6.29, line 3 |
if t is inadequate |
of T is inadequate |
Vahid Garousi. 7/17/08 |
|
Page 500, 6.37, line 1 |
Example 6.35 lists |
Example 6.34 lists |
Vahid Garousi. 7/17/08 |
|
Page 534, line 3 from the top |
L=link[L]; |
Should be indented to left align with statement 9. |
Vahid Garousi. 7/17/08 |
|
Page 534, line 3 from the top |
sum+data |
sum+data[L] |
Vahid Garousi. 7/17/08 |
|
Page 534, line 7 from the bottom |
sum+data |
sum+data[L] |
Vahid Garousi. 7/17/08 |
|
Page 534, line 2 from the bottom |
midCond |
Change font to match previous occurrencves |
Vahid Garousi. 7/17/08 |
|
Page 535, lines 1 and 2 |
sum |
SUM |
Vahid Garousi. 7/17/08 |
|
Page 535, line below equation (7.3) |
However, condition (7.1) will not |
However, condition (7.2) will not |
Vahid Garousi. 7/17/08 |
|
Page 608, 7.13, (a) line 4 |
obtained my mutating |
obtained by mutating |
Vahid Garousi. 7/17/08 |
|
Page 610, 7.20, item labeled 4 |
A |
^ |
Author. 6/6/08 |
|
Page 610, 7.20, line 5 |
y=x+1 |
Indent this line to align with line 4 |
Vahid Garousi. 7/17/08 |
|
Page 610, 7.20, lines 3 and 5 above the last para of this exercise |
Indent these lines to align with those above |
Vahid Garousi. 7/17/08 |
|
|
Page 612, 7.26, item 4 before item 6 |
4. It is applicable |
5. It is applicable |
Author. 6/6/08 |
|
Page 612, 7.27, line 2 |
MIller |
Miller |
Author. 6/6/08 |
|
Page 613, Step 3.3 |
{t1, t2} |
{t1, t2, t4} |
Praveen Ranjan Srivastava. 3/26/08 |
|
Page 615, reference item 8, line 2 |
AMC press |
ACM Press |
Author. 6/6/08 |
| Page 634, reference 288 | Leveson, N. G. and A. Dupuy | Dupuy, A. and N. G. Leveson | Aditya Mathur 11/17/2009 |
Corrected version of the Table on
page xvii:
| Purpose |
Tool |
Source |
|
Combinatorial Designs |
AETG |
Telcordia Technologies |
|
Code Coverage Measurement |
Test manager (TM) |
IBM Rational (TM) |
|
JUnit |
Freeware |
|
|
CodeTest |
Freescale Semiconductor |
|
|
xSuds |
Telcordia Technologies |
|
|
Defect Tracking |
Bugzilla |
Freeware |
|
FogBugz |
Fog Creek Software |
|
|
GUI Testing |
WebCorder |
Cromson Solutions |
|
jfcUnit |
Freeware |
|
|
Mutation Testing |
muJava |
Professor Jeff Offutt (offutt@ise.gmu.edu) |
|
Proteum |
Professor Jose Maldonado (jcmaldon@icmc.usp.br) |
|
|
Performance Testing |
Performance Tester |
IBM Rational (TM) |
|
JMeter |
Apache for Java |
|
|
Regression Testing |
Eggplant |
Redstone Software |
|
xSuds |
Telcordia Technologhies |
|
|
Test Management
|
ClearQuest (TM) |
IBM Rational (TM) |
|
TestManager |
IBM Rational (TM) |
Latest update November 26, 2011