Tero Laitinen

M.Sc. (Tech.)
Researcher

Office:Room TB253 (Theoretical Computer Science, 2nd Floor of the Computer Science Building)
Postal Address: Aalto University,
School of Science,
Department of Information and Computer Science,
P.O. Box 15400,
FI-00076 AALTO,
Finland
Email: tero.laitinen[AT]tkk.fi

Research Interest

computational logic, Boolean satisfiability problem, satisfiability modulo theories, parity constraints, answer set programming

Publications

  • Tero Laitinen, Tommi Junttila, and Ilkka Niemelš. Extending SAT Solvers with Complete Parity Reasoning. Accepted to ICTAI 2012.
  • Tero Laitinen, Tommi Junttila, and Ilkka Niemelš. Classifying and Propagating Parity Constraints. Accepted to CP 2012.
  • Tero Laitinen, Tommi Junttila, and Ilkka Niemelš. Conflict-driven XOR-clause learning. In SAT 2012, Springer, 2012.
  • Tero Laitinen, Tommi Junttila, and Ilkka Niemelš. Equivalence Class Based Parity Reasoning with DPLL(XOR). In ICTAI 2011, IEEE Press, 2011.
  • Tero Laitinen, Tommi Junttila, and Ilkka Niemelš. Extending Clause Learning DPLL with Parity Reasoning. In ECAI 2010, IOE Press, 2010.

Software

up-minisat - minisat 2.0 with UP-xor-reasoning module (SAT 2012 version)
up-substexp-minisat - minisat 2.0 with UP-xor-reasoning module using SUBST-xor-reasoning module for some xor-explanations (SAT 2012 version)
Benchmarks for SAT2012:
    Known keystream attack on Trivium (1-20 bits x 51 instances)
    Unsat benchmarks generated with grain-of-salt tool for Bivium, Crypto-1, Grain, Hitag2, and Trivium (grain-of salt at Mate Soos' home page)
subst-minisat - minisat 2.0 with SUBST-xor-reasoning module (ICTAI 2011 version)
ec-minisat - minisat 2.0 with EC-xor-reasoning module (ICTAI 2011 version)
Benchmarks for ICTAI2011:
    Known keystream attack on Grain
    Known keystream attack on Hitag2
    Known keystream attack on Trivium
xor-minisat 1.0 - minisat enhanced with a XOR satisfiability solver module.
Benchmarks for ECAI2010:
    Known plaintext attack on DES
    Known keystream attack on Trivium
    Randomly generated regular problems based on 3-bipartite graphs

Teaching

Spring 2012, course assistant, T-79.3001 Logic in Computer Science: Foundations

Autumn 2011, course assistant, T-79.5103 Computational Complexity Theory P

Spring 2011, course assistant, T-79.3001 Logic in Computer Science: Foundations

Autumn 2010, course assistant, T-79.5103 Computational Complexity Theory P

Spring 2010, course assistant, T-79.3001 Logic in Computer Science: Foundations

Autumn 2009, course assistant, T-79.5103 Computational Complexity Theory P