PaPoC 2023 will take place on May 8th, 2023. It is an in-person only event, happening in conjunction with the EuroSys 2023 conference. The workshop will be located at the Auditorium Antonianum. To see how to reach the conference area, please follow this link.

Opening & Session 1: 09:00 to 10:30

• Welcome
  09:00, 5 min

• Keynote: Building Data Systems for Persistent Memory
  Vijay Chidambaram (University of Texas, Austin)
  09:05, 60 min

Abstract
Persistent memory provides storage that is low latency and high bandwidth. However, the same features that make persistent memory so appealing also make it challenging to build data systems that effectively utilize persistent memory. In this talk, I’ll talk about my group’s experiences building a variety of data systems for persistent memory, ranging from single-node key-value stores to file systems and disaggregated key-value stores. I’ll share common challenges and lessons learnt from these projects, and present some open challenges that need to be solved to fully utilize persistent memory in the future.

Bio
Vijay Chidambaram is an Associate Professor in the Computer Science department at the University of Texas at Austin. He did his post-doc at the VMware Research Group, and got his PhD with Prof. Remzi and Andrea Arpaci-Dusseau at the University of Wisconsin-Madison. His papers have won Best Paper Awards in ATC 2018, FAST 2018, and FAST 2017. He was awarded the NSF CAREER Award in 2018, SIGOPS Dennis M. Ritchie Dissertation Award in 2016, and the Microsoft Research Fellowship in 2014. Techniques from his work have been incorporated into commercial products, and his work has helped make the Linux kernel more reliable.

• Probabilistic Causal Contexts for Scalable CRDTs
  Pedro Henrique Fernandes (ProDEI, Universidade do Porto & INESC TEC), Carlos Baquero (Universidade do Porto & INESC TEC)
  10:05, 20 min, paper

Coffee Break: 10:30 to 11:00

Session 2: 11:00 to 13:00

• On Extend-Only Directed Posets and Derived Byzantine-Tolerant Replicated Data Types
  Florian Jacob (Karlsruhe Institute of Technology), Hannes Hartenstein (Karlsruhe Institute of Technology)
  11:00, 20 min, paper

• Trees and Turtles: Modular Abstractions for State Machine Replication Protocols
  Natalie Neamtu (Microsoft Corporation), Haobin Ni (Cornell University), Robbert van Renesse (Cornell University)
  11:20, 20 min, paper

• Verify, And Then Trust: Data Inconsistency Detection in ZooKeeper
  Sushant Mane (San José State University), Fangmin Lyu (Meta), Benjamin Reed (San José State University)
  11:40, 20 min, paper

• Generic Checkpointing Support for Stream-based State-Machine Replication
  Laura Lawniczak (Friedrich-Alexander-Universität Erlangen-Nürnberg), Marco Ammon (Friedrich-Alexander-Universität Erlangen-Nürnberg), Tobias Distler (Friedrich-Alexander-Universität Erlangen-Nürnberg)
  12:00, 20 min, paper

• Performance Trade-offs in Transactional Systems
  Rafael Soares (INESC-ID, Instituto Superior Técnico, Universidade de Lisboa), Luís Rodrigues (INESC-ID, Instituto Superior Técnico, Universidade de Lisboa)
  12:20, 20 min, paper

• Linearizable Low-latency Reads at the Edge
  Joshua Guarnieri (University of New Hampshire), Aleksey Charapko (University of New Hampshire)
  12:40, 20 min, paper

Lunch: 13:00 to 14:30

Session 3: 14:30 to 16:00

• A Study of Semantics for CRDT-based Collaborative Spreadsheets
  Elena Yanakieva (University of Kaiserslautern-Landau), Philipp Bird (University of Kaiserslautern-Landau), Annette Bieniusa (University of Kaiserslautern-Landau)
  14:30, 20 min, paper

• AMC: Towards Trustworthy and Explorable CRDT Applications with the Automerge Model Checker
  Andrew Jeffery (University of Cambridge), Richard Mortier (University of Cambridge)
  14:50, 20 min, paper

• Towards improved collaborative text editing CRDTs by using Natural Language Processing
  Jim Bauwens (Vrije Universiteit Brussel), Kevin De Porre (Vrije Universiteit Brussel), Elisa Gonzalez Boix (Vrije Universiteit Brussel)
  15:10, 20 min, paper

• TopoloTree: From O(n) to O(1) CRDT Memory Consumption Via Aggregation Tree Gossip Topologies
  Conor Power (University of California, Berkeley), Shadaj Laddad (University of California, Berkeley), Chris Douglas (University of California, Berkeley), Joseph M. Hellerstein (University of California, Berkeley), Dan Suciu (University of Washington)
  15:30, 20 min, paper

Coffee Break: 16:00 to 16:30

Session 4: 16:30 to 17:40

• For-Each Operations in Collaborative Apps
  Matthew Weidner (Carnegie Mellon University), Ria Pradeep (Carnegie Mellon University), Benito Geordie (Rice University), Heather Miller (Carnegie Mellon University)
  16:30, 20 min, paper

• Distributed Consensus Algorithms as Replicated State Applications
  Nicholas V. Lewchenko (University of Colorado, Boulder), Gowtham Kaki (University of Colorado Boulder)
  16:50, 20 min, paper

• Data Management for mobile applications dependent on geo-located data
  Nuno M. Santos (NOVA LINCS & NOVA School of Science and Technology), Luís M. Silva (NOVA LINCS & NOVA School of Science and Technology), João Leitão (NOVA LINCS & NOVA School of Science and Technology),Nuno Preguiça (NOVA LINCS & NOVA School of Science and Technology)
  17:10, 20 min, paper

• Test-of-Time Award Ceremony and Closing
  17:30, 30 min slides

The following paper is awarded the Test-of-Time Award for the tenth edition of the PaPoC workshop series: Bridging the Gap: Opportunities in Coordination-Avoiding Database Systems, by Peter Bailis, Alan Fekete, Ali Ghodsi, Mike Franklin, Joe Hellerstein, and Ion Stoica.