In order to apply formal methods in practice, the practitioner has to comprehend a vast
amount of research literature and realistically evaluate practical merits of different …

Data-intensive, graph-based computations are pervasive in several scientific applications,
and are known to to be quite challenging to implement on distributed memory systems. In …

Symbolic execution is a popular technique for automatically generating test cases achieving
high structural coverage. Symbolic execution suffers from scalability issues since the …

We describe an extension of the SPIN model checker for use on multicore shared-memory
systems and report on its performance. We show how, with proper load balancing, the time …

To improve the speed of the error convergence of the Monte Carlo method in the seismic
connectivity reliability assessment of power systems, the quasi-Monte Carlo method …

Abstract Model checking is a formal verification technique. It takes an exhaustively strategy
to check hardware circuits and network protocols against desired properties. Having been …

We present novel algorithms for parallel testing of code that takes structurally complex test
inputs. The algorithms build on the Korat algorithm for constraint-based generation of …

We present a new distributed-memory algorithm for enumerative LTL model-checking that is
designed to be run on a cluster of workstations communicating via MPI. The detection of …

This paper presents C ndfs, a tight integration of two earlier multi-core nested depth-first
search (N dfs) algorithms for LTL model checking. C ndfs combines the different strengths …

The central keywords of this thesis are “verification” and “distribution”. Verification refers to
the process of finding, by formal means, design errors in complex hardware and software …