Now showing items 1-4 of 4
(Research report / Forskningsrapport, 2018)
A multitude of weak memory models exists supporting various types of relaxations and different synchronization primitives. On one hand, they must be lax enough to allow for hardware and compiler optimizations; on the other, ...
An operational semantics for a weak memory model with buffered writes, message passing, and goroutines
(Research report / Forskningsrapport, 2017)
In this paper, we formalize an operational semantics of a weak memory model similar to the one in Go, concentrating on buffered writes, i.e., ignoring the possibility of buffered reads.
(Research report / Forskningsrapport, 2012)
This report extends our behavioral type and effect system for detecting dealocks in  by polymorphism and formalizing type inference (wrt. the lock types. Our inference is defined for a simple concurrent, first-order ...
(Research report / Forskningsrapport, 2011)
Deadlocks are a common error in programs with lock-based concurrency and are hard to avoid or even to detect. One way for deadlock prevention is to statically analyze the program code to spot sources of potential deadlocks. ...