Readings

• For 9/16/2008: Introduction to the Ordinals
• For 9/26/2008:
  • Hilbert Levitz. Transfinite Ordinals and Their Notations: For the Uninitiated
  • Frederick Gass. Constructive Ordinal Notation Systems
  • Panagiotis Manolios and Daron Vroon. Ordinal Arithmetic: Algorithms and Mechanization
• For October 3, 2008:
  • Chin Soon Lee, Neil D. Jones, and Amir M. Ben-Amram. The Size-Change Principle for Program Termination.
  • Panagiotis Manolios and Daron Vroon. Termination Analysis with Calling Context Graphs
• For October 10, 2008:
  • Lintao Zhang and Sharad Malik. The Quest for Efficient Boolean Satisfiability Solvers. Proceedings of the 18th International Conference on Automated Deduction, 2002. Springer.
  • Robert Nieuwenhuis, Albert Oliveras, and Cesare Tinelli. Solving SAT and SAT Modulo Theories: from an Abstract Davis-Putnam-Logemann-Loveland Procedure to DPLL(T). Journal of the ACM, 53(6):937-977, November 2006.
  • Leonardo de Moura, Bruno Dutertre, and Natarajan Shankar. A Tutorial on Satisfiability Modulo Theories. CAV 2007.

Last modified: Tue Oct 7 11:21:42 EDT 2008