Solving Quantified Verification Conditions using Satisfiability Modulo Theories

Solving Quantified Verification Conditions using Satisfiability Modulo Theories” by Yeting Ge, Clark Barrett, and Cesare Tinelli. In Proceedings of the 21^st International Conference on Automated Deduction (CADE '07), (Frank Pfenning, ed.), July 2007, pp. 167-182. Bremen, Germany.

BibTeX entry:

@inproceedings{GBT07,
   author = {Yeting Ge and Clark Barrett and Cesare Tinelli},
   editor = {Frank Pfenning},
   title = {Solving Quantified Verification Conditions using
	Satisfiability Modulo Theories},
   booktitle = {Proceedings of the {\it 21^{st}} International Conference
	on Automated Deduction (CADE '07)},
   series = {Lecture Notes in Artificial Intelligence},
   volume = {4603},
   pages = {167--182},
   publisher = {Springer-Verlag},
   month = jul,
   year = {2007},
   note = {Bremen, Germany},
   url = {http://www.cs.nyu.edu/~barrett/pubs/GBT07.pdf}
}

(This webpage was created with bibtex2web.)