Advertisement

CVC Lite: A New Implementation of the Cooperating Validity Checker

Category B
  • Clark Barrett
  • Sergey Berezin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3114)

Abstract

We describe a tool called CVC Lite (CVCL), an automated theorem prover for formulas in a union of first-order theories. CVCL supports a set of theories which are useful in verification, including uninterpreted functions, arrays, records and tuples, and linear arithmetic. New features in CVCL (beyond those provided in similar previous systems) include a library API, more support for producing proofs, some heuristics for reasoning about quantifiers, and support for symbolic simulation primitives.

Keywords

Decision Procedure Automate Theorem Prover Predicate Abstraction Linear Arithmetic Uninterpreted Function 
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

  1. 1.
    Abu-Haimed, H., Berezin, S., Dill, D.L.: Strengthening invariants by symbolic consistency testing. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 407–419. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  2. 2.
    Barrett, C., Berezin, S.: A Proof-Producing Boolean Search Engine. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, Springer, Heidelberg (2003)Google Scholar
  3. 3.
    Barrett, C.W.: Checking Validity of Quantifier-Free Formulas in Combinations of First-Order Theories. PhD thesis, Stanford University (2003)Google Scholar
  4. 4.
    Barrett, C.W., Dill, D.L., Levitt, J.R.: Validity Checking for Combinations of Theories with Equality. In: Srivas, M., Camilleri, A. (eds.) FMCAD 1996. LNCS, vol. 1166, pp. 187–201. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  5. 5.
    Das, S., Dill, D.L.: Counter-example based predicate discovery in predicate abstraction. In: Formal Methods in Computer-Aided Design, November 2002, Springer, Heidelberg (2002)Google Scholar
  6. 6.
    Nelson, G., Oppen, D.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems 1(2), 245–257 (1979)zbMATHCrossRefGoogle Scholar
  7. 7.
    Stump, A., Barrett, C.W., Dill, D.L.: CVC: A Cooperating Validity Checker. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 500–504. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  8. 8.
    Zuck, L., Pnueli, A., Goldberg, B., Barrett, C., Fang, Y., Hu, Y.: Translation and run-time validation of optimized code. In: Preliminary version in Third Workshop on Runtime Verification, RV (2002); Formal Methods in Systems Design (2004) (to appear)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Clark Barrett
    • 1
  • Sergey Berezin
    • 2
  1. 1.New York University 
  2. 2.Stanford University 

Personalised recommendations