Integrating a SAT Solver with an LCF-style Theorem Prover (2005)

Cached

Download Links

by Tjark Weber
Venue:Proceedings of the Third International Workshop on Pragmatical Aspects of Decision Procedures in Automated Reasoning (PDPAR 2005
Citations:6 - 1 self

Active Bibliography

2 Efficiently Checking Propositional Resolution Proofs in Isabelle/HOL – Tjark Weber
6 Using a SAT solver as a fast decision procedure for propositional logic in an LCF-style theorem prover – Tjark Weber - 2005
313 Cute: a concolic unit testing engine for c – Koushik Sen, Darko Marinov, Gul Agha - 2005
238 Nusmv 2: An opensource tool for symbolic model checking – Alessandro Cimatti, Edmund Clarke, Enrico Giunchiglia, Fausto Giunchiglia, Marco Pistore, Marco Roveri, Roberto Sebastiani, Armando Tacchella - 2002
236 EXE: Automatically generating inputs of death – Cristian Cadar, Vijay Ganesh, Peter M. Pawlowski, David L. Dill, Dawson R. Engler - 2006
51 First-order proof tactics in higher-order logic theorem provers – Joe Hurd - 2003
36 Modular Data Structure Verification – Martin C. Rinard - 2007
194 A Fast Linear-Arithmetic Solver for DPLL(T – Bruno Dutertre, Leonardo De Moura - 2006
85 Lazy Satisfiability Modulo Theories – Roberto Sebastiani - 2007