Home

Topics in programming language theory

Formal sciences
Theoretical computer science
Programming language theory
Topics in programming langu...

About
Privacy
Disclaimer

Graph Chatbot

Related publications (27)

Fast and Robust Memory Reclamation for Concurrent Data Structures

Rachid Guerraoui, Oana Maria Balmau, Mihail Igor Zablotchi

In concurrent systems without automatic garbage collection, it is challenging to determine when it is safe to reclaim memory, especially for lock-free data structures. Existing concurrent memory reclamation schemes are either fast but do not tolerate proce ...

2016

StreamFlow 1.0: an extension to the spatially distributed snow model Alpine3D for hydrological modelling and deterministic stream temperature prediction

Tristan Jonas Brauchli, Michael Lehning, Wolf Hendrik Huwald, Aurélien Gallice, Francesco Comola, Mathias Thierry Pierre Bavay

Climate change is expected to strongly impact the hydrological and thermal regimes of Alpine rivers within the coming decades. In this context, the development of hydrological models accounting for the specific dynamics of Alpine catchments appears as one ...

Copernicus Gesellschaft Mbh2016

SMT-Based Checking of Predicate-Qualified Types for Scala

Viktor Kuncak, Georg Stefan Schmid

We present qualified types for Scala, a form of refinement types adapted to the Scala language. Qualified types allow users to refine base types and classes using predicate expressions. We implemented a type checker for qualified types that is embedded in ...

Assoc Computing Machinery2016

Improving systems software security through program analysis and instrumentation

Volodymyr Kuznetsov

Security and reliability bugs are prevalent in systems software. Systems code is often written in low-level languages like C/C++, which offer many benefits but also delegate memory management and type safety to programmers. This invites bugs that cause cra ...

EPFL2016

Asynchronous memory access chaining

Babak Falsafi, Yusuf Onur Koçberber, Boris Robert Grot

In-memory databases rely on pointer-intensive data structures to quickly locate data in memory. A single lookup operation in such data structures often exhibits long-latency memory stalls due to dependent pointer dereferences. Hiding the memory latency by ...

2015

Foundations of Path-Dependent Types

Martin Odersky, Nada Amin, Tiark Rompf

A scalable programming language is one in which the same concepts can describe small as well as large parts. Towards this goal, Scala unifies concepts from object and module systems. An essential ingredient of this unification is the concept of objects wit ...

Assoc Computing Machinery2014

Self-Assembly: Lightweight Language Extension and Datatype Generic Programming, All-in-One!

Philipp Haller, Heather Christine Klug

In this paper we show a general mechanism, called self-assembly, for lightweight language extensions (LLEs). LLEs allow users to define generic operations or properties that operate over a large class of types. With LLEs it is possible, for example, for us ...

2014

Page 2 of 2