Degrees of Separation: A Flexible Type System for Safe Concurrency

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

This book outlines a methodology to develop formally verified Just-in-Time compilers. Just-in-Time compilation is a technique to execute programs, where execution is interleaved with optimizations of the program itself. These compilers often produce fast e ...

Context: The use of evidence in policymaking can take various forms, and resorting to quantitative indicators is one of them. In the past 30 years, a plethora of indicator-based initiatives for assessing and monitoring progress towards sustainability have ...

Type systems are a device for verifying properties of programs without running them. Many programming languages used in the industry have always had a type system, while others were initially created without a type system and later adopted one, when the ad ...

Formally verifying the correctness of software is necessary to merit the trust people put in software systems. Currently, formal verification requires human effort to prove that a piece of code matches its specification and code changes to improve verifiab ...

Type inference in the presence of first-class or "impredicative" second-order polymorphism a la System F has been an active research area for several decades, with original works dating back to the end of the 80s. Yet, until now many basic problems remain ...

A spinal cord injury (SCI) triggers a cascade of molecular and cellular responses involving inflammatory cell infiltration and cytokine release, apoptosis, demyelination, excitotoxicity, ischemia, and the formation of a fibrotic scar surrounded by an astro ...

We introduce the SPRIG (Smart Proofs via Recursive Information Gathering) protocol. SPRIG allows agents to propose, question, and defend mathematical proofs in a decentralized fashion. A structure of stakes and bounties aims at producing debates in good fa ...

Type systems usually characterize the shape of values but not their free variables. However, many desirable safety properties could be guaranteed if one knew the free variables captured by values. We describe CC

The Dependent Object Type (DOT) calculus was designed to put Scala on a sound basis, but while DOT relies on structural subtyping, Scala is a fundamentally class-based language. This impedance mismatch means that a proof of DOT soundness by itself is ...

Historically speaking, the notion of the type was reintroduced to the larger architectural discourse as a direct consequence of the crisis of the Modern. The task of revisiting the forms of the past also dictated the return of architectural methods that ha ...

Today's continued increase in demand for processing power, despite the slowdown of Moore's law, has led to an increase in processor count, which has resulted in energy consumption and distribution problems. To address this, there is a growing trend toward ...

Many programming languages in the OO tradition now support pattern matching in some form. Historical examples include Scala and Ceylon, with the more recent additions of Java, Kotlin, TypeScript, and Flow. But pattern matching on generic class hierarchies ...

Formal verification of real-world software systems remains challenging for a number of reasons, including lack of automation, friction in specifying properties, and limited support for the diverse programming paradigms used in industry. In this thesis we m ...

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 ...

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 ...

It is generally assumed that the parent-twin interface is a fully invariant plane. The calculations of the rational interfaces of the type I twins and irrational interfaces of the type II twins are based on this hypothesis. Recently, some asymmetric facets ...

The hardware complexity of modern machines makes the design of adequate programming models crucial for jointly ensuring performance, portability, and productivity in high-performance computing (HPC). Sequential task-based programming models paired with adv ...

Formally verifying the correctness of software network functions (NFs) is necessary for network reliability, yet existing techniques require full source code and mandate the use of specific data structures. We describe an automated technique to verify NF b ...

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 ...

Programming has changed; programming languages have not. Modern software embraced reusable software components, i.e., public libraries, and runs in the cloud, on machines that co-locate applications from various origins. This new programming paradigm leads ...

Degrees of Separation: A Flexible Type System for Safe Concurrency

Chat with Graph Search

Formal Verification of Just-in-Time Compilation

Application and use of sustainability indicators by local governments, and their determinants: a Swiss case study

Formal Foundations of Capture Tracking

Automated Formal Verification of Software Network Functions

When Subtyping Constraints Liberate A Novel Type Inference Approach for First-Class Polymorphism

Multimodal transcriptomic atlases of mouse spinal cord injury

Smart Proofs via Recursive Information Gathering: Decentralized Refereeing by Smart Contracts

Capturing Types

Type-Preserving Compilation of Class-Based Languages

Between the Pattern and the Type: A short parallel story

Compilation and Design Space Exploration of Dataflow Programs for Heterogeneous CPU-GPU Platforms

A case for DOT: Theoretical Foundations for Objects with Pattern Matching and GADT-Style Reasoning

Scaling Language Features for Program Verification

Type-Level Programming with Match Types

Abstractions for Type-Level Programming

The concept of axial weak twins

Decentralized in-order execution of a sequential task-based code for shared-memory architectures

Automated Verification of Network Function Binaries

Enclosure: Language-Based Restriction of Untrusted Libraries

Trust as a Programming Primitive