Write a Blog >>
Tue 20 Jun 2017 16:00 - 16:20 at Vertex WS217 - D Chair(s): Radu Grigore

Consistency is a long-standing problem in distributed systems. Low consistency levels are considered a necessity for scalability. High consistency is required for critical tasks such as payment and identification. Modern (geo-)distributed systems rely on the data propagation mechanisms and consistency guarantees of the distributed data store they build upon, which makes the implementation of a system that mixes different levels of consistency complex and error prone. In this paper, we present preliminary work on ConSysT, a programming language that supports heterogeneous consistency specifications at the type level. In ConSysT, developers assign consistency levels directly to the data and type system ensures the correct behavior of the application even with computations that mix data at multiple consistency levels. Our vision is that the ConSysT runtime automatically determines the most efficient mechanism to achieve the desired level of consistency among those offered by the underlying data store.

Conference Day
Tue 20 Jun

Displayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

16:00 - 18:00
DFTfJP at Vertex WS217
Chair(s): Radu GrigoreUniversity of Kent
Consistency Types for Safe and Efficient Distributed Programming
Alessandro MargaraPolitecnico di Milano, Guido SalvaneschiTU Darmstadt
Correctness of Partial Escape Analysis for Multithreading Optimization
Dustin Rhodes, Cormac FlanaganUniversity of California, Santa Cruz, Stephen N. FreundWilliams College
Parametric trace expressions for runtime verification of Java-like programs
Davide AnconaUniversity of Genova, Angelo Ferrando, Luca FranceschiniDIBRIS, University of Genova, Italy, Viviana MascardiDIBRIS, University of Genova, Italy