论文信息 - CVC 3 - 字舞流文

CVC 3

CVC3, a joint project of NYU and U Iowa, is the new and latest ve rsion of the Cooperating Validity Checker. CVC3 extends and b uilds on the functionality of its predecessors and includes many new feature s such as support for additional theories, an abstract architecture for Boolean r soning, and SMT-LIB compliance. We describe the system and discuss some applica tions nd continuing work.

Clark Barrett | Cesare Tinelli

[1] David L. Dill,et al. Validity Checking for Combinations of Theories with Equality , 1996, FMCAD.

[2] M. Moskewicz,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[3] David L. Dill,et al. CVC: A Cooperating Validity Checker , 2002, CAV.

[4] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.

[5] Sergey Berezin,et al. CVC Lite: A New Implementation of the Cooperating Validity Checker Category B , 2004, CAV.

[6] Claude Marché,et al. Multi-prover Verification of C Programs , 2004, ICFEM.

[7] David Detlefs,et al. Simplify: a theorem prover for program checking , 2005, JACM.

[8] Amir Pnueli,et al. TVOC: A Translation Validator for Optimizing Compilers , 2005, CAV.

[9] Clark W. Barrett,et al. Cooperating Theorem Provers: A Case Study Combining HOL-Light and CVC Lite , 2006, Electron. Notes Theor. Comput. Sci..

[10] Cesare Tinelli,et al. Splitting on Demand in SAT Modulo Theories , 2006, LPAR.

[11] Damián Barsotti,et al. Verification of Clock Synchronization Algorithms: Experiments on a Combination of Deductive Tools , 2006, Electron. Notes Theor. Comput. Sci..

[12] Cesare Tinelli,et al. An Abstract Decision Procedure for Satisfiability in the Theory of Recursive Data Types , 2007, PDPAR/PaUL@FLoC.

[13] Cesare Tinelli,et al. Solving Quantified Verification Conditions Using Satisfiability Modulo Theories , 2007, CADE.