6 papers
Efficient, Near Complete and Often Sound Hybrid Dynamic Data Race Prediction (extended version)
Martin Sulzmann, Kai Stadtmüller
Dynamic data race prediction aims to identify races based on a single program run represented by a trace. The challenge is to remain efficient while being as sound and as complete…
Predicting All Data Race Pairs for a Specific Schedule (extended version)
Martin Sulzmann, Kai Stadtmüller
We consider the problem of data race prediction where the program's behavior is represented by a trace. A trace is a sequence of program events recorded during the execution of the…
Data Race Prediction for Inaccurate Traces
Martin Sulzmann, Kai Stadtmüller
Happens-before based data race prediction methods infer from a trace of events a partial order to check if one event happens before another event. If two two write events are unord…
Two-Phase Dynamic Analysis of Message-Passing Go Programs based on Vector Clocks
Martin Sulzmann, Kai Stadtmueller
Understanding the run-time behavior of concurrent programs is a challenging task. A popular approach is to establish a happens- before relation via vector clocks. Thus, we can iden…
Trace-Based Run-time Analysis of Message-Passing Go Programs
Martin Sulzmann, Kai Stadtmüller
We consider the task of analyzing message-passing programs by observing their run-time behavior. We introduce a purely library-based instrumentation method to trace communication e…
Static Trace-Based Deadlock Analysis for Synchronous Mini-Go
Kai Stadtmüller, Martin Sulzmann, Peter Thiemann
We consider the problem of static deadlock detection for programs in the Go programming language which make use of synchronous channel communications. In our analysis, regular expr…