ScalaDyno: Making Name Resolution and Type Checking Fault-tolerant

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

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

Data races have long been a notorious problem in concurrent programming. They are subtle to detect, and lead to non-deterministic behaviours. There has been a lot of interest in type systems that statically guarantee data race freedom. Significant progress ...

Performance-critical industrial applications, including large-scale program, network, and distributed system analyses, are increasingly reliant on recursive queries for data analysis. Yet traditional relational algebra-based query optimization techniques d ...

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

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

This paper introduces a beam-adjustable multibeam dielectric rod antenna for mm-wave RF-WPT applications. The unique multibeam setup allows the generation of several adjustable beams simultaneously. This is conceptualized by utilizing three and five rods t ...

Mutation-based fuzzing effectively discovers defects in JS engines. High-quality mutations are key for the performance of mutation-based fuzzers. The choice of the underlying representation (e.g., a sequence of tokens, an abstract syntax tree, or an interm ...

Advances in computational capabilities and large volumes of experimental data have established computer simulations of brain tissue models as an important pillar in modern neuroscience. Alongside, a variety of domain specific languages (DSLs) have been dev ...

Compilers assure that any produced optimized code is semantically equivalent to the original code. However, even "correct" compilers may introduce security bugs as security properties go beyond translation correctness. Security bugs introduced by such corr ...

This Replicating Computational Report (RCR) describes (a) our datAFLow fuzzer and (b) how to replicate the results in "datAFLow: Toward a Data-Flow-Guided Fuzzer." Our primary artifact is the datAFLow fuzzer. Unlike traditional coverage-guided greybox fuzz ...

While software applications, programming languages, and hardware have changed, operating systems have not. Widely-used commodity operating systems are still modeled after the ones designed in the seventies. The accumulated burden of backward compatibility ...

Agent-based simulations have been widely applied in many disciplines, by scientists and engineers alike. Scientists use agent-based simulations to tackle global problems, including alleviating poverty, reducing violence, and predicting the impact of pandem ...

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

A metaprogrammer should be able to reason about the semantics of the generated code. Multi-stage programming introduced an elegant and powerful solution to this problem. It follows a semantically driven approach to code generation, where semantics are full ...

This thesis demonstrates that it is feasible for systems code to expose a latency interface that describes its latency and related side effects for all inputs, just like the code's semantic interface describes its functionality and related side effects. S ...

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

Fuzzing reliably and efficiently finds bugs in software, including operating system kernels. In general, higher code coverage leads to the discovery of more bugs. This is why most existing kernel fuzzers adopt strategies to generate a series of inputs that ...

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

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

ScalaDyno: Making Name Resolution and Type Checking Fault-tolerant

Chat with Graph Search

Formal Verification of Just-in-Time Compilation

Automated Formal Verification of Software Network Functions

Degrees of Separation: A Flexible Type System for Safe Concurrency

Adaptive Recursive Query Optimization

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

Formal Foundations of Capture Tracking

Plug-in Plug-Out Multibeam Dielectric Rod Antenna for Target Dedicated mm-Wave RF-WPT Applications

Fuzzing JavaScript Engines with a Graph-based IR

MOD2IR: High-Performance Code Generation for a Biophysically Detailed Neuronal Simulation DSL

Silent Bugs Matter: A Study of Compiler-Introduced Security Bugs

DatAFLow: Toward a Data-flow-guided Fuzzer

Dynamic Linkers Are the Narrow Waist of Operating Systems

Generalizing Bulk-Synchronous Parallel Processing for Data Science: From Data to Threads and Agent-Based Simulations

Type-Preserving Compilation of Class-Based Languages

Scalable Metaprogramming in Scala 3

Latency Interfaces for Systems Code

Between the Pattern and the Type: A short parallel story

ACTOR: Action-Guided Kernel Fuzzing

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

Abstractions for Type-Level Programming