ECOOP 2018
Sun 15 - Sat 21 July 2018 Amsterdam, Netherlands
co-located with ECOOP and ISSTA
Thu 19 Jul 2018 16:50 - 17:15 at Zurich II - Languages Chair(s): Yu David Liu

There is an increasing interest in alternative memory management schemes that seek to the combine the convenience of garbage collection and the performance of manual memory management in a single language framework. Unfortunately, ensuring safety in presence of manual memory management remains as great a challenge as ever. In this paper, we present a C#-like object-oriented language called Broom that uses a combination of region type system and lightweight runtime checks to enforce safety in presence of user-managed memory regions called transferable regions. Unsafe transferable regions have been previously used to contain the latency due to unbounded GC pauses. Our approach shows that it is possible to restore safety without compromising on the benefits of transferable regions. We prove the type safety of Broom in a formal framework that includes its C#-inspired features, such as higher-order functions and generics. We complement our type system with a type inference algorithm, which eliminates the need for programmers to write region annotations on types. The inference algorithm has been proven sound and relatively complete. We describe a prototype implementation of the inference algorithm, and our experience of using it to enforce memory safety in dataflow programs.

Thu 19 Jul

ecoop-2018-papers
16:00 - 17:15: ECOOP Research Papers - Languages at Zurich II
Chair(s): Yu David LiuState University of New York, Binghamton
ecoop-2018-papers16:00 - 16:25
Research paper
Xuan BiThe University of Hong Kong, Bruno C. d. S. OliveiraUniversity of Hong Kong, China
DOI
ecoop-2018-papers16:25 - 16:50
Research paper
Stefan KrügerUniversity of Paderborn, Johannes SpäthFraunhofer IEM, Karim AliUniversity of Alberta, Eric BoddenHeinz Nixdorf Institut, Paderborn University and Fraunhofer IEM, Mira MeziniTU Darmstadt
DOI
ecoop-2018-papers16:50 - 17:15
Research paper
Gowtham KakiPurdue University, G. RamalingamMicrosoft Research
DOI