activity
20002026
most citedType Inference for Guarded Recursive Data Types

17 citations · 33 across the 22 of their papers we have counts for

collaborators

24 papers

cs.PL2026

Critical Sections Are Not Per-Thread: A Trace Semantics for Lock-Based Concurrency

Martin Sulzmann

Locks are a standard mechanism for synchronizing concurrent threads. The standard lock set construction assumes that critical sections are confined to a single thread, and therefor…

cs.PL2025

Beyond Per-Thread Lock Sets: Multi-Thread Critical Sections and Dynamic Deadlock Prediction

Martin Sulzmann

Lock sets are commonly used for dynamic analysis of deadlocks. The standard per-thread lock set construction only considers locks acquired in the same thread, but is unaware of loc…

cs.PL2025

Partial Orders for Precise and Efficient Dynamic Deadlock Prediction

Bas van den Heuvel, Martin Sulzmann, Peter Thiemann

Deadlocks are a major source of bugs in concurrent programs. They are hard to predict, because they may only occur under specific scheduling conditions. Dynamic analysis attempts t…

cs.PL2023

Cross-thread critical sections and efficient dynamic race prediction methods

Martin Sulzmann, Peter Thiemann

The lock set method and the partial order method are two main approaches to guarantee that dynamic data race prediction remains efficient. There are many variations of these ideas.…

cs.PL2022

A Type-Directed, Dictionary-Passing Translation of Method Overloading and Structural Subtyping in Featherweight Generic Go

Martin Sulzmann, Stefan Wehr

Featherweight Generic Go (FGG) is a minimal core calculus modeling the essential features of the programming language Go. It includes support for overloaded methods, interface type…

cs.PL2022

Semantic preservation for a type directed translation scheme of Featherweight Go

Martin Sulzmann, Stefan Wehr

Featherweight Go (FG) is a minimal core calculus that includes essential Go features such as overloaded methods and interface types. The most straightforward semantic description o…