\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={A Smart Model for Web Programming Agile Testing},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2014-01-15 (revised: 15 January 2014)}
\def\TheID{\makeatother }
\def\TheDate{2014-01-15}
\title{A Smart Model for Web Programming Agile Testing}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Belal  Ayyoub}

             \affil[1]{  Albalqa Applied University}

\renewcommand\Authands{ and }

\date{\small \em Received: 14 December 2013 Accepted: 4 January 2014 Published: 15 January 2014}

\maketitle


\begin{abstract}
        


A Model that Minimizing the number of test operations on Web Programming Exhaustive Testing is introduced. The proposed model based for the first time to the best of our knowledge, the Hebbian trained matrix algorithm. The model problem is formed as Agility WEB Programming Methodologies optimization problem. Time and web developer efforts will be reduced on white box testing type. A full numerical solved example is introduced. Our numerical experience shows that our approach is promising especially for Web Programming Exhaustive Testing.

\end{abstract}


\keywords{exhaustive testing, Hebbian rules, white box, software testing, agile.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\let\tabcellsep& 	 	 		 \par
i.\par
introduction and related works esting in agile software development should provide the information that stakeholders need to make decisions and steer the development into the right direction. We can increase the value of testing most by improved intelligence earlier. The challenges of testing in agile development have to be solved! What information is the testing based on? What to be tested and what are the expected results? How to make testing, development and business collaborate? How to involve customer and business people in testing? How to test early so we can achieve the customer requirements in time? Can we use a method to do that smoothly? How to match in between exhaustive testing which take time and to be delivered with customer satisfaction?. The ultimate goal of function testing is to verify that the system performs its functions as specified in the requirements and there are no undiscovered errors left. Since proving the code correctness is not feasible, especially for large software systems, the practical testing is limited to a series of experiments showing the program behavior in certain situations. Each choice of input testing data is called a test case. If the structure of the tested program itself is used to build a test case, this is called a white box (or open-box) approach \hyperref[b0]{[1]}. Several white-box methods for automated generation of test cases are described in literature. For example, the technique of \hyperref[b3]{[4]} uses mutation analysis to create test cases for unit and module testing. A test set is considered adequate if it causes all mutated (incorrect) versions of the program to fail. The idea of testing programs by injecting simulated faults into the code is further extended in \hyperref[b9]{[10]}. Another paper \hyperref[b10]{[11]} presents a family of strategies for automated generation of test cases from Boolean specifications. However, as indicated by \hyperref[b9]{[10]}, modern software systems are too large to be tested by the white-box approach as a single entity. White-box testing techniques can work only at the subsystem level. In function tests that are aimed at checking that a complex software system meets its specification, black-box (or closed box) test cases are much more common. The actual outputs of a black-box test case are compared to expected outputs based on the tester's knowledge and understanding of the system requirements. Since the testers have time for only a limited number of test cases, each test case should have a reasonable probability of detecting a fault along with being non-redundant, effective, and of a proper complexity \hyperref[b5]{[6]}. It should also make program failures obvious to the tester who is supposed to know the expected outputs of the system. Thus, selection of the tests and evaluation of their outputs are crucial for improving the quality of tested software with less cost. If the functional requirements are current, clear, and complete, they can be used as a basis for designing black-box test cases. Assuming that requirements can be re-stated as logical relationships between inputs and outputs, test cases can be generated automatically by such techniques as cause-effect graphs (see \hyperref[b7]{[8]}) and decision tables \hyperref[b1]{[2]}. Another method for automatic generation of test vectors from functional relationships is described in \hyperref[b2]{[3]}. Several ways are proposed to determine, input-output relationships in tested software. Thus, a tester can analyze system specifications, perform structural analysis of the system's source code, and observe the results of system execution. While available system specifications may be incomplete or outdated, especially in the case of a "legacy" application, and the code may be poorly structured, execution data seems to be the most reliable source of information on the actual functionality of an evolving system. In this paper, we extend the idea initially introduced \hyperref[b0]{[1]} that input-output analysis of execution data can be automated by Info-Fuzzy Network methodology of data mining \hyperref[b6]{[7]}  \hyperref[b8]{[9]}. In \hyperref[b6]{[7]} the proposed concept of IFN-based testing has been demonstrated on individual discrete outputs of a small business program. The current study evaluates the effectiveness of the Hebbian rules in Neural networks to let the system more intelligent (expert-system) and can be learned by previous cases tested methodology on a complex application having multiple continuous outputs. This is also deal with the question of determining the minimal number of training cases required to. The rest of the paper is organized as follows. Section 2 provides the methodology on the process testing and derived required paths. Section 3 presents the notation and definition of the proposed model. Section 4 describes a detailed of the proposed methodology. Finally, Section 5 summarizes the paper with initial conclusions and directions for future research and applications.\par
ii. 
\section[{Methodology}]{Methodology}\par
Testing is the process of executing a program with the intent of finding errors." \hyperref[b12]{[13]}. Assume that there are 520 possible different execution flows. If we execute one test per millisecond, it would take 3.170 years to test this program. See figure \hyperref[b0]{(1)}. All tests should be traceable to customer requirements and the uncover errors will be discovered then quickly. The system configuration can be represented mathematically by a graph, with nodes and representing links. Seefigures (1), (2). Our system will minimize the number of 'things in processes, minimize the size of 'things in processes establish a regular cadence deliver business value early, often and consistently, empower the team to create software that meets the customer needs. The ultimate objective of this paper is to give software developers procedures to enhance their ability to find acceptance testing -by customer-for which testability is an important consideration. Ideally, one would like to generate an acceptance solution algorithms that take as input the characteristics customers requirements as well as needs criteria, and produce as output an optimal path for solution, this is known as acceptance testing, and it is very difficult to achieve. However, we consider set of paths that will execute all statements and all conditions in a program, at least once that is already designed then we try to derive all the test cases, then the customer will select his steps of tests according to his requirements then a test related path will be chosen and get the test result, if the solution face customer satisfaction the test path will be selected and complete the software development. Customer partner ensure customer gets the value they are paying for build a reference first instead of System requirements. Customer gets what he wants and validates the expected results. Developers know the right answer Use the simplest technology team capability ease of use case of Refactoring Flexibility to Change test automation empower developers to run their own tests run tests regularly \hyperref[b12]{[13]}. Our paper considers the customer to be member in the testing because the expected results depend on his satisfaction and agreement. Our aim is to minimize the time consumed for test according to our new method procedure. The customer choose path steps toward the objective need to be achieved, then we can detect the suitable solution by multiply the steps with the trained matrix, the solution wanted path will be the result iii. 
\section[{Notation and Definitiond}]{Notation and Definitiond}\par
Now we will illustrate in this section, all parameters which we used in our new model and we will define every item: Si: Solution Number  
\section[{Mathematical Model}]{Mathematical Model} 
\section[{General formulation of the problem:}]{General formulation of the problem:}\par
Analysis function which can be derived for acceptance tests in Extreme Programming Exhaustive testing:?Wi = Si*Pi, n Wt =??Wi i=1\par
The accepted test will be:Ta = Wt * Pi\par
Which guarantee the solution to be assess customer visible functionality. We will present her an important assumptions to declare and describe the formulation of our new model. We derive test cases to exercise these paths. And convert each path to its matrix representation and derive the trained matrix. We have paths as follows:Path 1: [1,1,1,0,0,1,1,1] Path 2: [1,1,1,0,0,0,1,1] Path 3: [1,1,0,1,0,0,1,1] Path 4: [1,1,0,1,0,0,1,0] 1 0 ?W1=[1,1,1,0,0,1,1,1]*0= 0 ?W2= [1,1,1,0,0,0,1,1]**= ?W3= [1,1,0,1,0,0,1,1] *= ?W4= [1,1,0,1,0,0,1,0] *= Wt =?W1+?W2+?W3+?W4 =\par
During the collaboration with customer to output the features and requirements needed a suite solution can be chosen which will achieve the problem and customer requirements. Assume that the customer choose the solution with feature binary: [0, 0,1,0] then to know what is the path to be tested to give solution, it can be derived as follows:\par
Chosen pattern of solution multiply by trained matrix. By dividing the results on the maximum number and the integer values to be taken the new results will be the matrix value [0 0 1 0], this value represent the solution number 3 which will be under test and expected needs to the customer. The result represents the path of solution wanted the next step will be to be tested directly without any loose of time to discover with uncover error with needless paths. In this method we can minimize the Exhaustive testing and minimize the time taken and efforts which yield to produce the project in quick time and help in the highly iteration and incremental analysis.\par
v. 
\section[{Conclusion}]{Conclusion}\par
Exhaustive tests should be planned long before testing begins. The Hebbian trained matrix algorithm applies to Web programming excusive testing as well all testing should be traceable to customer requirements. Most effective testing should be performed by Hebbian trained matrix, time and web developer efforts will be reduced too.\begin{figure}[htbp]
\noindent\textbf{1}\includegraphics[]{image-2.png}
\caption{\label{fig_0}Fig. 1 :}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_1}}\end{figure}
  			\footnote{© 2014 Global Journals Inc. (US)} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Kaner et al. ()]{b5}\label{b5} 	 		\textit{},  		 			C Kaner 		,  		 			J Falk 		,  		 			H Nguyen 		.  		1999. Testing Computer Software. Wiley.  	 
\bibitem[Sharma et al. (2013)]{b11}\label{b11} 	 		‘A Survey on Software Testing Techniques using Genetic Algorithm’.  		 			Chayanika Sharma 		,  		 			Sangeeta Sabharwal 		,  		 			Ritu Sibal 		.  	 	 		\textit{IJCSI International Journal of Computer Science Issues}  		January 2013. 10  (1) .  	 
\bibitem[Last and Kandel ()]{b6}\label{b6} 	 		‘Automated Test Reduction Using an Info-Fuzzy Network’.  		 			M Last 		,  		 			A Kandel 		.  	 	 		\textit{Annals of Software Engineering, Special Volume on Computational Intelligence in Software Engineering},  				2003.  	 
\bibitem[Zhang and Wang ()]{b3}\label{b3} 	 		\textit{Automatic generation of test data for path testing by adaptive genetic simulated annealing algorithm},  		 			Bo Zhang 		,  		 			Chen Wang 		.  		2011. IEEE. p. .  	 
\bibitem[Weyuker et al. ()]{b10}\label{b10} 	 		‘Automatically Generating Test Data from a Boolean Specification’.  		 			E Weyuker 		,  		 			T Goradia 		,  		 			A Singh 		.  	 	 		\textit{IEEE Transactions on Software Engineering}  		1994. 20 p. .  	 
\bibitem[Schroeder and Korel ()]{b8}\label{b8} 	 		‘Black-Box Test Reduction Using Input-Output Analysis’.  		 			P J Schroeder 		,  		 			B Korel 		.  	 	 		\textit{Proc. of ISSTA '00},  				 (of ISSTA '00)  		2000. p. .  	 
\bibitem[Chauhan ()]{b2}\label{b2} 	 		 			Naresh Chauhan 		.  		\textit{Software Testing: Principles and Practices},  				2010. Oxford University Press.  	 
\bibitem[El-Ramly et al. (2002)]{b4}\label{b4} 	 		‘From Runtime Behavior to Usage Scenarios: An Interactionpattern Mining Approach’.  		 			M El-Ramly 		,  		 			E Stroulia 		,  		 			P Sorenson 		.  	 	 		\textit{Proceedings of KDD-2002},  				 (KDD-2002Edmonton, Canada)  		July 2002. ACM Press. p. .  	 
\bibitem[Mark et al. (2006)]{b0}\label{b0} 	 		 			L Mark 		,  		 			F Menahem 		,  		 			K Abraham 		.  		\textit{The Data Mining Approach to Automated Software Testing Proceedings of the 21 st Annual Conference on Computer Assurance},  				 (Gaithersburg, Maryland)  		June 2006.  	 
\bibitem[Voas and Mcgraw ()]{b9}\label{b9} 	 		\textit{Software Fault Injection: Inoculating Programs against Errors},  		 			J Voas 		,  		 			G Mcgraw 		.  		1998. Wiley.  	 
\bibitem[Beizer ()]{b12}\label{b12} 	 		\textit{Software Testing Techniques, 2 nd Edition},  		 			B Beizer 		.  		1990. New York, NY: Van Nostrand Reinhold.  	 
\bibitem[Beizer ()]{b1}\label{b1} 	 		\textit{Software Testing Techniques. 2 nd Edition},  		 			B Beizer 		.  		1990. Thomson.  	 
\bibitem[The Economic Impacts of Inadequate Infrastructure for Software Testing (2002)]{b7}\label{b7} 	 		\textit{The Economic Impacts of Inadequate Infrastructure for Software Testing},  		 02-3.  		May 2002.  		 			National Institute of Standards \& Technology 		 	 	 (Planning Report) 
\end{bibitemlist}
 			 		 	 
\end{document}
