Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Modula-3

Publications associées (18)

Type-Level Programming with Match Types

Martin Odersky, Olivier Eric Paul Blanvillain

Type-level programming is becoming more and more popular in the realm of functional programming. However, the combination of type-level programming and subtyping remains largely unexplored in practical programming languages. This paper presents match types ...

ASSOC COMPUTING MACHINERY2022

Abstractions for Type-Level Programming

Olivier Eric Paul Blanvillain

Over the past decade, the Scala community has shown great interest in using type-level programming to obtain additional type safety. Unfortunately, the lack of support from the Scala compiler has been a barrier to the adoption of that technique, notably du ...

EPFL2022

The effects of the tip clearance on the performance of small-scale turbopumps for ORC applications; analysis and modeling

Jürg Alexander Schiffmann, Sajjad Zakeralhoseini

In this paper, the influence of tip clearance on the performance of small-scale turbopumps is studied numerically on extensive parameter ranges suitable for organic Rankine cycle applications. A novel and fully parameterized design model is developed and u ...

Technical University of Munich2021

Enclosure: Language-Based Restriction of Untrusted Libraries

Mathias Josef Payer, James Richard Larus, Edouard Bugnion, Evangelos Marios Kogias, Adrien Ghosn

Programming languages and systems have failed to address the security implications of the increasingly frequent use of public libraries to construct modern software. Most languages provide tools and online repositories to publish, import, and use libraries ...

ACM2021

Preventing Use-After-Free Attacks with Fast Forward Allocation

Sanidhya Kashyap

Memory-unsafe languages are widely used to implement critical systems like kernels and browsers, leading to thousands of memory safety issues every year. A use-after-free bug is a temporal memory error where the program accidentally visits a freed memory l ...

USENIX ASSOC2021

Safe Initialization of Objects

Martin Odersky, Fengyun Liu, Paolo Giosuè Giarrusso, Angelos Bimpoudis

Every newly created object goes through several initialization states: starting from a state where all fields are uninitialized until all of them are assigned. Any operation on the object during its initialization process, which usually happens in the cons ...

2020

A Type-and-Effect System for Object Initialization

Martin Odersky, Fengyun Liu, Paolo Giosuè Giarrusso, Angelos Bimpoudis

ASSOC COMPUTING MACHINERY2020

HALucinator: Firmware Re-hosting Through Abstraction Layer Emulation

Mathias Josef Payer

Given the increasing ubiquity of online embedded devices, analyzing their firmware is important to security, privacy, and safety. The tight coupling between hardware and firmware and the diversity found in embedded systems makes it hard to perform dynamic ...

USENIX ASSOC2020

Analysis of Functional Errors Produced by Long-Term Workload-Dependent BTI Degradation in Ultra-Low Power Processors

David Atienza Alonso, Alexandre Sébastien Julien Levisse, Miguel Peon Quiros, Ruben Braojos Lopez, Loris Gérard Duch

Aging effects in digital circuits change the switching characteristics of their transistors, resulting in timing violations that can lead to functional errors at the system level. In particular, BTI is a degradation effect that changes the threshold voltag ...

2020

Scalable Synchronization in Shared-Memory Systems: Extrapolating, Adapting, Tuning

Georgios Chatzopoulos

As hardware evolves, so do the needs of applications. To increase the performance of an application, there exist two well-known approaches. These are scaling up an application, using a larger multi-core platform, or scaling out, by distributing work to mul ...

EPFL2018

Simplicitly: Foundations and Applications of Implicit Function Types

Martin Odersky, Heather Christine Klug, Sandro Stucki, Fengyun Liu, Olivier Eric Paul Blanvillain

Understanding a program entails understanding its context; dependencies, configurations and even implementations are all forms of contexts. Modern programming languages and theorem provers offer an array of constructs to define contexts, implicitly. Scala ...

2017

Locking Made Easy

Rachid Guerraoui, Vasileios Trigonakis, Georgios Chatzopoulos

A priori, locking seems easy: To protect shared data from concurrent accesses, it is sufficient to lock before accessing the data and unlock after. Nevertheless, making locking efficient requires fine-tuning (a) the granularity of locks and (b) the locking ...

ACM Press2016

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

Brief Announcement: Transaction Polymorphism

Rachid Guerraoui, Vincent Gramoli

In this work, we present transaction polymorphism; a synchronization technique that provides more control to the programmer than traditional (i.e., monomorphic) transactions to achieve comparable performance to generic lock-based and lock-free solutions. ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

Type Classes as Objects and Implicits

Martin Odersky

Type classes were originally developed in Haskell as a disciplined alternative to ad-hoc polymorphism. Type classes have been shown to provide a type-safe solution to important challenges in software engineering and programming languages such as, for examp ...

ACM2010

Isolated Actors for Race-Free Concurrent Programming

Philipp Haller

Message-based concurrency using actors has the potential to scale from multicore processors to distributed systems. However, several challenges remain until actor-based programming can be applied on a large scale. First, actor implementations must be effic ...

EPFL2010

Opis: Reliable Distributed Systems in OCaml

Viktor Kuncak, Dejan Kostic

Concurrency and distribution pose algorithmic and implementation challenges in developing reliable distributed systems, making the field an excellent testbed for evaluating programming language and verification paradigms. Several specialized domain-specifi ...

2009

Opis: Reliable Distributed Systems in OCaml

Viktor Kuncak, Dejan Kostic

2009