Satisfiability-based debugging of sequential and hierarchical designs.

Satisfiability-based debugging of sequential ...
Moayad Fahim Ali, Moayad Fahim ...
Locate

My Reading Lists:

Create a new list



Buy this book

Last edited by WorkBot
January 24, 2010 | History

Satisfiability-based debugging of sequential and hierarchical designs.

As VLSI designs grow in complexity and size, errors introduced during the design flow become more frequent, complex, and difficult to track. Debugging is the process of locating the source(s) of the error and applying corrections to rectify the design. Although much advancement has been made in the field of verification, debugging remains a manual and a resource-intensive step that consumes up to 60% of the design time and cost. This thesis proposes two novel debugging techniques, the first tackles flat gate-level sequential circuits, while the second handles hierarchical designs. The algorithms are based on Boolean Satisfiability (SAT) and Quantified Boolean Formula (QBF) Satisfiability, which are two fields that have experienced rapid development over the past few years due to their many applications in Electronic Design Automation (EDA). Experimental evaluation demonstrates that the proposed techniques are effective in reducing run-time and memory-requirements.

Publish Date
Language
English
Pages
91

Buy this book

Book Details


Edition Notes

Source: Masters Abstracts International, Volume: 44-02, page: 0988.

Thesis (M.A.Sc.)--University of Toronto, 2005.

Electronic version licensed for access by U. of T. users.

GERSTEIN MICROTEXT copy on microfiche (2 microfiches).

The Physical Object

Pagination
91 leaves.
Number of pages
91

Edition Identifiers

Open Library
OL19216837M
ISBN 10
0494072563

Work Identifiers

Work ID
OL12683494W

Community Reviews (0)

No community reviews have been submitted for this work.

Lists

History

Download catalog record: RDF / JSON
January 24, 2010 Edited by WorkBot add more information to works
December 11, 2009 Created by WorkBot add works page