|
| 1 | +--- |
| 2 | +title: "Call for Papers, 13th Workshop on Principles and Practice of Consistency for Distributed Data (PaPoC 2026)" |
| 3 | +timestamp: "12/17/2025 12:35:18" |
| 4 | +deadline: "1/23/2026" |
| 5 | +--- |
| 6 | +====================================================================== |
| 7 | +PaPoC 2026 |
| 8 | +13th Ws on Principles and Practice of Consistency for Distributed Data |
| 9 | +Monday, April 27th, 2026 - Organized in conjunction with EuroSys 2026 |
| 10 | +https://papoc-workshop.github.io/2026/ |
| 11 | +====================================================================== |
| 12 | + |
| 13 | +# Call for Papers |
| 14 | + |
| 15 | +Consistency is one of the fundamental issues of distributed computing. |
| 16 | +Beyond the well-known tension between Consistency, Availability, and |
| 17 | +Partition-tolerance, as captured by the CAP theorem, many nuanced |
| 18 | +consistency models and algorithms have been developed for different |
| 19 | +purposes. These consistency models have subtly different behaviour in |
| 20 | +practice, which translates to difficult choices between fault |
| 21 | +tolerance, performance, and programmability. The issues and |
| 22 | +trade-offs are particularly vexing at scale, with a large number of |
| 23 | +processes or large shared databases, and in the presence of high |
| 24 | +latency and failure-prone networks, such as edge computing and |
| 25 | +peer-to-peer networks. |
| 26 | + |
| 27 | +Since its inception in 2014, the PaPoC workshop series has brought |
| 28 | +together researchers and practitioners who seek to develop better |
| 29 | +techniques and a better understanding of consistency in distributed |
| 30 | +systems. We welcome contributions from a wide range of backgrounds: |
| 31 | +system development, distributed algorithms, concurrency, fault |
| 32 | +tolerance, databases, programming languages, blockchain, and |
| 33 | +verification. While there is no one universally best solution, we |
| 34 | +believe that by bringing together these perspectives, we can develop |
| 35 | +techniques that provide useful guarantees to applications, that are |
| 36 | +usable by application developers, and that satisfy real-world |
| 37 | +scalability, performance, and reliability requirements. |
| 38 | + |
| 39 | +The workshop is looking for contributions on the following, and |
| 40 | +associated, topics: |
| 41 | + |
| 42 | +* Techniques for scaling and improving the performance of strongly |
| 43 | + consistent systems (e.g., Paxos-like algorithms, state-machine |
| 44 | + replication protocols and distributed transactional systems). |
| 45 | + |
| 46 | +* Techniques for weak and hybrid consistency (such as session |
| 47 | + guarantees, causal consistency, operational transformation, |
| 48 | + conflict-free replicated data types (CRDTs), invariant-preserving |
| 49 | + replicated data types, monotonic programming, state merging, |
| 50 | + operation commutativity, etc). |
| 51 | + |
| 52 | +* Data consistency in geo-replicated, peer-to-peer, and edge computing |
| 53 | + systems. |
| 54 | + |
| 55 | +* How to expose consistency vs. performance and scalability trade-offs |
| 56 | + in the programming model, and how to help developers choose. |
| 57 | + |
| 58 | +* How to support composed operations spanning multiple objects |
| 59 | + (transactions, sagas, workflows). |
| 60 | + |
| 61 | +* Techniques or tools to aid the development of replicated data (e.g., |
| 62 | + reasoning, analysis and verification of application programs using |
| 63 | + storage systems with various consistency models, visualization |
| 64 | + techniques for distributed dependencies or state merges, etc.). |
| 65 | + |
| 66 | +* Formal methods for distributed systems dealing with strong/weak |
| 67 | + consistent data (such as techniques for verifying safety, liveness |
| 68 | + or consistency properties, convergence verification, etc.) |
| 69 | + |
| 70 | +* Implementation techniques and optimisations for replicated data |
| 71 | + types to improve fault tolerance, security, application-level |
| 72 | + invariants, metadata usage, and controlling divergence. |
| 73 | + |
| 74 | +* Studies of performance, scalability, and programmability for the |
| 75 | + aforementioned systems. |
| 76 | + |
| 77 | + |
| 78 | +## Details on submissions |
| 79 | + |
| 80 | +The PaPoC workshop invites three types of submissions: |
| 81 | + |
| 82 | +* Short papers (up to 6 pages excluding bibliography) with original |
| 83 | + contributions, experience reports, or work-in-progress reports |
| 84 | + (supported by initial validations); |
| 85 | + |
| 86 | +* Full papers (up to 12 pages excluding bibliography) which may be |
| 87 | + concurrently submitted (or accepted) to other venues and do not have |
| 88 | + the option to be published in the ACM Digital Library; |
| 89 | + |
| 90 | +* Lightning-talk abstracts, summarized in a maximum of 300 words, |
| 91 | + reporting preliminary ideas, new trends, recent experience, or |
| 92 | + ongoing results. |
| 93 | + |
| 94 | +Submissions do not need to be (but are allowed to be) anonymised. |
| 95 | + |
| 96 | +Papers and abstracts will be distributed to the participants of the |
| 97 | +workshop. Authors of accepted **short papers** will have the |
| 98 | +opportunity to choose whether they want their papers published in ACM |
| 99 | +Digital Library (along with papers from other EuroSys workshops). |
| 100 | +Lightning talk abstracts and full papers will not be included in the |
| 101 | +ACM Digital Library. |
| 102 | + |
| 103 | +At least one author of each accepted submission is expected to present |
| 104 | +their work at the workshop and to be available for discussions. |
| 105 | + |
| 106 | +## How to submit your work |
| 107 | + |
| 108 | +Submissions should be made via HotCRP at: https://papoc26.hotcrp.com |
| 109 | + |
| 110 | +All submissions should be written in English and provided in PDF |
| 111 | +format. We suggest that you use the ACM template for LaTeX or MS |
| 112 | +Word, but this is not required. |
| 113 | + |
| 114 | +If using the LaTeX template, use the `acmart` document class with the |
| 115 | +`sigplan` and `twocolumn` options. To anonymize your submission, just |
| 116 | +pass the `anonymous` option to `acmart.cls`. Finally, the `review` |
| 117 | +option will add line numbers, which will make it easier for reviewers |
| 118 | +to refer to specific parts of the paper. |
| 119 | + |
| 120 | +For example, for an anonymized submission, one could use the following |
| 121 | +LaTeX commands: |
| 122 | + |
| 123 | +``` |
| 124 | +\documentclass[sigplan,twocolumn,review,anonymous]{acmart} |
| 125 | +\renewcommand\footnotetextcopyrightpermission[1]{} |
| 126 | +\settopmatter{printfolios=true,printacmref=false} |
| 127 | +``` |
| 128 | + |
| 129 | +In case of any questions, please contact the Program Chairs. |
| 130 | + |
| 131 | +## Important Dates |
| 132 | + |
| 133 | +- Submission deadline: Friday, January 23, 2026 |
| 134 | +- Notification date: Friday, February 27, 2026 |
| 135 | +- Camera-Ready deadline: Friday, March 6, 2026 |
| 136 | +- Workshop: Monday, April 27, 2026 |
| 137 | + |
| 138 | +All deadline times are 23:59 hrs. |
0 commit comments