CVC Lite: A New Implementation of the Cooperating Validity Checker
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.
KeywordsDecision Procedure Automate Theorem Prover Predicate Abstraction Linear Arithmetic Uninterpreted Function
- 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.Barrett, C.W.: Checking Validity of Quantifier-Free Formulas in Combinations of First-Order Theories. PhD thesis, Stanford University (2003)Google Scholar
- 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
- 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