Talks & Seminars
Abstractions for Taming the Complexity of Verification
Jacob A. Abraham, The University of Texas at Austin
Date & Time: January 9, 2006 15:00
Venue: KReSIT 305
Complexity is the primary stumbling block to the effective analysis of computer systems. This talk presents novel techniques for abstracting designs in order to increase the efficiency of verification. The techniques are aimed at automatic reduction of the state space by creating meaningful abstractions of the design. The abstractions are derived through static analysis of the design description; they can be generated automatically, and the approach scales well with increasing design sizes. Results of applying these techniques to complex hardware designs, such as the USB 2.0 function core, demonstrate improvements in verification time of several orders of magnitude compared with conventional approaches.
Speaker Profile:
Jacob A. Abraham is currently a Professor in the Dept. of Electrical and Computer Engg. at the Univ. of Texas at Austin. He is also Director of the Computer Engineering Research Center and holds a Cockrell Family Regents Chair in Engineering.

Prof. Abraham's research interests include VLSI design and test, formal verification, and fault-tolerant computing. He has over 300 refereed publications to his credit, has supervised more than 60 Ph.D. dissertations and has been included in the list of the most cited researchers in the world. He has served as the associate editor of several IEEE Transactions, as Chair of the IEEE Computer Society Technical Committee on Fault-Tolerant Computing. He is a Fellow of both the IEEE as well as ACM, and has been named as the recipient of the 2005 IEEE Emanuel R. Piore Award.
List of Talks


Faculty CSE IT
Forgot Password
    [+] Sitemap     Feedback