Angelis, E. D., Fioravanti, F., Proietti, M. and Pettorossi, A. 2012. Software model checking by program specialization. In CILC, 89–103.
Beyer, D., Henzinger, T., Jhala, R. and Majumdar, R. 2007. The software model checker BLAST. International Journal on Software Tools for Technology Transfer (STTT) 9, 505–525.
Chico de Guzmán, P., Carro, M., Hermenegildo, M. V. and Stuckey, P. J. 2012. A general implementation framework for tabled CLP. In FLOPS, 104–119.
Christ, J., Hoenicke, J. and Nutz, A. 2012. SMTInterpol: An interpolating SMT solver. In SPIN, 248–254.
Cimatti, A., Griggio, A. and Sebastiani, R. 2008. Efficient interpolant generation in satisfiability modulo theories. In TACAS, 397–412.
Codognet, P. 1995. A tabulation method for constraint logic programming. In Symposium and Exhibition on Industrial Applications of Prolog.
Craig, W. 1957. Linear reasoning: A new form of the Herbrand-Gentzen theorem. Journal of Symbolic Logic 22, 3, 250–268.
Graf, S. and Saïdi, H. 1997. Construction of abstract state graphs with pvs. In CAV, 72–83.
Grebenshchikov, S., Lopes, N. P., Popeea, C. and Rybalchenko, A. 2012. Synthesizing software verifiers from proof rules. In PLDI, 405–416.
Griggio, A. 2012. A practical approach to satisfiability modulo linear integer arithmetic. Journal on Satisfiability, Boolean Modeling and Computation 8, 1–27.
Gulwani, S., Mehra, K. K. and Chilimbi, T. M. 2009. SPEED: Precise and efficient static estimation of program computational complexity. In POPL, 127–139.
Gupta, A., Popeea, C. and Rybalchenko, A. 2011a. Predicate abstraction and refinement for verifying multi-threaded programs. In POPL, 331–344.
Gupta, A., Popeea, C. and Rybalchenko, A. 2011b. Solving recursion-free Horn clauses over LI+UIF. In APLAS, 188–203.
Henzinger, T. A., Jhala, R., Majumdar, R. and McMillan, K. L. 2004. Abstractions from proofs. In POPL, 232–244.
Hermenegildo, M. V., Bueno, F., Carro, M., López-García, P., Mera, E., Morales, J. F. and Puebla, G. 2012. An overview of Ciao and its design philosophy. Theory and Practice of Logic Programming 12, 1–2, 219–252.
Jaffar, J. and Lassez, J. 1987. Constraint logic programming. In POPL, 111–119.
Jaffar, J., Murali, V., Navas, J. A. and Santosa, A. E. 2012. TRACER: A symbolic execution tool for verification. In CAV, 758–766.
Jaffar, J., Santosa, A. E. and Voicu, R. 2008. Efficient memoization for dynamic programming with ad-hoc constraints. In AAAI, 297–303.
Jaffar, J., Santosa, A. E. and Voicu, R. 2009. An interpolation method for CLP traversal. In CP, 454–469.
Jhala, R. and McMillan, K. L. 2006. A practical and complete approach to predicate refinement. In TACAS, 459–473.
Marriott, K. and Stuckey, P. J. 1998. Introduction to Constraint Logic Programming. MIT Press, Cambridge, MA, USA.
McMillan, K. L. 2010. Lazy annotation for program testing and verification. In CAV, 104–118.
McMillan, K. L. 2011. Interpolants from z3 proofs. In FMCAD, 19–27.
Rümmer, P., Hojjat, H. and Kuncak, V. 2013. Disjunctive interpolants for horn-clause verification. In CAV, 347–363.
Tamaki, H. and Sato, T. 1986. OLD resolution with tabulation. In ICLP, 84–98.
Warren, D. S. 1992. Memoing for logic programs. Communcations of the ACM 35, 3, 93–111.
