Advertisement

Underapproximation for Model-Checking Based on Random Cryptographic Constructions

  • Arie Matsliah
  • Ofer Strichman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4590)

Abstract

For two naturals m,n such that m < n, we show how to construct a circuit C with m inputs and n outputs, that has the following property: for some 0 ≤ k ≤ m, the circuit defines a k-universal function. This means, informally, that for every subset K of k outputs, every possible valuation of the variables in K is reachable (we prove that k is very close to m with an arbitrarily high probability). Now consider a circuit M with n inputs that we wish to model-check. Connecting the inputs of M to the outputs of C gives us a new circuit M′ with m inputs, that its original inputs have freedom defined by k. This is a very attractive feature for underapproximation in model-checking: on one hand the combined circuit has a smaller number of inputs, and on the other hand it is expected to find an error state fast if there is one.

We report initial experimental results with bounded model checking of industrial designs (the method is equally applicable to unbounded model checking and to simulation), which shows mixed results. An interesting observation, however, is that in 13 out of 17 designs, setting m to be n/5 is sufficient to detect the bug. This is in contrast to other underapproximation that are based on reducing the number of inputs, which in most cases cannot detect the bug even with m = n/2.

References

  1. 1.
    Amla, N., McMillan, K.: Automatic abstraction without counterexamples. In: Garavel, H., Hatcliff, J. (eds.) ETAPS 2003 and TACAS 2003. LNCS, vol. 2619, Springer, Heidelberg (2003)Google Scholar
  2. 2.
    Barner, S., Grumberg, O.: Combining symmetry reduction and upper-approximation for symbolic model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, Springer, Heidelberg (2002)Google Scholar
  3. 3.
    Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. J. ACM 50(5), 752–794 (2003)CrossRefGoogle Scholar
  4. 4.
    Clarke, E., Gupta, A., Strichman, O.: SAT based counterexample-guided abstraction-refinement. Transactions on Computer Aided Design (TCAD) 23(7), 1113–1123 (2004)CrossRefGoogle Scholar
  5. 5.
    Glusman, M., Kamhi, G., Mador-Haim, S., Fraer, R., Vardi, M.Y.: Multiple-counterexample guided iterative abstraction refinement: An industrial evaluation. In: Garavel, H., Hatcliff, J. (eds.) ETAPS 2003 and TACAS 2003. LNCS, vol. 2619, pp. 176–191. Springer, Heidelberg (2003)Google Scholar
  6. 6.
    Grumberg, O., Lerda, F., Strichman, O., Theobald, M.: Proof-guided underapproximation-widening for multi-process systems. In: POPL 2005. Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 122–131. ACM Press, New York (2005)CrossRefGoogle Scholar
  7. 7.
    Hartman, A., Raskin, L.: Problems and algorithms for covering arrays. Discrete Math. 284, 149–156 (2004)zbMATHCrossRefGoogle Scholar
  8. 8.
    Kurshan, R.: Computer aided verification of coordinating processes. Princeton University Press, Princeton, NJ (1994)Google Scholar
  9. 9.
    Nisan, N., Wigderson, A.: Hardness vs randomness. Journal of Computer and System Sciences 49, 146–167 (1994)CrossRefGoogle Scholar
  10. 10.
    Ravi, K., Somenzi, F.: High-density reachability analysis. In: Proc. Intl. Conf. on Computer-Aided Design, pp. 154–158 (November 1995)Google Scholar
  11. 11.
    Ravi, K., Somenzi, F.: Hints to accelerate symbolic traversal. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol. 1703, pp. 250–264. Springer, Heidelberg (1999)Google Scholar
  12. 12.
    Seroussi, G., Bshouty, N.: Vector sets for exhaustive testing of logic circuits. IEEE Transactions on Information Theory, 34 (1988)Google Scholar
  13. 13.
    Williams, R., Gomes, C.P., Selman, B.: Backdoors to typical case complexity. In: IJCAI, pp. 1173–1178 (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Arie Matsliah
    • 1
    • 2
  • Ofer Strichman
    • 1
    • 3
  1. 1.IBM Haifa Research Laboratory, HaifaIsrael
  2. 2.Faculty of Computer Science, Technion, HaifaIsrael
  3. 3.Information Systems Engineering, IE, Technion, HaifaIsrael

Personalised recommendations