226 citations · 234 across the 8 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.LO2012★ 5 cited
Extending Clause Learning SAT Solvers with Complete Parity Reasoning (extended version)
Tero Laitinen, Tommi Junttila, Ilkka Niemelä
Instances of logical cryptanalysis, circuit verification, and bounded model checking can often be succinctly represented as a combined satisfiability (SAT) problem where an instanc…
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…