1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.LO2014★ 1 cited
Conflict-Driven XOR-Clause Learning (extended version)
Tero Laitinen, Tommi Junttila, Ilkka Niemelä
Modern conflict-driven clause learning (CDCL) SAT solvers are very good in solving conjunctive normal form (CNF) formulas. However, some application problems involve lots of parity…
cs.LO2012
SMT-based Induction Methods for Timed Systems
Roland Kindermann, Tommi Junttila, Ilkka Niemelä
Modeling time related aspects is important in many applications of verification methods. For precise results, it is necessary to interpret time as a dense domain, e.g. using timed…