Department of Computer Science
New York University
Email: yeting at cs nyu edu
Research
My research interests are formal methods and automated theorem
proving. My PhD advisor is Clark
Barrett.
Personal
I defended my dissertation in November 2009. After that I was a postdoctoral scholar at University of Iowa, working with Cesare Tinelli. Since September 2010, I work for Two Sigma in SoHo, writing code for automatic trading system.
Yeting Ge, Clark Barrett, and Cesare Tinelli. Solving Quantified
Verification Conditions using Satisfiability Modulo Theories.
Annals of Mathematics and Artificial Intelligence, 55(1), 2009.
Yeting Ge, Clark Barrett, and Cesare Tinelli. Solving Quantified Verification Conditions using
Satisfiability Modulo Theories. In Frank Pfenning, editor,
Proceedings of the 21st International Conference on Automated
Deduction (CADE 21), volume 4603 of Lecture Notes in Artificial
Intelligence, pages 167-182. Springer-Verlag, July 2007. Bremen, Germany.
Sean McLaughlin, Clark Barrett, and Yeting Ge. Cooperating
Theorem Provers: A Case Study Combining HOL-Light and CVC Lite. In
Proceedings of the Third Workshop on Pragmatics of Decision Procedures
in Automated Reasoning (PDPAR '05), volume 144(2) of Electronic Notes
in Theoretical Computer Science, pages 43-51. Elsevier, January
2006. Edinburgh, Scotland.