226 citations · 234 across the 8 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.LO2013★ 1 cited
Simulating Parity Reasoning (extended version)
Tero Laitinen, Tommi Junttila, Ilkka Niemelä
Propositional satisfiability (SAT) solvers, which typically operate using conjunctive normal form (CNF), have been successfully applied in many domains. However, in some applicatio…
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…