Foundations of Software Testing, First Edition Aditya P. Mathur	Reward for reporting an error: US$2/first report. Minimum amount given US$5. Reward given twice an year: Jan 1 and July 1.
	Errata	Errata
home

Sincere thanks to Praveen Ranjan Srivastava, BITS, Pilani, India, Vahid Garousi, University of Calgary, Canada, Trupti Gandhi, Patni Computers, Eric Wong, UT Dallas, 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, Natalia Silvis, Ali Bou Nassif (Canada), Mohamed Shihab (India): and Mark Paulk, UT Dallas for a careful reading and reporting of errors.

A very special THANK YOU to Mr Feng Wang, Beijing, China, for a word by word reading of the entire book and for clearly pointing out the errors and suggestions for corrections.

Latest update: April 24, 2013.

The errors listed below, and marked with a "YES" in the rightmost column, have been removed from the second edition of the book. The second edition is scheduled to be on the market in June 2013.

Total errors/edits reported: 506
Wang Feng (China): 343. Lyle Goldman: 67 (US), Vahid Garousi (US): 34. Author: 24. Praveen Srivastava (India): 13. Natalia Silvis (Netherlands): 4. Eric Wong (US): 3. Marco Aurélio Graciotto Silva (Brazil): 3. Trupti Gandhi (India): 1. Jim Mapel (US): 1. Rakesh Veeramacheneni (US): 1. Bryan Tomayko (US): 1. Fabian Alenius (US): 1, Roc Zhang (PRC): 1 Xiangyu Zhang (US): 1. Ali Bou Nassif (Canada): . Mohamed Shihab (India): 1; Mark Paulk (US): 3

The rightmost column indicates whether or not the error has been removed and will not appear in the second edition. The second edition will likely be on the market sometime in the fall of 2013.

Location (-x points to a line from the bottom of the page)	Replace (or edit) this	by this (or simply do what is indicated inside square brackets)	First reported by	*Corrected in second edition?
Preface and acknowledgements
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
Chapter 1 Basics of software testing [This chapter has been split into two chapters in the Second Edition. The first chapter contains testing related basics and the second chapter contains mathematical preliminaries.]]
Page 6, Figure 1.1, the No link in the oval labeled "are these the same?"	failure	failure	Natalia Silvis. March 16, 2011	Yes
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	Yes
Page 11, third line of second paragraph under Example 1.3	of sort program	of the sort program	Lyle Goldman. August 29, 2010	Yes
Page 12, Example 1.4, last line	pair integers	pair	Lyle Goldman. August 29, 2010	Yes
Page 15, last para, line 2	incorrect result	an incorrect result	Lyle Goldman. August 29, 2010	Yes
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	Yes
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	Yes
Page 21, Figure 1.4	num_item	num_items	Natalia Silvis. March 16, 2011	Yes
Page 21, first para, line 2	get-input	get_input	Lyle Goldman. August 29, 2010	Yes
Page 21, first para, line 4	in-numbers	in_numbers	Natalia Silvi. March 16, 2011	Yes
Page 21, second para, next -to-last-line	print-sequence	print_sequence	Lyle Goldman. August 29, 2010	Yes
Page 23, Example 1.15, lines 4-5	pulling down of the menu	the pulling down of the menu	Lyle Goldman. August 29, 2010	Yes
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	Yes
Page 25, second full para, line 2	might make error	might make an error	Lyle Goldman. August 29, 2010	Yes
Page 26, first para of 1.5.6, line next-to-last-line	automated oracle	an automated oracle	Lyle Goldman. August 29, 2010	Yes
Page 28, 1.6.1, para 2, line 6	defects per KLOC.	defects per KLOC."	Wang Feng August 16, 2011	Yes
Page 30, line 4	CFG G	CFG G	Lyle Goldman. August 29, 2010	Yes
Page 30, line 10	CFG G	CFG G	Lyle Goldman. August 29, 2010	Yes
Page 30, Table 1.2 line 2 from the bootom	2/n1 x n2/N2	n1/2 x N2/n2
Page 31, Table 1.3	Lower subscript of the summation (n=1)	i=1	Lyle Goldman. August 29, 2010	Yes
Page 32, second para, 1.6.7, line 4	dynamic metric	a dynamic metric	Lyle Goldman. August 29, 2010	Yes
Page 36, last line	the AT&T	AT&T	Lyle Goldman. August 29, 2010	Yes
Page 38, Example 1.21, last line	1, 3, 4, 5, 9	1, 3, 4, 5, 7, 9	Wang Feng August 16, 2011	Yes
Page 40, Fig. 1.12	missing arrow	Add an arrow from the box lwith text "Algebraic and logic specifications	Lyle Goldman. August 29, 2010	Yes
Page 41, last para before 1.12, fourth line from the end	effected	affected	Lyle Goldman. August 29, 2010	Yes
Page 44, line 2 (not counting the figure caption)	bock	block	Lyle Goldman. August 29, 2010	Yes
Page 44, line 6 (not counting figure)	bock	block	Lyle Goldman. August 29, 2010	Yes
Page 44,line -6	A more complex module is likely to have more errors and must be accorded higher priority during inspection than a lower priority module.	A more complex module is likely to have more errors and must be accorded higher priority for inspection than a module with lower complexity.	Wang Feng August 16, 2011	Yes
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	Yes
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	Yes
Page 49, Example 1.24	---	Add (8, 9) to E	Lyle Goldman. August 29, 2010	Yes
Page 50, Para 2, line 2	(3, 5), 6, 8)	(3, 5), (6, 8)	Lyle Goldman. August 29, 2010	Yes
Page 51, Fig. 1.17	---	Make edge 7-8 bold and 7-9 normal	Lyle Goldman. August 29, 2010	Yes
Page 51, line 1	paths of lengths 4 and 5	paths of lengths 3 and 4	Lyle Goldman. August 29, 2010	Yes
Page 51, line 15	paths of lengths 11 and 8	paths of lengths 10 and 7	Lyle Goldman. August 29, 2010	Yes
Page 52 lines 1, and 2	The successor and predecssor sets are incorrect as per the definition on page 50.	The notion of immediate successor and succesor is introduced. Similarly the notion of immediate predecessor and predecessor is introduced.	Wang Feng August 16, 20111	Yes
Page 53, Program P1.3	, power	Nothing (this variable is useless)	Praveen Ranjan Srivastava. 2/20/08	Yes
Page 55, second para, line 1	n is the immediate	n is the immediate	Lyle Goldman. August 29, 2010	Yes
Page 56, last para, line 3	an output statement	output statement	Lyle Goldman. August 29, 2010	Yes
Page 59, para 3, line 6	| s |	| s |	Lyle Goldman. August 29, 2010	Yes
Page 60, text under "Regular Expression", last line of last bulleted item	{ e } L1 U L2	L1 U L2	Lyle Goldman. August 29, 2010	Yes
Page 68, second para from the bottom, line 2	to testing of programs	to the testing of programs	Lyle Goldman. August 29, 2010	Yes
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	Yes
Page 69, para 2, line 1	batch-processing application	a batch-processing application	Lyle Goldman. August 29, 2010	Yes
Page 69, para 2, line 3	cardiac pacemaker is where	cardiac pacemaker, is where	Lyle Goldman. August 29, 2010	Yes
Page 69, Table 1.7, line 17	Requirement testing	Requirements testing	Wang Feng August 16, 2011	Yes
Page 69, Table 1.7, line 18	Software Software testing	Remove this line	Wang Feng August 16, 2011	Yes
Page 73, Example 1.32, first para, line 3	Fahrenheit scale	the Fahrenheit scale	Lyle Goldman. August 29, 2010	Yes
Page 79, para 4, line 2	resorting	resorting	Lyle Goldman. August 29, 2010	Yes; slightly revised
Page 79, para 4, line 4	All of Part II	Part II	Author. October 4, 2010	Yes, slightly revised
Page 81, left column, complete para 2, line 5	"The T experiments..."	The T-experiments by Hatton are specially significant as these are part of a large scale study involving about 5 million lines of scientific software written in Fortran and C languages and report faults and failures.	Wang Feng August 16, 2011	Yes
Page 83, left column, line 18	[183].	[183]	Lyle Goldman. August 29, 2010	Yes
Page 83, right column, line --9	fault coverage and requirements	fault coverage requirements	Wang Feng August 16, 2011	Yes
Page 85, line -6	GO	Go	Wang Feng August 16, 2011	Yes
Page 87, line -8	(iv) inputs A and B stuck at 1.	(iv) inputs A and B stuck at 0.	Wang Feng August 16, 2011	Yes
Page 88, Exercise 1.19, line 2	might not be	would not be	Lyle Goldman. August 29, 2010	Yes
Chapter 2 Test Generation from Requirements. [This chapter has been split into two chapters in the Second Edition and new material added. One chapter introduces techniques based on explicit partitiong of the input domain. The other chapter is based on technquues that focus on predicates.]
Page 97, para 1, lines 5-6	inputs less than or equal to	inputs less than	Lyle Goldman. September 27, 2010	Yes
Page 99, line 1	message on either of the	message on each of the	Lyle Goldman. September 27, 2010	Yes
Page 99, table, line 3	Kellog	Kellogg's	Lyle Goldman. September 27, 2010	Yes
Page 102, section 2.3.3, first para, line 2	in the table	in the tables	Lyle Goldman. September 27, 2010	Yes
Page 105, line 8	digit	a digit	Lyle Goldman. September 27, 2010	Yes
Page 107, Example 2.7, line 4	2.2 x and y	2.2 to x and y	Lyle Goldman. September 27, 2010	Yes
Page 109, Para 2 (step 1), line 9	tested, is likely	tested are likely	Lyle Goldman. September 27, 2010	Yes, revised
Page 109, Para (step 2) , line 5	on the the expected	on the expected	Lyle Goldman. September 27, 2010	Yes
Page 110, line 2	Sections 2.2, 2.6,	Sections 2.2 and 2.6,	Lyle Goldman. September 27, 2010	Yes
Page 110, step 4, line 3	during test	during a test	Lyle Goldman. September 27, 2010	Yes
Page 110, step 4, last line of first para	certain equivalence class	certain equivalence classes	Lyle Goldman. September 27, 2010	Yes
Page 111, para above table, line 5	requirements, identify	requirements and identify	Lyle Goldman. September 27, 2010	Yes
Page 112, table , second row	f_valid	f_valid	Lyle Goldman. September 27, 2010	Yes
Page 112, table, third row	{c-invalid}	{c_invalid}}	Author. October 5, 2010	Yes
Page 112, table, last row	{t_valid}, {t_invalid}	{-10},{-5}, {5}, {10}, t_invalid	Wang Feng August 16, 2011	Yes
Page 113, line 14	with similar argument	with a similar argument	Lyle Goldman. September 27, 2010	Yes
Page 116, para 1, last line	set to 10	set to -5	Lyle Goldman. September 27, 2010	Yes
Page 116, Example 2.10, line 3	classes is only 18	classes is only 14	Lyle Goldman. September 27, 2010	Yes
Page 116, line 6 from bottom	GUI, a file	GUI, a_file	Lyle Goldman. September 27, 2010	Yes
Page 116, last line	classes of each	class of each	Lyle Goldman. September 27, 2010	Yes
Page 118, line 2 from the bottom	GUI needs to be	the GUI needs to be	Lyle Goldman. September 27, 2010	Yes
Page 118, line -4	test design process	GUI design process	Wang Feng August 16, 2011	Yes
Page 119, line 8	values at and near	values at or near	Wang Feng August 16, 2011	Yes
Page 119, line -5	A procedure to generate tests using boundary value-analysis and an illustrative example follows.	An illustrative example to generate tests using boundary value-analysis follows.	Wang Feng August 16, 2011	Yes
Page 121, program fp	code<99 && code>999	code<99 || code>999	Mohamed Shihab January 15, 2013	TBC
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	Yes
Page 122, Example 2.12, line 6	value of x implies	value of p implies	Lyle Goldman. September 27, 2010	Yes
Page 122, Example 2.12, last para	x=0	p=0	Lyle Goldman. September 27, 2010	Yes
Page 122, Example 2.12	apply boundary-value analysis	apply the boundary-value analysis	Lyle Goldman. September 27, 2010	Yes
Page 123, line 1	x=0	p=0	Lyle Goldman. September 27, 2010	Yes
Page 122, Example 2.12, para 3, line 6	E1 and E2 contain	E1 and E3 contain	Lyle Goldman. September 27, 2010	Yes
Page 123, fourth line after definition of T	to generate t3	to generate t4	Lyle Goldman. September 27, 2010	Yes
Page 124, test t6	s="Laughter"	s="aughter"	Wang Feng August 16, 2011	Yes
Page 124, test t9	" heard"	"heart.d"	Wang Feng August 16, 2011	Yes
Page 122-124		Use the fonts for E consistently. All fonts for E changed to roman with subscripts.	Wang Feng August 16, 2011	Yes
Page 126, table at the bottom, line 2 against coulmn labeled 0	soap	soup	Wang Feng August 16, 2011	Yes
Page 128, lines under subheading Parameters	Length Valid Invalid Others	length valid invalid others	Wang Feng August 16, 2011	Yes
Page 129, line 13	Contents	contents	Wang Feng August 16, 2011	Yes
Page 129, lines -5 and -4	if P if P and P2	if P1 and P2	Wang Feng August 16, 2011	Yes
Page 130, Example 2.16, line 2	from Example 2.16	from Example 2.15	Wang Feng August 16, 2011	Yes
Page 130, lines -7 and -3	Code Leftmost digit	code leftmost digit	Wang Feng August 16, 2011	Yes
Page 131, line 3	Code	code	Wang Feng August 16, 2011	Yes
Page 132, line 8	160	128	Wang Feng August 16, 2011	Yes
Page 135, Figure 2.11	and R) and among effects (M).	and R).	Wang Feng August 16, 2011	Yes
Page 138 C1 through C8 below second para		Change C1 through C8 to their subscripted versions	Wang Feng August 16, 2011	Yes
Page 139, second para, line 4	effects E1 through E4	effects Ef1 through Ef4	Author. 5/9/08	Yes
Page 140, Input in Procedure for generating	(a) A cause	A cause	Wang Feng August 16, 2011	Yes
Page 142, para 2, line 3	Step 2	Step 2.2	Wang Feng August 16, 2011	Yes
Page 144, second para, line 2	first and fourth combinations	second and fourth combinations	Praveen Ranjan Srivastava. 2/20/08	Yes
Page 144, table below the second para, second row	1 0 1 0	1 0 0 1	Trupti Gandhi. 9/17/08	Yes
Page 146, Table 2.4, under Desired State column, row labeled 1, line 3	those for which n1=n2=1	those for which n1=n2=0	Wang Feng August 16, 2011	Yes
Page 146, Table 2.4, under Desired State column, the row labeled 0 second time, line 9	(1, 0), (0, 1)	(0, 0), (0, 1)	Wang Feng August 16, 2011	Yes
Page 147, second para, line 7	C1 and C2	C2 and C3	Wang Feng August 16, 2011	Yes
Page 148, para 1, line 6	n1=n2=1	n1=n2=0	Wang Feng August 16, 2011	Yes
Page 148 para 4, lines 3 and 5	by combinations two or more combinations	by tests two or more tests	Wang Feng August 16, 2011	Yes
Page 149, complete para 1, last line	values or input	values of input	Wang Feng August 16, 2011	Yes
Page 150, last line of para 2	a and b	e1 and e2	Wang Feng August 16, 2011	Yes
Page 151, para 6 first line	1<=(i,j)<=k	1<=i<=k, 1<=j<=k	Wang Feng August 16, 2011	Yes
Page 155, Example 2.23, line 1	Consider the predicate p	Consider the predicate pr	Author	Yes
Page 158, row 7 column t1 of Table 2.6	true	false	Fabian Alenius. 10/6/2009	Yes
Pge 158, section 2.7.5, line 2	tests cases	test cases	Author March 21, 2013	Yes
Page 160 first line	2.7.5	Remove the section number	Wang Feng August 16, 2011	Yes
Page 160, Step 1	S(N). For each leaf SN={t, f}	S(N), for each leaf SN={t, f}.	Wang Feng August 16, 2011	Yes
Page 161, line -5	(t)	t	Wang Feng August 16, 2011	Yes
Page 162, para 3	SN1 on the left side of each of the three equations	SN4	Praveen Ranjan Srivastava. 2/25/08	Yes
Page 163, para following relop definitions	BRO-CSET	BOR-CSET	Wang Feng August 16, 2011	Yes
Page 163, Step 1, line 2	S(N)	Use N as subscript	Wang Feng August 16, 2011	Yes
Page 164, first equation for SN4	^	"onto" operator	Praveen Ranjan Srivastava. 2/25/08	Yes
Page 164, second equation for SN4	<	"set union" operator	Praveen Ranjan Srivastava. 2/25/08	Yes
Page 165, line 8	(>, , f)	(>, f)	Wang Feng August 16, 2011	Yes
Page 165, line 14	four	five	Wang Feng August 16, 2011	Yes
Page 165, 2.7.5.3	2.7.5.3	Remove section number	Wang Feng August 16, 2011	Yes
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	Yes
Page 165, Table 2.8 , label of column 3 from the left	p	pr	Eric Wong. 9/15/08	Yes
Page 167, Figure 2.20	e	epsilon	Wang Feng August 16, 2011	Yes
Page 169, Step 2	i≠j	j≠i	Wang Feng August 16, 2011	Yes
Page 169, Step 3 and 5	p(c)	E(c)	Wang Feng August 16, 2011	Yes
Page 169, Step 4, line 2	lj	li	Wang Feng August 16, 2011	Yes
Page 169, line -4	){	)}	Wang Feng August 16, 2011	Yes
Page 169, Procedure MI-CSET, step 5 last line	true	false	Mark Paulk May 30, 2013	No
Page 170, line 1	tests	constraints	Wang Feng August 16, 2011	Yes
Page 170, line 4	tests	constraints	Wang Feng August 16, 2011	Yes
Page 170, lines 19 and 21	FSe2,1 FSe2,3	Fe21 Fe2,3	Wang Feng August 16, 2011	Yes
Page 170, third definition of FS	t, t	t,t,f,t	Wang Feng August 16, 2011	Yes
Page 170, line -12	The test set	The constraint set	Wang Feng August 16, 2011	Yes
Page 170, line -9	(t,f,t,f) (t,t,f,t)	(t,f,t,f), (t,t,f,t)	Wang Feng August 16, 2011	Yes
Page 171, Step 3	singular	non-singular	Wang Feng August 16, 2011	Yes
Page 171, line -7	Se4	Se1 [do this twice]	Wang Feng August 16, 2011	Yes
Page 172, Para 2, line 2	Se2	Add supoerscript f	Wang Feng August 16, 2011	Yes
Page 172, Para 2	Definitions of F and FS	Replace the subscript for each u and v by a superscript	Wang Feng August 16, 2011	Yes
Page 172, Para 2, l2	(f,f,f)	(f,t,f)	Wang Feng August 16, 2011	Yes
Page 172, Para 3, lines 3 and 4	4	1	Wang Feng August 16, 2011	Yes
Page 172, lines -6 and -4	4	1	Wang Feng August 16, 2011	Yes
Page 172, last line	,}	}	Wang Feng August 16, 2011	Yes
Page 173, line -2	reasons, First	reasons. First	Wang Feng August 16, 2011	Yes
Page 174, line 1	Once	Second, once	Wang Feng August 16, 2011	Yes
Page 174, last line	{(	(	Wang Feng August 16, 2011	Yes
Page 174, Fig 2.22 (b)	Node N5	Add false below r>s	Wang Feng August 16, 2011	Yes
Page 175, para 3, line 2	BRO	BOR	Wang Feng August 16, 2011	Yes
Page 179, Program P2.3, line 11	C, D	c, d	Wang Feng August 16, 2011	Yes
Page 181, para 2, line -2	revison	revision	Wang Feng August 16, 2011	Yes
Page 181, right column, para 2, line 12	Celantano	Celentano	Wang Feng August 16, 2011	Yes
Page 181, left column, para 3, line 7	Amman	Ammann	Wang Feng August 16, 2011	Yes
Page 185, 2.8, line 3	testing	partitioning	Wang Feng August 16, 2011	Yes
Page 187, 2.19, line 2	page 114		Wang Feng August 16, 2011	Yes
Page 189, 2.26, lines 6 and 7	C 1 C2	C3 C4	Wang Feng August 16, 2011	Yes
Page 189, line -4	c==d	c=d	Wang Feng August 16, 2011	Yes
Page 190, line 1	BRO adequate	BRO-adequate	Wang Feng August 16, 2011	Yes
Page 190, Exercise 2.31, first line	p:	pr:	Eric Wong. 9/15/08	Yes
Page 190, 2.31, line 5	four	five	Wang Feng August 16, 2011 Mark Paulk Feb 18, 2013	Yes
Page 190, 2.32, lines , 2, 3	For predicate pr, the BRO-adequate test set TBOR in Table 2.7 contains one more test case than the BOR-adequate test set TBRO in Table 2.8.	For predicate pr, the BRO-adequate test set TBRO in Table 2.8 contains one more test case than the BOR-adequate test set TBOR in Table 2.7.	Wang Feng August 16, 2011	Yes
Page 190, 2.34, line 2	BOR	BRO	Wang Feng August 16, 2011	Yes
Page 191, 2.37, line 4	p	pr	Wang Feng August 16, 2011	Yes
Page 191, 2.38, line 2	p: a+b. Do	pr: a+b. (a) Do	Wang Feng August 16, 2011	Yes
Page 191, 2.39, line 1	page 153	Section 2.7.5.4	Wang Feng August 16, 2011	Yes
Page 191, 2.39, line 1	SE	Sei	Wang Feng August 16, 2011	Yes
Page 192, Figure 2.25	cause-effect effct	cause-effect	Wang Feng August 16, 2011	Yes
Chapter 3 Test Generation from Finite State Models [This chapter remains unchanged in the Second Edition except for its number.]
Page 199, line 3	e)	ε	Wang Feng August 16, 2011	Yes
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	Yes
Page 202, line -6	……, such that σ and a＇are equivalent and ……	……, such that σ and σ＇ are equivalent and ……	Wang Feng. 10/23/08	Yes
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	Yes
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	Yes
Page 211, line -5	We caution the reader in that the technique ……	We caution the reader that the technique ……	Wang Feng. 10/23/08	Yes
Page 215, 3.5.1, para 2, lines 4, 5, and 6	Subscripts of k	Make i and j the subscripts of k	Wang Feng. 10/23/08	Yes
Page 219, line -4	zb=b	z=zb	Wang Feng. 10/23/08	Yes
Page 219, line -2	Step 2(b)(ii)	Step 2(b)(iii)	Wang Feng. 10/23/08	Yes
Page 220, line -17	2(b)(ii)	2(b)(ii) and (iii)	Wang Feng. 10/23/08	Yes
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	Yes
Page 220, line -5	As O(q3, a)=O(q4, a),	As O(q3, a)≠O(q4, a),	Wang Feng. 10/23/08	Yes
Page 221, line 8	o(Si, x) ≠ o(Sj, x)	O(si, x) ≠ O(sj, x)	Wang Feng. 10/23/08	Yes
Page 221, line 19	for some j,	for any j,	Wang Feng. 10/23/08	Yes
Page 221, 3.5.3, para 4, line 2	W- and Wp methods	W- and Wp-methods	Wang Feng. 10/23/08	Yes
Page 221, last line	as an IUT	as an IUT.	Wang Feng. 10/23/08	Yes
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	Yes
Page 225, line -6	ba, baa, baaa, bbaaa, bba,	ba, baa, baaa, bbaaa,	Wang Feng. 10/23/08	Yes
Page 225, 3.6.5, T=P.Z	{e	{ε	Wang Feng. 10/23/08	Yes
Page 226, 3.6.6, parabelow item 3 in tne enumeration	However, if we assume that (a) the specification is error free, (b) M(t) and Mi(t) have been determined without any error, and (c) the comparison between M(t) and Mi(t) is correct, then indeed M(t)¹Mi(t) implies an error in the design or the IUT under test.	However, if we assume that (a) M(t) and Mi(t) have been determined without any error, and (b) the comparison between M(t) and Mi(t) is correct, then indeed M(t)¹Mi(t) implies an error in the design or the IUT.	Wang Feng. 10/23/08	Yes
Page 228, line -15	M(t)=M1(t)	M(t)≠M1(t)	Wang Feng. 10/23/08	Yes
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	Yes
Page 230, Example 3.15, second para, line 2	IUT contains M states	IUT contains m states	Author 10/21/09	Yes
Page 232, line -6	δ(q1, bab) = q5	δ(q1, bab) = q1	Wang Feng. 10/23/08	Yes
Page 232, , definition of T1, line 3	baaa	baaaa	Wang Feng. 10/23/08	Yes
Page 233, line1	q1, q4, q5, q5, q5, and q1,	q1, q4, q1, q5, q5, and q1,	Wang Feng. 10/23/08	Yes
Page 233, line 5	T2=R⊗ω=({a}‧W1)∪({bb}‧W4)∪({bab}‧W5)∪({baab}‧W5)∪({baaab}‧W5)∪({baaaa}‧W1) ={abaaa, aaa, aa}∪{bba, bbaaa}∪{baba, babaaa}∪ ={baaba, baabaaa}∪{baaaba, baaabaaa}∪{baaaabaaa, baaaaaa, baaaaa}	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	Yes
Page 233, para 2	Note that T contains a total of 34 tests, 20 from T1 and 14 from T2. This is in contrast to the 44 tests generated using the W-method in Example 3.12 when m = n.	Note that T contains a total of 21 tests. This is in contrast to the 29 tests generated using the W-method in Example 3.12 when m = n.	Wang Feng. 10/23/08	Yes
Page 233, line -6	110100	1101000	Wang Feng. 10/23/08	Yes
Page 236, line 8	baaaba, baaabaa, baaabaaa, baaabaaa	baaaba, baaabaa, baaabaaa, baaabbaaa	Wang Feng. 10/23/08	Yes
Page 236, line 13	=(R⊗ω)∪R‧X⊗ω)	=R‧X⊗ω	Wang Feng. 10/23/08	Yes
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	Yes
Page 236, line 17	R‧Xω=(aa‧W1)∪(ab‧W4)∪ (bba‧W3(∪(bbb‧W4)∪ (baaba‧W2) ∪(baabb‧W5) ∪ (baba‧W1) ∪(babb‧W4) ∪ (baaaba‧W2) ∪(baaabb‧W5) ∪ (baaaaa‧W1) ∪(baaaab‧W5) ={aabaaa, aaaa, aaa, aba, abaaa, bbaa, bbaaa, bbba, bbbaaa, baababaaa, baabaaa, baabaa, baabba, baabbaaa}	(R‧X) ⊗ω={aa, ab, bba, bbb, baba, babb, baaba, baabb, baaaba,baaabb, baaaaa, baaaab}⊗W =(aa‧W1)∪(ab‧W4)∪ (bba‧W3)∪(bbb‧W4)∪ (baaba‧W2) ∪(baabb‧W5) ∪ (baba‧W1) ∪(babb‧W4) ∪ (baaaba‧W2) ∪(baaabb‧W5) ∪ (baaaaa‧W1) ∪(baaaab‧W5) ={aabaaa, aaaa, aaa, aba, abaaa, bbaa, bbaaa, bbba, bbbaaa, bababaaa, babaaa, babaa, babba, babbaaa, baababaaa, baabaaa, baabaa, baabba, baabbaaa, baaababaaa, baaabaaa, baaabaa, baaabba,baaabbaaa, baaaaabaaa, baaaaaaa, baaaaaa, baaaaba, baaaabaaa}	Wang Feng. 10/23/08	Yes
Page 236, line -6	21	38	Wang Feng. 10/23/08	Yes
Page 236, line -5	81	44	Wang Feng. 10/23/08	Yes
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	Yes
Page 238, line 5 below the figure	δ (s,in(UIO(s)) ≠ δ (t,in(UIO(s)), for all t∈Q, t≠s.	O(s,in(UIO(s))) ≠ O(t,in(UIO(s))), for all t∈Q, t≠s.	Wang Feng. 10/23/08	Yes
Page 239, line 6 and 7	q2	q1	Wang Feng. 10/23/08	Yes
Page 239, para 2, line 2	in(UIO(s)) = a.c.	in(UIO(q1))＝ac，out(UIO(q1))＝01.	Wang Feng. 10/23/08	Yes
Page 240, para 2, line 4	errorneous	erroneous	Wang Feng. 10/23/08	Yes
Page 242, line 3	OutEdges	Oedges	Wang Feng. 10/23/08	Yes
Page 242, Step 3lines 3, 4, 5	.1 Oled[i] = Set (label(ei)) – {ei} 3.2 Opattern[i] = label[i] 3.3 Oend[i] = tail[i]	3.1 Oled[i] = Set (label(ei)) – {ei} 3.2 Opattern[i] = label[ei] 3.3 Oend[i] = tail[ei]	Wang Feng. 10/23/08	Yes
Page 242, Steps 4, 5, 6, and 7 and then in procedure gen-1-uio, steps 1	UIO[s]	UIO(s)	Wang Feng. 10/23/08	Yes
Page 242, procedure gen-1-uio, step 1	label(e)	label(ei),	Wang Feng. 10/23/08	Yes
Page 242, lines 2, 3 following the end of procedure gen-1-uio	gen-1-uio	gen-uio	Wang Feng. 10/23/08	Yes
Page 242, line -2	Oend denote the number	Oedges denote the set	Wang Feng. 10/23/08	Yes
Page 243, line 9	set of outgoing edges from	incoming edges to	Wang Feng. 10/23/08	Yes
Page 243, step 2.3, line 1	NE=k	k=NE	Wang Feng. 10/23/08	Yes
Page 243, Line 4 following the end of procedure gen-long uio	length L for state s of length L	length L for state s	Wang Feng. 10/23/08	Yes
Page 243, Step 1	Opattern[i]	OPattern[k]	Wang Feng. 10/23/08	Yes
Page 243, Step 4	Led[k] ≠ 0	Led[k] ≠ Ø	Wang Feng. 10/23/08	Yes
Page 245, line 5	qs	s	Wang Feng. 10/23/08	Yes
Page 245, line 7	reach	each	Wang Feng. 10/23/08	Yes
Page 245, Example 3.23, lines 9 and 10	Oled[1] = {(2，3)，(3，4)} Oend[1] = q2	Oled[1] = {(2，3)，(3，4)a/0} Oend[1] = q2 Opattern[1] = a/0	Wang Feng. 10/23/08	Yes
Page 245, line -5	Oen[1] = 6, and Opattern[1] = c/0.	Oend[1] = q6, and Opattern[1] = label(e1) = c/0.	Wang Feng. 10/23/08	Yes
Page 245, line -1	M2	M1	Wang Feng. 10/23/08	Yes
Page 246, Example 3.26, line 4	tail((1, 2)	tail((1,2))	Wang Feng. 10/23/08	Yes
Page 247, line 5	tail of state of	tail state of	Wang Feng. 10/23/08	Yes
Page 247, lines 6 and 7	tail(o) label(o)	tail(oe) label(oe)	Wang Feng. 10/23/08	Yes
Page 248, line 3	Lfrom ....to tail(tail(te))	L from ...to tail(te)	Wang Feng. 10/23/08	Yes
Page 248, line 6-7	Opattern, Oend, and Oled	Opattern, Oled, and Oend	Wang Feng. 10/23/08	Yes
Page 249, lines 5-6	Toward this goal, the set Tedges is computed for each edge in OutEdges at Step 2.1. First, for i = 1, we have Oend[1] = (3, 2) whose tail is state q2.	Toward this goal, the set Tedges is computed for each edge in Oedges at Step 2.2.1 of gen-long-uio. First, for i = 1, we have Oled[1] = (3, 2) whose tail is state q2.	Wang Feng. 10/23/08	Yes
Page 249, para 6	Contol	Control	Author 6/19/2012	Yes
Page 251, first para	…… in Step 2.1.2. It begins with Pattern[(2, 3)] = a/0.b/0 and End[(2, 3)] = 3.	…… in Step 2.2.2 of gen-long-uio. It begins with Pattern[1] = a/0∙b/0 and End[1] = 3.	Wang Feng. 10/23/08	Yes
Page 252, lines 5-6	Indentation problem	Correct indentation	Wang Feng. 10/23/08	Yes
Page 252, second occurrence of 3.1.1	=	≠	Wang Feng. 10/23/08	Yes
Page 252, third occurrence of 3.1.1	=	≠	Wang Feng. 10/23/08	Yes
Page 252, line -4	Step 3.4	Step 3	Wang Feng. 10/23/08	Yes
Page 253, third occurrence of 3.1.1	Step 3.1.1  As label((4, 5) ≠ label((3, 4)a/0), no change is made to Led[2].	Step 3.1.1  As label((4, 5) ≠ label(2, 6), no change is made to Led[2].	Wang Feng. 10/23/08	Yes
Page 253, third occurrence of 3.1.1, line 4	Oled [(1, 2])]	Oled [2]	Wang Feng. 10/23/08	Yes
Page 253, last step above 3.8.5	Step 3.4  Led[2] is empty. Hence, UIO[q1] = Pattern[2] = a/0.c/1.	Step 4  Led[2] is empty. Hence, UIO(q1) = Pattern[2] = a/0∙c/1.	Wang Feng. 10/23/08	Yes
Page 254, lines 4-5	...and O(q2, a) = 0 =O ≠ (q2，a).	…… O(q2, a) ≠ O(q3, a), and O(q2, b) ≠ O(q3, b).	Wang Feng. 10/23/08	Yes
Page 255, formula following second para	Sig(qi)=W(q1, q2).(P1(t1).W(q1, q3)).(P1(t2).W(q1, q4)).….(P1(tn).W(q1，qn)), for i=1. =W(qi, q1).(Pi(t1).W(qi, q2)).(Pi(t2).W(qi, q3)).….(Pi(ti-2).W(qi, qi-1)).(Pi(ti).W(qi, qi+1)).….(Pi(tn-1).W(qi, qn)), for i≠1.	Sig(qi)=W(q1, q2)∙(P1(t2)∙W(q1, q3))∙(P1(t3)∙W(q1, q4))∙…∙(P1(tn-1)∙W(q1，qn)), for i=1.	Wang Feng. 10/23/08	Yes
Page 255, equation following the first para of Example 3.32	Sig(q1) = W(q1, q2).((P1(t1).W(q1, q2))	Sig(q1) = W(q1, q2)∙(P1(t2)∙W(q1, q3))	Wang Feng. 10/23/08	Yes
Page 255, line -4	UIO	Sig	Wang Feng. 10/23/08	Yes
Page 256, para following Step 4, line 1	under test	can	Wang Feng. 10/23/08	Yes
Page 258, line -4	state diagram of M	state diagram of M1	Wang Feng. 10/23/08	Yes
Page 263, Figure 3.24	q2: b/1 and a/0	q2: b/0 and a/1	Author. 10/20/2009	Yes
Page 263, first line below Figure 3.24	qi=c(qj, a) and qk=δ(qi, b, and qi...	qi=δ(qj, a) and qk=δ(qi, b), and qi...	Author. 10/20/2009 and 3/26/2012	Yes
Page 263, Figure 3.24 and the corresponding discussion in Example 3.38.	The figure is incorrect and so is the discusiso in the example.	Figure 3,24: In M1: ransition q1-q2 on a should output 0. Transition q2-q1 on a should output 1. In M2: replace a/0, b/1 by a/1, b/0 At line 2 in Example 3.38, replace "output" by "transfer", and at line 3 replace "abba" by "aabb". Replace "however, we obtain..." by "While the operation error in state q2 is detected the transfer error is not.	Author 6/13/2012	Yes
Page 263, Example 3.38, second para, line 2	..output error in state q3..	...transfer error in state q3..	Author. 10/20/2009	Yes
Page 264, last para, line -4	M3'	M3	Wang Feng. 10/23/08	Yes
Page 266, line 4	n-switch set cover	n-switch cover	Wang Feng. 10/23/08	Yes
Page 267, line 3	M2'	M3	Wang Feng. 10/23/08	Yes
Page 268, line 1	..test seqences..	"..test sequences..	Author. 10/20/2009	Yes
Page 270, left colum, line 7	Hopcroft and Ullman	Hopcroft et al.	Wang Feng. 10/23/08	Yes
Page 270, right column, line -7	FSM[537]	FSM	Wang Feng. 10/23/08	Yes
Page 271 ,left column, line -10	T-	TT	Wang Feng. 10/23/08	Yes
Page 276, 3.24, last line	qb	q6	Wang Feng. 10/23/08	Yes
Page 276, 3.25	FSM specifications	specification FSMs	Wang Feng. 10/23/08	Yes
Page 277, 3.26, line 2	corresponding to an FSM	delete	Wang Feng. 10/23/08	Yes
Page 277, 3.27, line -7	tr1, tr4, tr5	tr1, tr5, tr4	Wang Feng. 10/23/08	Yes
Page 277, 3.27, line -5	tr5	tr4	Wang Feng. 10/23/08	Yes
Chapter 4 Test Generation from Combinatorial Designs [This chapter renains unchanged in the Second Edition except for its number.]
Page 284, line -4 and -3	File	file	Wang Feng. 10/23/08	Yes
Page 285, entry for -pos2	End for	End position in the input line for	Wang Feng. 10/23/08	Yes
Page 288, Example 4.6, line 2	64	75	Wang Feng. 10/23/08	Yes
Page 291, Example 4.10, line 4	three fault	fault	Wang Feng. 10/23/08	Yes
Page 290, Example 4.9, line 2	fault in Example 4.1	fault in Program 4.1	Author. 10/20/2009	Yes
Page 290, Example 4.9, para 2, line 2	x, y∈{-1, 1}	x∈{-1, 1}, y∈{-1, 0}	Yu Leng. October 6, 2010	Yes
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	Yes
Page 293, second para from the bottom, line 2	module arithmetic	modulo arithmetic	Author. 10/20/2009	Yes
Page 293, Example 4.12, line 3 below the matrix	has six	has three	Wang Feng. 10/23/08	Yes
Page 294, line 7	the L(i,j)	M(i,j)	Wang Feng. 10/23/08	Yes
Page 296, para 4, last of the eight triples	Z2	Z2)	Wang Feng. 10/23/08	Yes
Page 299, end of line 1 in Step 1 in the algorithm	2k-i	2k-1	Praveen Ranjan Srivastava. 4/21/08	Yes
Page 300, set T at the bottom of the page	`C"	``C"	Wang Feng. 10/23/08	Yes
Page 303, line 3	b=b1>k	b>k	Wang Feng. 10/23/08	Yes
Page 303, line 4	b1-k	b-k	Wang Feng. 10/23/08	Yes
Page 308, table, block 3, row 2, column 3	4	2	Author. 11/4/2009	Yes
Page 313, line 6	levels	factors	Wang Feng. 10/23/08	Yes
Page 315, para below the table, line 5	six	four	Wang Feng. 10/23/08	Yes
Page 315, second table, second column, runs 3, 4, 5	Large, Small, Large	Small, Large, Medium	Wang Feng. 10/23/08	Yes
Page 316, table, line 3 and 4	Blood temperature Body activity	Blood pressure Body temperature	Wang Feng. 10/23/08	Yes
Page 330, line -2	X and Z	X, Y, and Z	Wang Feng. 10/23/08	Yes
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	Yes
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	Yes
Chapter 5 Test Selection, Minimization, and prioritization for Regression Testing [This chapter has been moved to a new part that covers phases of testing: unit, regression, and integratio in three separate chapters.]
Page 339, line -11	> .	>	Wang Feng. 10/23/08	Yes
Page 343, 5.2.5, line 6	application	[delete]	Wang Feng. 10/23/08	Yes
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	Yes
Page 352, Example 5.8, line 4	foo in P'	foo' in P'	Wang Feng. 10/23/08	Yes
Page 353, Step 4.1.1	[Symbol for empty]	[Correct the symbol]	Wang Feng. 10/23/08	Yes
Page 354, line -9	G'.Start	G'.main.Start	Wang Feng. 10/23/08	Yes
Page 355, line 7 from the top	Mark G.main.1	Mark G.main.2	Praveen Ranjan Srivastava. 3/9/09	Yes
Page 357, Procedure SelectTestsDecl, lines 1, 2, 7	declChange	declChangef	Wang Feng. 10/23/08	Yes
Page 358, Program P5.3, line 6	z-x+y	z=x+y	Wang Feng. 10/23/08	Yes
Page 358, line -10	tests(2)	test(2)	Wang Feng. 10/23/08	Yes
Page 359, Program P5.4, line 2	int p. q. r. z;	int p, q, r, z;	Wang Feng. 10/23/08	Yes
Page 359, Program P5.4, line 4	input (p. q. r.)	input(p, q, r);	Wang Feng. 10/23/08	Yes
Page 359, line 8	x=2	z=2	Wang Feng. 10/23/08	Yes
Page 359, definition of T, line 1	r=r	r=2	Wang Feng. 10/23/08	Yes
Page 360, Example 5.13, line 3	test t	test t1	Wang Feng. 10/23/08	Yes
Page 361, Step 4, line 2	DS(v, n)	DS(t, v, n)	Wang Feng. 10/23/08	Yes
Page 361, Program P5.5, line 3	) 0	0)	Wang Feng. 10/23/08	Yes
Pages 361 and 363	Figures 5.10 and 5.11	[These have been revised in the second edition.]	Author 6/20/2012	Yes
Page 368, second para from bottpm, lines 2, 3, 5	S'	s'	Wang Feng. 10/23/08	Yes
Page 370, Example 5.22, lines 2-3	53, 63, 7, 83, 103, 44, 11}.	53, 63, 7, 83, 103, | 44, 11}.	Wang Feng. 10/23/08	Yes
Page 370, line -3	10	11	Wang Feng. 10/23/08	Yes
Page 375, defintiion of C above Section 5.8.2	C = {main.1, main.2, main.3, f1.1, f1.3}, { main.1, main.3, f1.1, f1.2, f1.3}	C = {{main.1, main.2, main.3, f1.1, f1.3}, { main.1, main.3, f1.1, f1.2, f1.3}}	Wang Feng. 10/23/08	Yes
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	Yes
Page 380, Step 4, line 2	entityCov	entitiesCov	Wang Feng. 10/23/08	Yes
Page 381, line 2	X and enttitiesCov is not empty	X' and enttitiesCov are not empty	Wang Feng. 10/23/08	Yes
Page 381, line 7	{14}	{3}	Wang Feng. 10/23/08	Yes
Page 381, Step 3.3	{t1, t2}	{t1, t2, t4}	Praveen Ranjan Srivastava. 3/26/08	Yes
Page 394, Program P5.10, line following 7 and line following 8	*	//	Wang Feng. 10/23/08	Yes
Page 397, 5.36, lines 3 and 6	Ti <Ti>	<T'i> <T'i>	Wang Feng. 10/23/08	Yes
Chapter 6 Test Adequacy Assessment Using Control Flow and Data Flow [This chapter renains unchanged in the Second Edition except for its number.]
Page 399, line 4	Goodnough	Goodenough	Wang Feng. 10/23/08	Yes
Page 405, Example 6.5, line 6	T′ = {<x=3, y=4>, <x=3, y=1>}.	T′ = {<x=2, y=3>, <x=3, y=1>}.	Wang Feng. 10/23/08	Yes
Page 410, Program P6.4, line 11	}	[Remove]	Wang Feng. 10/23/08	Yes
			Wang Feng. 10/23/08	Yes
Page 413, line labled 10 in the program	while (request ≠ exit)	while (true)	Aditya Mathur 4/19/2011	Yes
Page 413, line below the program	three tests have been	three tests has been	Aditya Mathur 4/15/2009	Yes
Page 413, test T	Tests are incomplete	(a) Label each test as t1, t2, and t3. (b) Add request=3 to t1 and t2.	Aditya Mathur 6/13/2012	Yes
Page 414, para 4, line 2	on T	on T'	Wang Feng. 10/23/08	Yes
Page 418, Section 6.2.2, para 2, line 4	<, <, >	<, <=, >	Marco Aurèlio Graciotto Silva. 12/8/2009	Yes
Page 419, Figure 6.5		Label the tasks as task 1, task 2 ect as appropriate.	Wang Feng. 10/23/08	Yes
Page 419, Program P 6.6, line 2	nifinite loop	infinite loop	Wang Feng. 10/23/08	Yes
Page 420, line 4 above Section 6.2.3	decesion	decision	Jim Mapel, 7/23/2009	Yes
Page 420, examples 1, 2, 3, and 4		Change all variables to lower case.	Wang Feng. 10/23/08	Yes
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	Yes
Page 421, equation just above the last para	T′′ = {t1: <x = -5> t2: <x = 3>}	T′ = {t1: <x = -5>,  t2: <x = 3>}	Vahid Garousi. 7/17/08	Yes
Page 421, Program P6.7, line 5	z=-x	x=-x	Ali Bou Nassif 7/11/2012	Yes
Page 421, line 1 of last para	all tests in T	all tests in T'	Vahid Garousi. 7/17/08	Yes
Page 422, para 3, line 4	De={3}	De={x<y}	Wang Feng. 10/23/08	Yes
Page 422, line -2	{	[REmove the open curly brace]	Wang Feng. 10/23/08	Yes
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.	No
Page 424, line 2 below Program P6.8	>t2	>, t2	Wang Feng. 10/23/08	Yes
Page 425, Program P6.9, line 5	foo-1	foo1	Vahid Garousi. 7/17/08	Yes
Page 425, line 6	condition	compound condition	Wang Feng. 10/23/08	Yes
Page 425, Program P6.9, line 7	foo-2	foo2	Vahid Garousi. 7/17/08	Yes
Page 425, lines just below Program P6.9	x=-3 y=2 x=4 y=2 x=-3 y=2 x=4 y=-2	x=-3, y=2 x=4, y=2 x=-3, y=2 x=4, y=-2	Wang Feng. 10/23/08	Yes
Page 426, line 5	multiple-condition-coverage criterion	condition/decision coverage criterion	Marco Aurèlio Graciotto Silva. 12/8/2009	Yes
Page 427, line 1	1 and 3	1 and 4	Vahid Garousi. 7/17/08	Yes
Page 427, line 2	2 and 4	2 and 3	Vahid Garousi. 7/17/08	Yes
Page 427, test set T'	t4: <A=2, B=1, C=5>	t4: <A=2, B=1, C=1>	Vahid Garousi. 7/17/08	Yes
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	Yes
Page 427, Table 6.3 lines 1, 2, 3, and 4	(P, Q, R)	(A, B, C)	Wang Feng. 10/23/08	Yes
Page 429, line 3	T'	T''	Wang Feng. 10/23/08	Yes
Page 430, Example 6.10, line 2	font of g	Change the font of g	Vahid Garousi. 7/17/08	Yes
Page 430, last para	When Program P6.11 is executed against t1, the sequence of LCSAJs executed is (1, 4, 5) and (5, 8, exit). When Program P6.11 is executed against t2, an LCSAJ (1, 6, exit) is executed.	When Program P6.11 is executed against t1, a LCSAJ (1, 6, exit) is executed. When Program P6.11 is executed against t2, the sequence of LCSAJs executed is (1, 4, 7) and (7, 8, exit).	Wang Feng. 10/23/08	Yes
Page 432, line below the table	two	three	Wang Feng. 10/23/08	Yes
Page 432, last para, line 4	10	5	Wang Feng. 10/23/08	Yes
Page 434, line -4	creation	crterion	Wang Feng. 10/23/08	Yes
Page 435, Table 6.6, rightmost column, last two entries	true true	false false	Wang Feng. 10/23/08	Yes
Page 436, line just below Table 6.6	MC-DC	MC/DC	Wang Feng. 10/23/08	Yes
Page 436, Table 6.7, leftmost column, last two entries	5[7] 6[8]	5[19] 6[20]	Wang Feng. 10/23/08	Yes
Page 437, Table 6.8, line 3	cover C3	cover C1	Wang Feng. 10/23/08	Yes
Page 437, Table 6.9, line 1 of the third subtable	x or	xor	Wang Feng. 10/23/08	Yes
Page 438, Table 6.10, line 1 of the third subtable	x or	xor	Wang Feng. 10/23/08	Yes
Page 438, Table 6.10, row labeled t12	t3	t9	Wang Feng. 10/23/08	Yes
Page 441, line 2 below the formula for MCc	MC of T	MCc of T	Wang Feng. 10/23/08	Yes
Page 443, line below the table at the top	EasT	East	Wang Feng. 10/23/08	Yes
Page 443, line -8	Condition not evaluated	[Indent it so it aligns with the column labeled "Column"	Wang Feng. 10/23/08	Yes
Page 441, formula for MCc			Roc Zhang. 10/26/2010	Yes
Page 444, table, row labeled t5	R1	R1.1	Wang Feng. 10/23/08	Yes
Page 445, lines 1, 2	the case of C3, we node that in tests t3and t4, conditions (z*z ≤ y) and (current == “South”) are held constant, while (x < y) is varied. These two tests demonstrate the independent effect of (x < y) on C3.	the case of C3, we node that in tests t1and t3, conditions (x < y) and (current == “South”) are held constant, while (z*z ≤ y) is varied	Wang Feng. 10/23/08	Yes
Page 445, line -11:9	Condition not evaluated	[Indent it so it aligns with the column labeled "Column"	Wang Feng. 10/23/08	Yes
Page 446, Table, row labeled t6, under column labeled z	2	3	Wang Feng. 10/23/08	Yes
Page 446, table, rows labeled t8 and t9	R1	R1.2	Wang Feng. 10/23/08	Yes
Page 447, table at the top, row labeled t8, third column from the left	true	false	Wang Feng. 10/23/08	Yes
Page 447, lower table, row labeled t6, third column from the left	true	false	Wang Feng. 10/23/08	Yes
Page 447, lower table, row labeled t6, rightmost colum		[Remove the text]	Wang Feng. 10/23/08	Yes
Page 447, lower table, row labeled t7, rightmost column		t7 and t9 demonstrate the independent effect    of (x < y) on C3	Wang Feng. 10/23/08	Yes
Page 447, rows labeled t2 and t4	Condition not evaluated	[Indent it so it aligns with the column labeled "Column"	Wang Feng. 10/23/08	Yes
Page 447, lower table, rows labeled t5, t8, t9, third column from left	true false false	false true true	Wang Feng. 10/23/08	Yes
Page 449, Example 6.24, lines 2 and 4	C''	C'	Wang Feng. 10/23/08	Yes
Page 449, Example 6.24, lines 1 and 2	C1	[Use 1 as subscript.]	Wang Feng. 10/23/08	Yes
Page 449, line below the table	C"	C'	Wang Feng. 10/23/08	Yes
Page 450, second table, row labeled t3, rightmost column	No	Yes	Vahid Garousi. 7/17/08	Yes
Page 451, line -14	infeasibility	feasibility	Wang Feng. 10/23/08	Yes
Page 453, complete para 2, line 6	fire-2 instead of invoking fire-3	fire-3 instead of invoking fire-2	Wang Feng. 10/23/08	Yes
Page 453, para 2 from the bottom, lines 5, 6, 7	When Program P6.23 is executed against t5, it invokes fire-2 but the requirements imply the invocation of fire-3.	When Program P6.14 is executed against t5, it invokes fire-3 but the requirements imply the invocation of fire-2.	Wang Feng. 10/23/08	Yes
Page 454, Example 6.28, line 1	integer x	integers x, and y	Wang Feng. 10/23/08	Yes
Page 455, 6.3.1, lines 4 and 7	x=y+z x=x+y	x=y+z; x=x+y;	Wang Feng. 10/23/08	Yes
Page 456, lines 3 and 5	scanf (“%d %d”, &x, &y) printf (“Output:%d \n”, x+y)	scanf (“%d %d”, &x, &y); printf (“Output:%d \n”, x+y);,	Wang Feng. 10/23/08	Yes
Page 456, line -2	foo(x*x)	foo(x*x);	Wang Feng. 10/23/08	Yes
Page 458, line -9	its a CFG	its control flow graph	Wang Feng. 10/23/08	Yes
Page 461, Program P6.16, lines 14 and 15	14      y = x*y + z 15      count = count -1	14      y = x*y + z; 15      count = count -1;}	Wang Feng. 10/23/08	Yes
Page 461, line 3 above Example 6.31	edge (k,l)	node l	Wang Feng. 10/23/08	Yes
Paghe 463, lines 1, 2	(d1(z), u4(z), d4(z), u4(z), d4(z), u6(z)),	(d1(z), u4(z), d4(z), u6(z),	Wang Feng. 10/23/08	Yes
Page 463, first complete para		[Replace all occurrences of X by x.]	Wang Feng. 10/23/08	Yes
Page 463, Example 6.33, line 4	u4(z)	u4(y)	Wang Feng. 10/23/08	Yes
Page 465, line 2	dk(x)	dk(xj)	Wang Feng. 10/23/08	Yes
Page 465, line 4 above the table	at least oine variable defintiion	at least one variable c-use	Wang Feng. 10/23/08	Yes
Page 465, table lines 6 and 7	6      {(d1(count), d1(x), d1(y), d1(z)), (d1(count), d1(x), d1(y), d5(z)),(d1(count),d1(x), d1(y), d4(z)), (d6(count), d1(x), d6(y), d5(z)), (d6(count),d1(x), d6(y), d4(z)), (d6(count), d1(x), d6(y), d1(z))} 7      {(d4(z)),(d5(z))}	6      {(d1(x), d1(y), d1(z), d1(count)), (d1(x), d1(y), d5(z),  d1(count)),(d1(x), d1(y), d4(z), d1(count)), (d1(x), d6(y), d5(z), d6(count)), (d1(x), d6(y), d4(z), d6(count))} 7      {(d1(z)), (d4(z)),(d5(z))}	Wang Feng. 10/23/08	Yes
Page 465, line -3	that is d6(y) followed by d4(z), is possible for node 4.	that is d4(z) followed by d6(y), is possible for node 4.	Wang Feng. 10/23/08	Yes
Page 466, line 3	followed by d6(count), d6(y), and finally d5(z).	d1(x) followed by d6(y), d6(count), and lastly d5(z).	Wang Feng. 10/23/08	Yes
Page 466, line 6	followed by d6(count), d5(z), and finally d6(y).	followed by d5(z), d6(y), and lastly d6(count).	Wang Feng. 10/23/08	Yes
Page 467, Program P 6.17, line 11		[ Fix indentation.]	Wang Feng. 10/23/08	Yes
Page 467, Section 6.4, line 9	1 ≤ j ≤ k	1 ≤ j ≤ m, m ≤ k	Wang Feng. 10/23/08	Yes
Page 468, lines 2 and 3	CU = PU =	CU = PU =	Wang Feng. 10/23/08	Yes
Page 469, Example 6.36, para 2, last line	dcu(z, 6)	dcu(z, 5)	Wang Feng. 10/23/08	Yes
Page 471, line -3	Xi	xi	Wang Feng. 10/23/08	Yes
Page 470, third line from the bottom	the second occurrence of 6-2	6-3	Praveen Ranjan Srivastava. 5/14/08	Yes
Page 470, Example 6.37, second para, line 1	labeled y>0 is	labeled y>= 0 is	Vahid Garousi. 7/17/08	Yes
Page 471, para 3, line 1	the second occurrence of 6-2	6-3	Author. 5/14/08	Yes
Page 472, first complete para, line 1	Xi	xi	Wang Feng. 10/23/08	Yes
Page 472, lines -4, and -3	6.2 6.7	6, 2 6, 7	Wang Feng. 10/23/08	Yes
Page 473, line 8	form λ1	form λ2	Wang Feng. 10/23/08	Yes
Page 473, line above Section 6.4.5	test set	test case	Wang Feng. 10/23/08	Yes
Page 475, Section 6.4.7, line 3	OEDC(K)	OEDC(k)	Vahid Garousi. 7/17/08	Yes
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	Yes
Page 476, line 4 and 5	data context ordered data context	elementary data context ordered elementary data context	Wang Feng. 10/23/08	Yes
Page 476, line 16	Elementary ordered data context coverage	Ordered elementary data context coverage	Wang Feng. 10/23/08	Yes
Page 476, line 18	ordered data context	ordered elementary data context	Wang Feng. 10/23/08	Yes
Page 476, line -10	ordered data context	ordered elementary data context	Wang Feng. 10/23/08	Yes
Page 477, para 2, lines 2 and 3	as 11 EDCf/11	as 12 EDCf/12	Wang Feng. 10/23/08	Yes
Page 477, table at the bottom, rightmost column,	3/11 5/11 7/11 9/11	3/12 5/12 8/12 9/12	Wang Feng. 10/23/08	Yes
Page 477, table at the bottom, third column from the left	5: (d1(x))                                6*: (d1(x), d1(y), d5(z), d1(count)) 6: (d1(x), d6(y), d5(z), d6(count))	7: (d5(z)) 5*: (d1(x))            6*: (d1(x), d1(y), d5(z), d1(count))  5*: (d1(x)) 6: (d1(x), d6(y), d5(z), d6(count)) 7*: (d5(z))	Wang Feng. 10/23/08	Yes
Page 478, Section 6.5, line 2 abovr para 2	t1	t1:	Wang Feng. 10/23/08	Yes
Page 478, Example 6.44, line 3	y=x+y+z	y=x+y+z;	Wang Feng. 10/23/08	Yes
Page 479, the array of four tests for T		[Remove]	Wang Feng. 10/23/08	Yes
Page 481, Program P 6.20, line 2	z;	z=0;	Wang Feng. 10/23/08	Yes
Page 482, Section 6.7, para 2, line 5	test case T that belongs to t	test case t that belongs to T	Wang Feng. 10/23/08	Yes
Page 487, right column, line 3	[54]	[547]	Wang Feng. 10/23/08	Yes
Page 487, left column, line 6	Page	Paige	Wang Feng. 10/23/08	Yes
Page 487, right column, second para, line 7	Gerhart the lies	Gerhart lies	Wang Feng. 10/23/08	Yes
Page 488, line 1	[54]	[Fix the citation]	Wang Feng. 10/23/08	Yes
Page 493, right column, para 2, line 2	Ramammorthy	Ramamoorthy	Wang Feng. 10/23/08	Yes
Page 490, right column, line -8	King	Kung	Wang Feng. 10/23/08	Yes
Page 494, Table 6.12, rightmost column	f3(x,y,z)	f2(x,y,z)	Vahid Garousi. 7/17/08	Yes
Page 494, Table 6.12, rightmost column	f4(x,y,z)	f1(x,y,z)	Vahid Garousi. 7/17/08	Yes
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	Yes
Page 496, Exercise 6.21, (c), line 2	P6.23	P6.14	Wang Feng. 10/23/08	Yes
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	Yes
Page 497, Exercise 6.23, line 7	i1	i-1	Vahid Garousi. 7/17/08	Yes
Page 497, 6.24, statement labeled 14	(x<y or	(x<y) or	Vahid Garousi. 7/17/08	Yes
Page 497, Exercise 6.25, lines 2, 3, 4, 5	compound condition C defined as follows: C = (A and B) or (A and C) or (B and C) Assuming that C is a decision, construct a minimal set of tests for C that are…….	compound condition D defined as follows: D = (A and B) or (A and C) or (B and C) Assuming that D is a decision, construct a minimal set of tests for D that are…….	Wang Feng. 10/23/08	Yes
Page 497, 6.26, line 3	LCSAJ(MC/DC)	MC/DC(LCSAJ)	Vahid Garousi. 7/17/08	Yes
Page 497, line -11	LSCAJ	LCSAJ	Wang Feng. 10/23/08	Yes
Page 498, 6.29, line 1	Is test case t in	Is the test set T containing t only test case tp in	Vahid Garousi. 7/17/08	Yes
Page 498, 6.29, line 3	if t is inadequate	of T is inadequate	Vahid Garousi. 7/17/08	Yes
Page 498, Exercise 6.32, lines 4 and 5	P nc	s nu	Wang Feng. 10/23/08	Yes
Page 499, line 16	}	[Remove the curly brace.]	Wang Feng. 10/23/08	Yes
Page 499, line -11	and P1()	P1(), and P2()	Wang Feng. 10/23/08	Yes
page 499, Exercise 6.34, line 2	P6.21	P6.16	Wang Feng. 10/23/08	Yes
Page 500, 6.37, line 1	Example 6.35 lists	Example 6.34 lists	Vahid Garousi. 7/17/08	Yes
Page 500, Program P6.23, line 11	}	[Remove]	Wang Feng. 10/23/08	Yes
Chapter 7 Test Adequaqcy assessment using Program Mutation [This chapter renains unchanged in the Second Edition except for its number.]
Page 503, para 3, line 2	a white-box	as a while-box	Wang Feng. 10/23/08	Yes
Page 510, para 2, line 5	under weak mutation but not under strong mutation	under strong mutation but not under weak mutation	Wang Feng. 10/23/08	Yes
Page 510, table, first row	Danger HighCount	danger highCount	Wang Feng. 10/23/08	Yes
Page 517, Example 7.11, para 2, line 2	M(t2)=1	M(t2)=0	Mark Paulk 4/24/2013
Page 519, line 8	P(x, y)	[Remove]	Wang Feng. 10/23/08	Yes
Page 519, Step 12, line -5	P(t)=2 and M(t)=1	P(t)=1 and M(t)=2	Vahid Garousi. 7/17/08	Yes
Page 519, Step 12, line 3	MST	MS(T)	Wang Feng. 10/23/08	Yes
Page 520, lines 5, 6, 9, 13	L = 0 D = 0 D = L = 0 L = D = 0	|L| = 0 |D| = 0 |D| =|L| = 0 |L| = |D| = 0	Wang Feng. 10/23/08	Yes
Page 520, Example 7.15, line 2	T as given	TP as given	Wang Feng. 10/23/08	Yes
Page 520, line -5	T'	T'P	Wang Feng. 10/23/08	Yes
Page 524, Figure 7.2, lines 2 and 3	p kcould	P k could	Vahid Garousi. 7/17/08	Yes
Page 526, Table first row	x=x+1; x=x+3;	x=x+1; --> x=x+3;	Wang Feng. 10/23/08	Yes
Page 526, Table second row	y=y*3; --> y=y*3;	y=y*3; --> y=y*1;	Vahid Garousi. 7/17/08	Yes
Page 527, para 2, last line	no manufacture	not manufacture	Wang Feng. 10/23/08	Yes
Page 528, Example 7.20, line 6	five equality and relational	five relational	Wang Feng. 10/23/08	Yes
Page 531, Section 7.6.1, para 3, lines 6, 7, and 9	missing conditional	missing condition	Wang Feng. 10/23/08	Yes
Page 533, line 5	pointed to under	pointed under	Wang Feng. 10/23/08	Yes
			Wang Feng. 10/23/08	Yes
Page 534, line 3 from the top	L=link[L];	Should be indented to left align with statement 9.	Vahid Garousi. 7/17/08	Yes
Page 534, line 3 from the top	sum+data	sum+data[L]	Vahid Garousi. 7/17/08	Yes
Page 534, line 7 from the bottom	sum+data	sum+data[L]	Vahid Garousi. 7/17/08	Yes
Page 534, line 2 from the bottom	midCond	Change font to match previous occurrences	Vahid Garousi. 7/17/08	Yes
Page 535, lines 1 and 2	sum	SUM	Vahid Garousi. 7/17/08	Yes
Page 535, line 3 above (7.2)	C1=C2	Cp=CM
Page 535, line below equation (7.3)	However, condition (7.1) will not	However, condition (7.2) will not	Vahid Garousi. 7/17/08	Yes
Page 536, line -1	and executes it against	and executes them against	Wang Feng. 10/23/08	Yes
Page 540, line 2	SL＝S, : l0	SL＝S, l1	Wang Feng. 10/23/08	Yes
Page 540, Section 7.10.3, para 2, lines 3 , 4, and 5 and para 3, lines 1 and 3	E(f, t) = s, m ≥1 be…… ……where sj, 1 ≤ j ≤ m-1 is…… Thus, sm = R′,…… Any proper prefix s, 0 < k < m of E(f, t), where sk = R′, is…… ……by Ep(f, t) ∙ s is known as……	E(f, t) = S, m ≥1 be…… ……where Sj, 1 ≤ j ≤ m-1 is…… Thus, Sm = R′,…… Any proper prefix S, 0 < k < m of E(f, t), where Sk = R′, is…… ……by Ep(f, t). S is known as……	Wang Feng. 10/23/08	Yes
Page 542, R7, line 6	E(S, t) = |c E(S, *) (|El(Sbreak) (E(S E(S, *)))	E(S, t) = |c E(S, *) (|El(Sbreak) (E(S, *) E(S, *)))	Wang Feng. 10/23/08	Yes
Page 543, Example 7.25, para 2, line 1	we modify f	we modify trim	Wang Feng. 10/23/08	Yes
Page 543, last par, line 2	given function, a suitable test test case needs	given functiuon f, a suitable test case t needs	Wang Feng. 10/23/08	Yes
Page 543, Equation 7.3	(7.3)	[Remove the number.]	Wang Feng. 10/23/08	Yes
Page 545, Example, 7.26, label F2	F2	[Indent F2 to the right.]	Wang Feng. 10/23/08	Yes
Page 546, para 2, line 1	fy	y	Wang Feng. 10/23/08	Yes
Oage 546, para 3, line 1	int  *fp, int  (*fpa)  (20);	int  *fp; int  (*fpa)(20);	Wang Feng. 10/23/08	Yes
Page 548, Section 7.10.7.1, para 2, line 4	Left operands of assignment operators ++ and – are not mutated.	Left operands of the assignment operators as well as $++$ and $--$ operators are not mutated.	Wang Feng. 10/23/08	Yes
Page 548, M1, third item	k=1+*p	k=-1+*p	Wang Feng. 10/23/08	Yes
Page 553, para 3, line 3	to x op~ y, x~ op y, and ~ (x op y).	to x op ~y, ~x op y, and ~(x op y).	Wang Feng. 10/23/08	Yes
Page 558, complete para 3, lines 2 and 3; para 4 line 3	STRP	STRI	Wang Feng. 10/23/08	Yes
Page 562, line 11	break_out_to_level-n(j)	break_out_to_level_n(j)	Wang Feng. 10/23/08	Yes
Page 571, line -14	only local	local	Wang Feng. 10/23/08	Yes
Page 571, second operator from the bottom of the table	Strcuture	Structure	Author 6/25/2012
Page 572, line -7			Wang Feng. 10/23/08	Yes
Page 602, right column, line -6	Fig 4.4	Fig 7.4	Wang Feng. 10/23/08	Yes
Page 578, line 3	OAAR	OAAN	Wang Feng. 10/23/08	Yes
Page 608, 7.13, (a) line 4	obtained my mutating	obtained by mutating	Vahid Garousi. 7/17/08	Yes
Page 610, 7.20, item labeled 4	A	^	Author. 6/6/08	Yes
Page 610, 7.20, line 5	y=x+1	Indent this line to align with line 4	Vahid Garousi. 7/17/08	Yes
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	No. Instead, the assignment (= ) is aligned.
Page 612, 7.26, item 4 before item 6	4. It is applicable	5. It is applicable	Author. 6/6/08	Yes
Page 612, 7.27, line 2	MIller	Miller	Author. 6/6/08	Yes
Page 613, line just above Program P7.4	containerprogram	container program	Praveen Ranjan Srivastava. 3/26/08	Yes
Page 615, reference item 8, line 2	AMC press	ACM Press	Author. 6/6/08	Yes
Page 634, reference 288	Leveson, N. G. and A. Dupuy	Dupuy, A. and N. G. Leveson	Author 11/17/2009	Yes
References
Page 630, line 22	[223]  Hopcroft, J. E. and J. D. Ullman……	Hopcroft, J. E., R. Motwani and J. D. Ullman……	Wang Feng August 16, 2011	Yes
Page 635, line 14	[296]  Liu, C. H., D. C. Kung, and P. Hsia (2000).	[296]  Liu, C. -H., D. C. Kung, and P. Hsia (2000).	Wang Feng August 16, 2011	Yes
Page 640, line -19	……and generating fuctional tests,”	……and generating functional tests,”	Wang Feng August 16, 2011	Yes

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 March 21, 2013