Readings

• First 2 lectures: Whatever text you last used that covered NP-completeness.
• For Sep 13:
  • Lintao Zhang and Sharad Malik. The Quest for Efficient Boolean Satisfiability Solvers. Proceedings of the 18th International Conference on Automated Deduction, 2002. Springer.
  • Lintao Zhang, Conor F. Madigan, Matthew H. Moskewicz, and Sharad Malik. Efficient conflict driven learning in a boolean satisfiability solver. Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, 2001. IEEE.

• For Sep 21:
  • Niklas Een and Niklas Sorensson. An Extensible SAT-solver. In Proceedings of the Theory and Applications of Satisfiability Testing (SAT), 2003.
  • Niklas Een and Armin Biere. Effective Preprocessing in SAT through Variable and Clause Elimination. In Proceedings of the Theory and Applications of Satisfiability Testing (SAT), 2005.
  • Karl Brace, Richard Rudell, and Randal Bryant. Efficient Implementation of a BDD Package. In Proceedings of the 27th Design Automation Conference (DAC), 1990.

• For Oct 3:
  • Andreas Kuehlmann, Viresh Paruthi, Florian Krohm, and Malay K. Ganai. Robust Boolean Reasoning for Equivalence Checking and Functional Property Verification. In IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 21, No. 12, 2002.
  • Alan Mishchenko, Satrajit Chatterjee, Robert Brayton, and Niklas Een. Improvements to Combinational Equivalence Checking. In Proceedings of the IEEE International Conference on Computer Aided Design (ICCAD), 2006.

• For Oct 5:
  • E. Allen Emerson. Model Checking and the Mu-calculus. Proceedings of the DIMACS Symposium on Descriptive Complexity and Finite Model, N. Immerman and P. Kolaitis, eds., American Mathematical Society Press, Pages 185-214.

• For Oct 19:
  • Panagiotis Manolios and Richard Trefler. A Lattice-Theoretic Characterization of Safety and Liveness. Twenty-Second ACM Symposium on Principles of Distributed Computing (PODC 2003), pages 325-333. ACM Press, July 2003.
  • Moshe Vardi. An automata-theoretic approach to linear temporal logic. 1996.

• For Oct 26:
  • Niklas Een and Niklas Sorensson. Translating Pseudo-Boolean Constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation 2 (2006) 1-25.
  • Panagiotis Manolios, Sudarshan K. Srinivasan, and Daron Vroon. Automatic Memory Reductions for RTL Model Verification. ACM-IEEE International Conference on Computer Aided Design (ICCAD) 2006.

• For the week starting Oct 29: Review first order logic.
• For the week starting Nov 5: CAR: Computer Aided Reasoning, Chapters 1-7.
• For the two weeks starting Nov 12: Finish reading CAR: Computer Aided Reasoning.
• For the week starting Nov. 26:
  • 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: Thu Oct 25 00:04:06 EDT 2007