Earlier Seminar Reports

WS 2011

• Simon Legner
  Non-Linear Arithmetic – SAT Modulo Linear Arithmetic for Solving Polynomial Constraints
• Julian Nagele
  Higher-Order Dependency Pairs
• Michael Schaper
  Deciding the Complexity of Programs Automatically – Termination Graphs Revisited

SS 2011

• Simon Legner
  Non-Linear Arithmetic
• Julian Nagele
  Higher-Order Recursive Path Order
• Thomas Sternagel
  Automatic Proofs in Equational Logic (2)

WS 2010

• Thomas Sternagel
  Automatic Proofs in Equational Logic

SS 2009

• Martin Hammerer
  Satisfiability Games for CTL

WS 2008

• Matthias Gander
  Supercubing
• Martin Hammerer
  Satisfiability Games for LTL

SS 2008

• Martin Avanzini
  Calculating Polynomial Runtime Properties
• Stefan Kopeinig
  Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL
• Philipp Ruff
  Clause Learning in SAT Solving 2

WS 2007

• Martin Avanzini
  mwp-Bounds for Complexity Analysis
• Matthias Gander
  Symmetry Breaking in SAT Solving
• Philipp Ruff
  Clause Learning in SAT Solving
• Caroline Terzer
  Pseudo Boolean Constraint Solving 2
• Sarah Winkler
  From DPLL to DPLL(T)