TLA+ model checking made symbolic

November 29, 2019May 25, 2020 ~ Adrian Colyer ~ 10 Comments

TLA+ model checking made symbolic Konnov et al., OOPSLA'19 TLA+ is a formal specification language (Temporal Logic of Actions) particularly well suited to reasoning about distributed algorithms. In addition to the specification language, the TLA+ toolset includes a model checker (TLC) and a theorem prover (TLAPS). Given the huge state spaces involved in many real-world ... Continue Reading

Mergeable replicated data types – Part II

November 27, 2019May 25, 2020 ~ Adrian Colyer ~ Leave a comment

Mergeable replicated data types - part II Kaki et al., OOPLSA '19 Last time out we saw how Mergeable Replicated Data Types (MRDTs) use a bijection between the natural domain of a data type and relational sets to define merge semantics between two concurrently modified versions given their lowest common ancestor (LCA). Today we’re picking ... Continue Reading

Mergeable replicated data types – Part I

November 25, 2019May 25, 2020 ~ Adrian Colyer ~ 16 Comments

Mergeable replicated data types Kaki et al., OOPSLA'19 This paper was published at OOPSLA, but perhaps it’s amongst the distributed systems community that I expect there to be the greatest interest. Mergeable Replicated Data Types (MRDTs) are in the same spirit as CRDTs but with the very interesting property that they compose. Furthermore, a principled ... Continue Reading

PlanAlyzer: assessing threats to the validity of online experiments

November 22, 2019May 25, 2020 ~ Adrian Colyer ~ 1 Comment

PlanAlyzer: assessing threats to the validity of online experiments Tosch et al., OOPSLA'19 It’s easy to make experimental design mistakes that invalidate your online controlled experiments. At an organisation like Facebook (who kindly supplied the corpus of experiments used in this study), the state of art is to have a pool of experts carefully review ... Continue Reading

Local-first software: you own your data, in spite of the cloud

November 20, 2019May 25, 2020 ~ Adrian Colyer ~ 32 Comments

Local-first software: you own your data, in spite of the cloud Kleppmann et al., Onward! '19 Watch out! If you start reading this paper you could be lost for hours following all the interesting links and ideas, and end up even more dissatisfied than you already are with the state of software today. You might ... Continue Reading

Formal foundations of serverless computing

November 18, 2019May 25, 2020 ~ Adrian Colyer ~ 2 Comments

Formal foundations of serverless computing Jangda et al., OOPSLA'19 Jangda et al. won a distinguished paper award at OOPSLA this year for their work on ‘Formal foundations of serverless computing.’ Central to the paper is their observation that the serverless execution environment has a number of unique properties (such as warm starting / reuse of ... Continue Reading

Taiji: managing global user traffic for large-scale Internet services at the edge

November 15, 2019May 25, 2020 ~ Adrian Colyer ~ 1 Comment

Taiji: managing global user traffic for large-scale internet services at the edge Xu et al., SOSP'19 It’s another networking paper to close out the week (and our coverage of SOSP’19), but whereas Snap looked at traffic routing within the datacenter, Taiji is concerned with routing traffic from the edge to a datacenter. It’s been in ... Continue Reading

Scaling symbolic evaluation for automated verification of systems code with Serval

November 13, 2019May 25, 2020 ~ Adrian Colyer ~ 2 Comments

Scaling symbolic evaluation for automated verification of systems code with Serval Nelson et al., SOSP'19 Serval is a framework for developing automated verifiers of systems software. It makes an interesting juxtaposition to the approach Google took with Snap that we looked at last time out. I’m sure that Google engineers do indeed take extreme care ... Continue Reading

Snap: a microkernel approach to host networking

November 11, 2019May 25, 2020 ~ Adrian Colyer ~ 7 Comments

Snap: a microkernel approach to host networking Marty et al., SOSP'19 This paper describes the networking stack, Snap, that has been running in production at Google for the last three years+. It’s been clear for a while that software designed explicitly for the data center environment will increasingly want/need to make different design trade-offs to ... Continue Reading

The inflection point hypothesis: a principled approach to finding the root cause of a failure

November 8, 2019May 25, 2020 ~ Adrian Colyer ~ 1 Comment

The inflection point hypothesis: a principled debugging approach for locating the root cause of a failure Zhang et al., SOSP'19 It’s been a while since we looked a debugging and troubleshooting on The Morning Paper (here’s a sample of earlier posts on the topic). Today’s paper introduces a root cause of failure detector for those ... Continue Reading

the morning paper

a random walk through Computer Science research, by Adrian Colyer
Made delightfully fast by strattic

Month: November 2019