21 citations · 38 across the 3 of their papers we have counts for
3 papers
cs.LO2013★ 1 cited
Some notes on model rotation
Siert Wieringa
Model rotation is an efficient technique for improving MUS finding algorithms. In previous work we have studied model rotation as an algorithm that traverses a graph which is induc…
cs.DC2013★ 21 cited
Synchronous Counting and Computational Algorithm Design
Danny Dolev, Keijo Heljanko, Matti Järvisalo +5
Consider a complete communication network on nodes, each of which is a state machine. In synchronous 2-counting, the nodes receive a common clock pulse and they have to agree o…
cs.LO2009★ 16 cited
Tarmo: A Framework for Parallelized Bounded Model Checking
Siert Wieringa, Matti Niemenmaa, Keijo Heljanko
This paper investigates approaches to parallelizing Bounded Model Checking (BMC) for shared memory environments as well as for clusters of workstations. We present a generic framew…