We propose a novel approach for runtime monitoring and verification on computers with a
large number of computation cores. The goal of the approach is to minimize the impact of …

We propose a novel approach for runtime verification on computers with a large number of
computation cores, without any hardware extension to mainstream PC environment. The …

Programmers are taking advantage of the increasing availability of on-chip parallelism to
meet the rising performance demands of diverse applications. Support of tools that can …

GPU programming models enable and encourage massively parallel programming with
over a million threads, requiring extreme parallelism to achieve good performance. Massive …

Data races are among the most difficult to detect and costly bugs. Race detection has been
studied widely, but none of the existing tools satisfies the requirements of high speed …

With the widespread deployment of multi-core hardware, writing concurrent programs has
become inescapable. This has made fixing concurrency bugs (or crugs) critical in modern …

Run-time verification is a technique to reason about a program correctness. Given a set of
desirable properties and a program trace from the inspected program as an input, the …

Data races are egregious concurrency bugs that are especially problematic in performance-
oriented GPU codes where large thread counts and multiple shared memory regions tend to …

Most of the state-of-the-art verifiers do not scale well on complicated software. Concurrency
benchmarks from SV-COMP based on Linux device drivers cause significant difficulties for …

Concurrency in multithreaded programs introduces additional complexity in software
verification and testing, and thereby significantly increases the cost of Quality Assurance …