- Yang Cai, Ting Zhang. Can Nondeterminism Help Complementation? in the proceedings of GandALF 2012.
- Yang Cai, Ting Zhang. A Tight Lower Bound for Streett Complementation. appears in the proceedings of FSTTCS 2011.
- Yang Cai, Ting Zhang. Tight Upper Bounds for Streett and Parity Complementation. appears in the proceedings of CSL 2011.
Automated Reasoning, with focuses on mathematical techniques for program analysis and verification, including theorem proving, decision procedures, automata theory, and model logics.
If you are not at ISU, please apply here. If you are already a student at ISU, please drop me a message and we can find time to chat.
Program Committee Member, The 9th International Conference on Theory and Applications of Models of Computation (TAMC 2012), May 16-21, 2012, Beijing, China.
Program Committee Member, The 7th IEEE International Conference on Embedded Software and Systems (ICESS 2010), June 29-July 01, 2010, Bradford, UK.
Program Committee Member, 2010 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (SUTC 2010), June 7-9, 2010, Hyatt Regency Newport Beach, Newport Beach, California, USA.
Program Committee Member, The 5th International Conference on Theory and Applications of Models of Computation (TAMC 2008), April 25-29, 2008, XI'an, China.
COM S 541: Type Theory and Programming Languages (Fall 2012)
COM S 331: Theory of Computing (Spring 2011)
COM S 641: Games in Logic, Synthesis and Verification (Spring 2010)
COM S 342: Principles of Programming Languages (Fall 2009, Fall 2008)