Bookmarks (112)

  • screenshot

    Firecracker: lightweight virtualization for serverless applications

    Firecracker: lightweight virtualisation for serverless applications, Agache et al., NSDI’20 Finally the NSDI’20 papers have opened...

  • screenshot

    STELLA: report from the SNAFU-catchers workshop on coping with complexity

    STELLA: report from the SNAFU-catchers workshop on coping with complexity, Woods 2017, Coping with Complexity workshop...

  • screenshot

    Synthesizing data structure transformations from input-output examples

    Synthesizing data structure transformations from input-output examples, Feser et al., PLDI’15 The Programmatically Interpretable Reinforcement Learning...

  • screenshot

    Programmatically interpretable reinforcement learning

    Programmatically interpretable reinforcement learning, Verma et al., ICML 2018 Being able to trust (interpret, verify) a...

  • screenshot

    Challenges of real-world reinforcement learning

    Challenges of real-world reinforcement learning, Dulac-Arnold et al., ICML’19 Last week we looked at some of...

  • screenshot

    Ten challenges for making automation a ‘team player’ in joint human-agent activity

    Ten challenges for making automation a ‘team player’ in joint human-agent activity, Klein et al., IEEE...

  • screenshot

    Ironies of automation

    Ironies of automation, Bainbridge, Automatica, Vol. 19, No. 6, 1983 With thanks to Thomas Depierre for...

  • screenshot

    The Year Ahead

    Welcome to another year of The Morning Paper! Over the holidays I spent some time mapping...

  • screenshot

    Benchmarking spreadsheet systems

    Benchmarking spreadsheet systems Rahman et al., Preprint A recent TwThread drew my attention to this pre-print...

  • screenshot

    Declarative assembly of web applications from pre-defined concepts

    Declarative assembly of web applications from predefined concepts De Rosso et al., Onward! 2019 I chose...

  • screenshot

    Efficient lock-free durable sets

    Efficient lock-free durable sets Zuriel et al., OOPSLA’19 Given non-volatile memory (NVRAM), the naive hope for...

  • screenshot

    TLA+ model checking made symbolic

    TLA+ model checking made symbolic Konnov et al., OOPSLA’19 TLA+ is a formal specification language (Temporal...

  • screenshot

    Mergeable replicated data types – Part II

    Mergeable replicated data types – part II Kaki et al., OOPLSA ’19 Last time out we...

  • screenshot

    Mergeable replicated data types – Part I

    Mergeable replicated data types Kaki et al., OOPSLA’19 This paper was published at OOPSLA, but perhaps...

  • screenshot

    PlanAlyzer: assessing threats to the validity of online experiments

    PlanAlyzer: assessing threats to the validity of online experiments Tosch et al., OOPSLA’19 It’s easy to...

  • screenshot

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

    Local-first software: you own your data, in spite of the cloud Kleppmann et al., Onward! ’19...

  • screenshot

    Formal foundations of serverless computing

    Formal foundations of serverless computing Jangda et al., OOPSLA’19 Jangda et al. won a distinguished paper...

  • screenshot

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

    Taiji: managing global user traffic for large-scale internet services at the edge Xu et al., SOSP’19...

  • screenshot

    Scaling symbolic evaluation for automated verification of systems code with Serval

    Scaling symbolic evaluation for automated verification of systems code with Serval Nelson et al., SOSP’19 Serval...

  • screenshot

    Snap: a microkernel approach to host networking

    Snap: a microkernel approach to host networking Marty et al., SOSP’19 This paper describes the networking...

  • screenshot

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

    The inflection point hypothesis: a principled debugging approach for locating the root cause of a failure...