Reaching Coverage Closure in Post-silicon Validation

  • Allon Adir
  • Amir Nahir
  • Avi Ziv
  • Charles Meissner
  • John Schumann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6504)


Obtaining coverage information in post-silicon validation is a difficult task. Adding coverage monitors to the silicon is costly in terms of timing, power, and area, and thus even if feasible, is limited to a small number of coverage monitors. We propose a new method for reaching coverage closure in post-silicon validation. The method is based on executing the post-silicon exercisers on a pre-silicon acceleration platform, collecting coverage information from these runs, and harvesting important test templates based on their coverage. This method was used in the verification of IBM’s POWER7 processor. It contributed to the overall high-quality verification of the processor, and specifically to the post-silicon validation and bring-up.


Coverage Event Coverage Information Test Plan Stimulus Generation Coverage Hole 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Wile, B., Goss, J.C., Roesner, W.: Comprehensive Functional Verification - The Complete Industry Cycle. Elsevier, Amsterdam (2005)Google Scholar
  2. 2.
    ITRS: International technology roadmap for semiconductors 2007 edn. - design (2007),
  3. 3.
    Rotithor, H.G.: Postsilicon validation methodology for microprocessors. IEEE Design & Test of Computers 17(4), 77–88 (2000)CrossRefGoogle Scholar
  4. 4.
    Abramovici, M., Bradley, P., Dwarakanath, K., Levin, P., Memmi, G., Miller, D.: A reconfigurable design-for-debug infrastructure for socs. In: Proceedings of the 43rd Design Automation Conference, pp. 7–12 (2006)Google Scholar
  5. 5.
    Chang, K.h., Markov, I.L., Bertacco, V.: Automating post-silicon debugging and repair. In: Proceedings of the 2007 International Conference on Computer-Aided Design, pp. 91–98 (2007)Google Scholar
  6. 6.
    De Paula, F.M., Gort, M., Hu, A.J., Wilton, S.J.E., Yang, J.: Backspace: formal analysis for post-silicon debug. In: Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design, pp. 1–10 (2008)Google Scholar
  7. 7.
    Chen, K., Malik, S., Patra, P.: Runtime validation of memory ordering using constraint graph checking. In: HPCA, pp. 415–426 (2008)Google Scholar
  8. 8.
    Piziali, A.: Functional Verification Coverage Measurement and Analysis. Springer, Heidelberg (2004)Google Scholar
  9. 9.
    Azatchi, H., Fournier, L., Marcus, E., Ur, S., Ziv, A., Zohar, K.: Advanced analysis techniques for cross-product coverage. IEEE Transactions on Computers 55(11), 1367–1379 (2006)CrossRefGoogle Scholar
  10. 10.
    Buchnik, E., Ur, S.: Compacting regression-suites on-the-fly. In: Proceedings of the 4th Asia Pacific Software Engineering Conference (1997)Google Scholar
  11. 11.
    Fine, S., Ur, S., Ziv, A.: A probabilistic regression suite for functional verification. In: Proceedings of the 41st Design Automation Conference, pp. 49–54 (2004)Google Scholar
  12. 12.
    Levinger, M.: Building a bridge: from pre-silicon verification to post-silicon validation (2008),
  13. 13.
    Bin, E., Emek, R., Shurek, G., Ziv, A.: Using a constraint satisfaction formulation and solution techniques for random test program generation. IBM Systems Journal 41(3), 386–402 (2002)CrossRefGoogle Scholar
  14. 14.
    Adir, A., Almog, E., Fournier, L., Marcus, E., Rimon, M., Vinov, M., Ziv, A.: Genesys-Pro: Innovations in test program generation for functional processor verification. IEEE Design and Test of Computers 21(2), 84–93 (2004)CrossRefGoogle Scholar
  15. 15.
    Wagner, I., Bertacco, V., Austin, T.M.: Shielding against design flaws with field repairable control logic. In: Proceedings of the 43rd Design Automation Conference, pp. 344–347 (2006)Google Scholar
  16. 16.
    Copty, S., Fine, S., Ur, S., Yom-Tov, E., Ziv, A.: A probabilistic alternative to regression suites. Theor. Comput. Sci. 404(3), 219–234 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)zbMATHGoogle Scholar
  18. 18.
    Chvatal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4(3), 233–235 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Darringer, J., et al.: EDA in IBM: past, present, and future. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 19(12), 1476–1497 (2000)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Allon Adir
    • 1
  • Amir Nahir
    • 1
  • Avi Ziv
    • 1
  • Charles Meissner
    • 2
  • John Schumann
    • 2
  1. 1.IBM Research LaboratoryHaifaIsrael
  2. 2.IBM Server and Technology GroupAustinUSA

Personalised recommendations