Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Progressive-BackSpace: Efficient Predecessor Computation for Post-Silicon Debug Johnny J.W. Kuan and Tor M. Aamodt
 

Summary: Progressive-BackSpace: Efficient Predecessor Computation for Post-Silicon Debug
Johnny J.W. Kuan and Tor M. Aamodt
Department of Electrical and Computer Engineering
University of British Columbia, Vancouver, BC
Email: jkuan@ece.ubc.ca, aamodt@ece.ubc.ca
Abstract--As microprocessors become more complex, finding
errors in their design becomes more difficult. Most design errors
are caught before the chip is fabricated, however, some make it
into the fabricated design. One challenge in determining what
is wrong with a new design after fabrication is the lack of
observability into the state of the fabricated chip. To address
this challenge, BackSpace [1], [2] proposes generating a trace
of the states that lead up to an erroneous state. To add one
state to the trace, BackSpace first generates a set of possible
predecessor states (the pre-image), then tests them one at a time
to find one that is reached during execution. In this paper, we
propose an improved algorithm called Progressive-BackSpace. It
does not enumerate every state in the pre-image. Instead, it first
finds a reachable candidate state, and then determines if it is a
predecessor state. This results in a practical implementation of

  

Source: Aamodt, Tor - Department of Electrical and Computer Engineering, University of British Columbia

 

Collections: Engineering; Computer Technologies and Information Sciences