Matthew J. Parkinson
where else to find them
no profile links on file
what they talk about
where they keep going back
- PLDI Workshop Honoring Andreas Podelski3 editions2024–2026
all 7 in the filters
on a stage with
all 20 in the filters
who talks about the same things
- Tobias Wrigstad15 talks
- Sylvan Clebsch9 talks
- Matthew A. Johnson3 talks
- Sophia Drossopoulou11 talks
- Jeehoon Kang14 talks
- Andreas Pavlogiannis18 talks
| title | conference | date |
|---|---|---|
| Dynamically Checked Deep Immutability in Python | PLDI 2026 | 2026-06-15 |
Adds deep immutability to CPython 3.15 via 7,000 lines of runtime code, an atomic refcount for immutable objects, and write barriers inserted at 148 hot sites… | ||
| Dynamic Region Ownership for Concurrency Safety | PLDI 2025 | 2025-06-16 |
Claims a runtime ownership model, Langfish, that enforces exclusive mutable access by grouping objects into regions and raising deterministic errors instead of… | ||
| Trieste: A C++ DSL for Flexible Tree Rewriting (Tool paper) | SLE 2024 | 2024-10-20 |
Trieste is a C++ DSL that implements in-place subtree pattern matching to run multipass compiler pipelines, with each pass checked by dynamic well-formedness… | ||
| Reference Counting Deeply Immutable Data Structures with Cycles | ISMM 2024 | 2024-06-25 |
Claim: deeply frozen object graphs are collectible by reference counting by collapsing strongly connected components and maintaining single reference counter… | ||
| BatchIt: Optimizing Message-Passing Allocators for Producer-Consumer Workloads | ISMM 2024 | 2024-06-25 |
Adds a small per-slab associative cache of remote frees that batches objects heading to the same slab, implemented for mimalloc and snmalloc implementations… | ||
| Concurrent Immediate Reference Counting | PLDI 2024 | 2024-06-24 |
A new system, Concurrent Immediate Reference Counting, combines reference counting with SMR (EBR) to record a decrement EPO per object and use a global epoch… | ||
| Concurrent Mutation must go | POCL 2024 | 2024-01-16 |
Argument: concurrent mutation causes the costly read-reclaim race so the simple claim is remove concurrent mutation for temporal safety. Evidence: survey of… | ||
| Some things I wish I hadn’t seen | The Future of Weak Memory 2024 | 2024-01-15 |
Finds real code patterns in the .NET runtime and a Microsoft project that use flush_process_write_buffers as an intentionally heavyweight IPI to restore… | ||
| Designing Wait-free Weak Reference Counting | O'Hearn Fest (POPL 2024) | 2024-01-14 |
Claims a wait-free weak reference counting algorithm that lets weak-to-strong promotions terminate regardless of other threads by changing the state machine… | ||
| Reference Capabilities for Flexible Memory Management | OOPSLA 2023 | 2023-10-23 |
Verona organises all objects into tree-shaped regions with a window of mutability that only allows allocation and deallocation in the active region, making… | ||
| When Concurrency Matters: Behaviour-Oriented Concurrency | OOPSLA 2023 | 2023-10-23 |
Behaviour-Oriented Concurrency (BoC) introduces cones as exclusive shared-data owners, behaviors as spawned units that declare required cones, and a single… | ||
| nothing matches | ||