1. Ashar, P., Ganai, M.K., Gupta, A., Ivancic, F., Yang, Z.: Efficient SAT-based bounded model checking for software verification. In: Margaria, T., Steffen, B., Philippou, A., Reitenspieß, M. (eds.) International Symposium on Leveraging Applications of Formal Methods (ISoLA). Technical Report, vol. TR-2004-6, pp. 157–164, Department of Computer Science, University of Cyprus, Paphos, Cyprus, October 2004
2. Balabanov, V., Chiang, H.K., Jiang, J.R.: Henkin quantifiers and boolean formulae: a certification perspective of DQBF. Theor. Comput. Sci. 523, 86–100 (2014)
3. Balabanov, V., Jiang, J.H.R.: Reducing satisfiability and reachability to DQBF, September 2015. Talk at the International Workshop on Quantified Boolean Formulas (QBF)
4. Lecture Notes in Computer Science;A Biere,2005
5. Biere, A., Cimatti, A., Clarke, E.M., Strichman, O., Zhu, Y.: Bounded model checking. Adv. Comput. 58, 117–148 (2003)