Static Type Checking for the Kompics Component Model -- Kola - The Kompics Language
Distributed systems are becoming an increasingly important part of systems and applications software and it is widely accepted that writing correct distributed systems is challenging. Message-passing concurrency models are the dominant programming paradigm and, even in statically typed languages, programming frameworks typically only have limited type checking support for messages, channels, and ports or mailboxes. In this paper, we present Kola, a language-level implementation of Kompics, a component model with message-passing concurrency. Kola comes with its own compiler and some special language constructs which extend Java’s type system as necessary to enforce static type check- ing on messages, channels, and ports. We show that Kola improves the readability of Kompics code and removes opportunities to introduce bugs, at the cost of little compile time overhead and no runtime overhead.
Paper Preprint (PMLDC16_Kola_Preprint.pdf) | 480KiB |
Slides (Kola.pdf) | 1.74MiB |
Sun 17 JulDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
10:00 - 12:30 | |||
10:00 30m | Implicitly Distributing Pervasively Concurrent Programs PMLDC John A. Thywissen The University of Texas at Austin, Arthur Michener Peters The University of Texas at Austin, Texas, USA, William Cook UT Austin Link to publication DOI | ||
10:30 30m | Static Type Checking for the Kompics Component Model -- Kola - The Kompics Language PMLDC Link to publication DOI File Attached | ||
11:00 30m | Towards Aggregate Programming in Scala PMLDC Link to publication DOI | ||
11:30 30m | Building Distributed Applications with Data and Time Frames PMLDC | ||
12:00 30m | Fractional Permissions for Race-Free Mutable References in a Dataflow Intermediate Language PMLDC |