In this paper we propose a distributed message-passing algorithm for inference in large scale graphical models. Our method can handle large problems efficiently by distributing a...
Alexander Schwing, Hazan Tamir, Marc Pollefeys, Ra...
This paper provides an experimental study of the efficiency of simulation-based model-checking algorithms for continuous-time Markov chains by comparing: MRMC – the only tool t...
toolkit demonstrates that predicate abstraction enables automated verification of real world Windows device Our predicate abstraction-based tool DDVerify enables the automated ve...
Thomas Witkowski, Nicolas Blanc, Daniel Kroening, ...
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
Functional verification is one of the major bottlenecks in microprocessor design. Simulation-based techniques are the most widely used form of processor verification. Efficient ...