5 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.LO2013
Bounded Model Checking of an MITL Fragment for Timed Automata
Roland Kindermann, Tommi Junttila, Ilkka Niemelä
Timed automata (TAs) are a common formalism for modeling timed systems. Bounded model checking (BMC) is a verification method that searches for runs violating a property using a SA…
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…