From gong Mon Oct 19 10:31:48 1992
Received: from saiph.cs.Buffalo.EDU by sybil.cs.Buffalo.EDU (4.0/1.01)
	id AA30185; Mon, 19 Oct 92 10:31:47 EDT
Received: by saiph.cs.Buffalo.EDU (4.1/1.01)
	id AA21506; Mon, 19 Oct 92 10:30:03 EDT
Date: Mon, 19 Oct 92 10:30:03 EDT
From: gong (yiming gong)
Message-Id: <9210191430.AA21506@saiph.cs.Buffalo.EDU>
To: elder
Subject: Abstract for 92-26
Status: RO

\begin{center}
{\Large\bf An Algorithm for Diagnosing Two-Line Bridging Faults in Combinational Circuits}
\footnote{Research supported by NSF Grant No. MIP-9102509.}\\
\vspace{0.25in}
Sreejit Chakravarty\\
and\\
Yiming Gong\\
Department of Computer Science\\
State University of New York\\
Buffalo, NY, 14260\\
\vspace{0.25in}
\end{center}
\begin{abstract}
A novel algorithm for diagnosing all {\em Two-Line Bridging Faults} in
Combinational Circuits is presented. It assumes the
{\em Wired-OR (Wired-AND)} model and uses: SOPS to represent the set of
possible bridging faults making it space efficient;
and a set of rules for dropping faults from
the set of possible faults. The rules use {\em fault
dictionaries}, not for bridging faults but, for {\em stuck-at} faults only.
Experimental results point to: the
computational feasibility of considering all two-line bridging faults
while diagnosing combinational circuits; and the effectiveness of the 
algorithm.
\end{abstract}

\vspace{0.25in}

\hspace*{-0.2in}{\em\bf Index Terms:} Bridging Faults; Diagnosis Algorithm; Fault Dictionaries.