test Browse by Author Names Browse by Titles of Works Browse by Subjects of Works Browse by Issue Dates of Works
       

Advanced Search
Home   
 
Browse   
Communities
& Collections
  
Issue Date   
Author   
Title   
Subject   
 
Sign on to:   
Receive email
updates
  
My Account
authorized users
  
Edit Profile   
 
Help   
About T-Space   

T-Space at The University of Toronto Libraries >
School of Graduate Studies - Theses >
Doctoral >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1807/17828

Title: Formal Methods in Automated Design Debugging
Authors: Safarpour, Sean Arash
Advisor: Veneris, Andreas
Department: Electrical and Computer Engineering
Keywords: Computer Engineering
Issue Date: 28-Sep-2009
Abstract: The relentless growth in size and complexity of semiconductor devices over the last decades continues to present new challenges to the electronic design community. Today, functional debugging is a bottleneck that jeopardizes the future growth of the industry as it can account for up to 30% of the overall design effort. To alleviate the manual debugging burden for industrial problems, scalable, practical and robust automated debugging solutions are required. This dissertation presents novel techniques and methodologies to bridge the gap between current capabilities of automated debuggers and the strict industry requirements. The contributions proposed leverage powerful advancements made in the formal method community, such as model checking and reasoning engines, to significantly ease the debugging effort. The first contribution, abstraction and refinement, is a systematic methodology that reduces the complexity of debugging problems by abstracting irrelevant sections of the circuits under analysis. Powerful abstraction techniques are developed for netlists as well as hierarchical and modular designs. Experiments demonstrate that an abstraction and refinement methodology requires up to 200 times less run-time and 27 times less memory than a state-of-the-art debugger. The second contribution, Bounded Model Debugging (BMD), is a debugging methodology based on the observation that erroneous behaviour is more likely caused by errors excited temporally close to observation points. BMD systematically generates a series of consecutively larger yet more complete debugging problems to be solved. Experiments show the effectiveness of BMD as 93% of the large problems are solved with BMD versus 34% without BMD. A third contribution is an automated debugging formulation based on maximum satisfiability. The formulation is used to build a powerful two step, coarse and fine grained debugging framework providing up to 980 times performance improvements. The final contribution of this thesis is a trace reduction technique that uses reachability analysis to identify the observed failure with fewer simulation events. Experiments demonstrate that many redundant state transitions can be removed resulting in traces with up to 100 times fewer events than the original.
URI: http://hdl.handle.net/1807/17828
Appears in Collections:Doctoral
The Edward S. Rogers Sr. Department of Electrical & Computer Engineering - Doctoral theses

Files in This Item:

File Description SizeFormat
Safarpour_Sean_A_200906_PhD_thesis.pdf1.19 MBAdobe PDF
View/Open

This item is licensed under a Creative Commons License
Creative Commons

Items in T-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

uoft