By Topic

Using abstraction for efficient formal verification of pipelined processors with value prediction

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
$31 $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

1 Author(s)

Presented are abstraction techniques that accelerate the formal verification of pipelined processors with value prediction. The formal verification is done by modeling based on the logic of equality with uninterpreted functions and memories (EUFM), and using an automatic tool flow. Applying special abstractions in previous work had resulted in EUFM correctness formulas where most of the terms (abstract word-level values) appear in only positive equations (equality comparisons) or as arguments of uninterpreted functions and uninterpreted predicates, allowing such terms to be treated as distinct constants - a property called positive equality. That property produced orders of magnitude speedup. However, in processors with value prediction, the mechanism for correcting value mispredictions introduces both positive and negated equations between the actual and predicted values, thus reducing significantly the potential for exploiting positive equality. The contributions of this paper are: 1) modeling and formal verification of pipelined processors with load-value prediction and fully implemented mechanism for correcting load-value mispredictions; 2) an approach to abstract the mechanism for detecting load-value mispredictions, thus allowing the use of positive equality, at the cost of enriching the specification processor with the abstracted mechanism for detecting load-value mispredictions; and 3) the observation that this abstraction technique is general and applicable to the formal verification of pipelined processors with other forms of value prediction, e.g., branch prediction, as illustrated with experimental results. The presented abstraction technique produced an order of magnitude speedup when formally verifying a 5-stage pipelined processor with load-value prediction. It can be expected that the speedup would be significantly greater for more complex processors with value prediction

Published in:

Quality Electronic Design, 2006. ISQED '06. 7th International Symposium on

Date of Conference:

27-29 March 2006