Sebastian Burckhardt

Senior Principal Researcher

For quick access, here is a short list of my publications.

[VLDB’22] Netherite: Efficient Execution of Serverless Workflows
[OOPSLA’21] Durable Functions: Semantics for Stateful Serverless
[arXiv’21] Serverless Workflows with Durable Functions and Netherite (opens in new tab)
[OOPSLA’18] Reactive Caching for Composed Services
[OOPSLA’17] Geo-Distribution of Actor-Based Services
[DISC’17] Consistency Models with Global Operation Sequencing and their Composition
[PODC’16] Specification and Complexity of Collaborative Text Editing
[ECOOP’15] Global Sequence Protocol: A Robust Abstraction for Replicated Shared State
[Foundations and Trends® in Programming Languages 1, 1-2 (Oct. 2014)]
Principles of Eventual Consistency, available as a free pdf download on publisher site (opens in new tab)
[POPL’14] Replicated Data Types: Specification, Verification, Optimality (complete version w/ proofs)
[PLDI’13] It’s Alive! Continuous Feedback in UI Programming
[TechReport 2013-39] Understanding Eventual Consistency
[PLDI’12] Multicore Acceleration of Priority-Based Scheduler for Concurrency Bug Detection
[ECOOP’12] Cloud Types for Eventual Consistency
[ESOP’12] Eventually Consistent Transactions, full version available here
[ESOP’12] What’s Decidable About Weak Memory Models?
[ESOP’12] Concurrent Library Correctness on the TSO Memory Model
[OOPSLA’11] (Distinguished Paper Award) Two for the Price of One: A Model for Parallel and Incremental Computation
[Haskell’11] Prettier Concurrency: Purely Functional Concurrent Revisions
[WoDet’11] Roll Forward, Not Back: A Case for Deterministic Conflict Resolution
[ESOP’11] Semantics of Concurrent Revisions, extended version available here
[OOPSLA’10] Concurrent Programming with Revisions and Isolation Types
[OSDI’10] Effective Data-Race Detection for the Kernel
[PLDI’10] Line-Up: A Complete and Automatic Linearizability Checker
[CC’10] Verifying Local Transformations of Concurrent Programs
[ASPLOS’10] A Randomized Scheduler with Probabilistic Guarantees of Finding Bugs
[POPL’10] On the Verification Problem for Weak Memory Models
[OOPSLA’09] The Design of a Task-Parallel Library
[HotPar’09] Lightweight Software Transactions for Games
[CAV’08] Effective Program Verification for Relaxed Memory Models
[PLDI’07] CheckFence: Checking Consistency of Concurrent Data Types on Relaxed Memory Models