Abstract
A common technique in high-performance hardware design is to intersperse combinatorial logic freely between level-sensitive latch layers (wherein one layer is transparent during the “high” clock phase, and the next during the “low”). Such logic poses a challenge to verification — unless the two-phase netlist N may be abstracted to a full-cycle model N′ (wherein each memory element may sample every cycle), model checking of N requires at least twice as many state variables as would be necessary to obtain equivalent coverage for N′. We present an algorithm to automatically obtain such an abstraction by selectively eliminating latches from both layers. The abstraction is valid for model checking CTL* formulae which reason solely about latches of a single phase. This algorithm has been implemented in IBM’s model checker, RuleBase, and has been used to enable model checking of IBM’s Gigahertz Processor, which may not have been feasible otherwise. This abstraction has furthermore allowed verification engineers to write properties and environments more efficiently
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
S. Mador-Haim and L. Fix. Input Elimination and Abstraction in Model Checking. In G. Gopalakrishnan and P. Windley, editor, Proc. Conf. on Formal Methods in Computer-Aided Design, volume 1522, pages 304–320. Springer, November 1998.
K. Nowka and T. Galambos. Circuit Design Techniques for a Gigahertz Integer Microprocessor. In Proc. Intl. Conf. on Computer Design, October 1998.
C. E. Leiserson and J. B. Saxe. Optimizing Synchronous Systems. Journal of VLSI and Computer Systems, 1(1):41–67, Spring 1983.
I. Beer, S. Ben-David, C. Eisner, and A. Landver. RuleBase: an Industry-Oriented Formal Verification Tool. In Proc. Design Automation Conf., June 1996.
R. Milner. Communication and Concurrency. Prentice Hall, New York, 1989.
Z. Kohavi. Switching and Finite Automata Theory. Computer Science Series. McGraw-Hill Book Company, 1970.
O. Grumberg and D. E. Long. Module Checking and Modular Verification. ACM Transactions on Programming Languages and Systems, 16(3):843–871, 1994.
E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications. ACM Transactions on Programming Languages and Systems, 8(2):244–263, 1986.
K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
A. J. Hu, G. York, and D. L. Dill. New Techniques for Efficient Verification with Implicitly Conjoined BDDs. In Proc. Design Automation Conf., June 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baumgartner, J., Heyman, T., Singhal, V., Aziz, A. (1999). Model Checking the IBM Gigahertz Processor: An Abstraction Algorithm for High-Performance Netlists. In: Halbwachs, N., Peled, D. (eds) Computer Aided Verification. CAV 1999. Lecture Notes in Computer Science, vol 1633. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48683-6_9
Download citation
DOI: https://doi.org/10.1007/3-540-48683-6_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66202-0
Online ISBN: 978-3-540-48683-1
eBook Packages: Springer Book Archive