By Topic

Automatic Optimization Techniques for Formal Verification of Asynchronous Circuits

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. Boubekeur ; Centre for Efficiency-Oriented Languages (CEOL), Department of Computer Science, NUI Cork, Ireland. m.boubekeur@cs.ucc.ie ; M. P. Schellekens

Even medium size asynchronous circuits may display a complex behavior, due to the combinational explosion in the chronology of events that may happen. It is thus essential to apply automatic optimization techniques to avoid such complexity when formally verifying the correctness of the circuit. This paper presents dedicated techniques for optimization of formal verification of asynchronous circuits, these include for instance: automata reduction, pre-order reduction and automatic abstraction. All these techniques have been implemented and tested in a formal verification environment.

Published in:

Electronics, Circuits and Systems, 2007. ICECS 2007. 14th IEEE International Conference on

Date of Conference:

11-14 Dec. 2007