1. J.R. Burch, D.L. Dill, Automatic verification of pipelined microprocessor control, in: D.L. Dill (Ed.), 6th International Conference on Computer Aided Verification, CAV’94, vol. 818 of Lecture Notes in Computer Science, Springer, 1994, pp. 68–80.
2. A. Armando, C. Castellini, E. Giunchiglia, SAT-based procedures for temporal reasoning, in: S. Biundo, M. Fox (Eds.), 5th European Conference on Planning, ECP’99, vol. 1809 of Lecture Notes in Computer Science, Springer, 2000, pp. 97–108.
3. L. de Moura, H. Rueß, Lemmas on demand for satisfiability solvers, in: 5th International Conference on Theory and Applications of Satisfiability Testing, SAT’02, 2002, pp. 244–251.
4. G. Audemard, P. Bertoli, A. Cimatti, A. Kornilowicz, R. Sebastiani, A. SAT-based approach for solving formulas over Boolean and Linear Mathematical propositions, in: A. Voronkov (Ed.), 18th International Conference on Automated Deduction, CADE’02, vol. 2392 of Lecture Notes in Conference Science, Springer, 2002, pp. 195–210.
5. C. Barrett, D. Dill, A. Stump, Checking satisfiability of first-order formulas by incremental translation into SAT, in: E. Brinksma, K.G. Larsen (Eds.), 14th International Conference on Computer Aided Verification, CAV’02, vol. 2404 of Lecture Notes in Computer Science, Springer, 2002, pp. 236–249.