Concept

Runtime library

Related publications (13)

Graph Chatbot

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.

Latency Interfaces for Systems Code

Rishabh Ramesh Iyer

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

EPFL2023

A non-twisting flux tube for local gyrokinetic simulations

Stephan Brunner, Justin Richard Ball

Local gyrokinetic simulations use a field-aligned domain that twists due to the magnetic shear of the background magnetic equilibrium. However, if the magnetic shear is strong and/or the domain is long, the twist can become so extreme that it fails to prop ...

2021

Object-Oriented Recovery for Non-volatile Memory

James Richard Larus, David Teksen Aksun, Nachshon Cohen

New non-volatile memory (NVM) technologies enable direct, durable storage of data in an application's heap. Durable, randomly accessible memory facilitates the construction of applications that do not lose data at system shutdown or power failure. Existing ...

ACM2018

SAT Based Exact Synthesis using DAG Topology Families

Giovanni De Micheli, Mathias Soeken, Winston Jason Haaswijk

SAT based exact synthesis is a powerful technique, with applications in logic optimization, technology mapping, and synthesis for emerging technologies. However, its runtime behavior can be unpredictable and slow. In this paper, we propose to add a new typ ...

IEEE2018

High System-Code Security with Low Overhead

George Candea, Johannes Kinder, Volodymyr Kuznetsov, Jonas Benedict Wagner

Security vulnerabilities plague modern systems because writing secure systems code is hard. Promising approaches can retrofit security automatically via runtime checks that implement the desired security policy; these checks guard critical operations, like ...

2015

ScalaDyno: Making Name Resolution and Type Checking Fault-tolerant

Martin Odersky, Vlad Ureche, Cédric Bastin

The ScalaDyno compiler plugin allows fast prototyping with the Scala programming language, in a way that combines the benefits of both statically and dynamically typed languages. Static name resolution and type checking prevent partially-correct code from ...

ACM2014

An Embedded Query Language in Scala

Amir Shaikhha

In this thesis we address the problem of integrating general purpose programming languages with relational databases. An approach to solving this problem is using raw strings to represent SQL statements. This approach leads to runtime errors and security v ...

2013

Runtime Instrumentation for Precise Flow-Sensitive Type Analysis

Viktor Kuncak, Etienne Kneuss, Philippe Paul Henri Suter

We describe a combination of runtime information and static analysis for checking properties of complex and configurable systems. The basic idea of our approach is to 1) let the program execute and thereby read the important dynamic configuration data, the ...

Springer2010

Runtime Instrumentation for Precise Flow-Sensitive Type Analysis

Viktor Kuncak, Etienne Kneuss, Philippe Paul Henri Suter

2010

Runtime Checking for Separation Logic

Viktor Kuncak

Separation logic is a popular approach for specifying properties of recursive mutable data structures. Several existing systems verify a subclass of separation logic specifications using static analysis techniques. Checking data structure specifications du ...

Springer2008