1. Lecture Notes in Computer Science;H. Abu-Haimed,2003
2. Lecture Notes in Artificial Intelligence;C. Barrett,2003
3. Barrett, C.W.: Checking Validity of Quantifier-Free Formulas in Combinations of First-Order Theories. PhD thesis, Stanford University (2003)
4. Lecture Notes in Computer Science;C.W. Barrett,1996
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)