Concept

Continuation (informatique)

Publications associées (22)

Determining an optimum quantity of interleaved instruction streams of defined coroutines

Anastasia Ailamaki, Georgios Psaropoulos

A method for optimizing memory access for database operations is provided. The method may include performing a first database operation by at least executing a first instruction stream associated with the first database operation. The first database opera ...

2023

Continuation Methods For Riemannian Optimization

Daniel Kressner, Axel Elie Joseph Séguin

Numerical continuation in the context of optimization can be used to mitigate convergence issues due to a poor initial guess. In this work, we extend this idea to Riemannian optimization problems, that is, the minimization of a target function on a Riemann ...

SIAM PUBLICATIONS2022

Measurement of Xi(++)(cc) production in pp collisions at root s=13 TeV

Lesya Shchutska, Olivier Schneider, Aurelio Bay, Yiming Li, Guido Haefeli, Frédéric Blanc, Christoph Frei, Tatsuya Nakada, Michel De Cian, Luca Pescatore, Elena Graverini, Veronica Sølund Kirsebom, François Fleuret, Matthieu Philippe Luther Marinangeli, Minh Tâm Tran, Pietro Marino, Renato Quagliani, Federico Leo Redi, Federico Betti, Plamen Hristov Hopchev, Maxime Schubiger, Aravindhan Venkateswaran, Violaine Bellée, Luis Miguel Garcia Martin, Maria Vieites Diaz, Vitalii Lisovskyi, Olivier Göran Girard, Preema Rennee Pais, Elisabeth Maria Niel, Pavol Stefko, Jian Wang, Tara Nanut, Mingkui Wang, Maria Elena Stramaglia, Zhirui Xu, Vladimir Macko, Guillaume Max Pietrzyk, Yi Zhang, Lei Zhang, Sebastian Schulte, Surapat Ek-In, Ho Ling Li, Carina Trippl, Mark Tobin, Sara Celani, Serhii Cholak, Niko Neufeld, Ana Bárbara Rodrigues Cavalcante, Matthew Needham, Marc-Olivier Bettler, Maurizio Martinelli, Vladislav Balagura, Donal Patrick Hill, Liang Sun, Mirco Dorigo, Xiaoxue Han, Liupan An, Thibaud Humair, Hang Yin, Guido Andreassi, Yao Zhou, Tommaso Colombo, Evgenii Shmanin, Simone Meloni, Xiaoqing Zhou, Dipanwita Dutta, Zheng Wang, Yi Wang, Hans Dijkstra, Gerhard Raven, Peter Clarke, Frédéric Teubert, Giovanni Carboni, Victor Coco, Adam Davis, Paolo Durante, Wenyu Zhang, Yu Zheng, Anton Petrov, Maxim Borisyak, Feng Jiang, Zhipeng Tang, Xuan Li, Alexey Boldyrev, Almagul Kondybayeva, Hossein Afsharnia

The production of Xi(++)(cc) baryons in proton-proton collisions at a centre-of-mass energy of root s = 13 Tev is measured in the transverse-momentum range 4 < p(T) < 15 GeV/c and the rapidity range 2.0 < y < 4.5. The data used in this measurement correspo ...

IOP PUBLISHING LTD2020

Verified Functional Programming

Nicolas Charles Yves Voirol

In this thesis, we present Stainless, a verification system for an expressive subset of the Scala language. Our system is based on a dependently-typed language and an algorithmic type checking procedure which ensures total correctness. We rely on SMT solve ...

EPFL2019

Theory and Practice of Coroutines with Snapshots

Aleksandar Prokopec, Fengyun Liu

While event-driven programming is a widespread model for asynchronous computing, its inherent control flow fragmentation makes event-driven programs notoriously difficult to understand and maintain. Coroutines are a general control flow construct that can ...

2018

Accurate Profile Measurement of the low Intensity Secondary Beams in the CERN Experimental Areas

Inaki Ortega Ruiz

The CERN accelerators deliver a wide spectrum of secondary beams to the Experimental Areas. These beams are composed of hadrons, leptons, and heavy ions that can vary greatly in momentum (1 GeV/c to 400 GeV/c) and intensity (10^2 to 10^8 particles per seco ...

EPFL2018

Interleaving with Coroutines: A Practical Approach for Robust Index Joins

Anastasia Ailamaki, Georgios Psaropoulos

Index join performance is determined by the efficiency of the lookup operation on the involved index. Although database indexes are highly optimized to leverage processor caches, main memory accesses inevitably increase lookup runtime when the index outsiz ...

VLDB Endowment Inc.2017

Building Efficient Query Engines using High-Level Languages

Ioannis Klonatos

We are currently witnessing a shift towards the use of high-level programming languages for systems development. These approaches collide with the traditional wisdom which calls for using low-level languages for building efficient software systems. This sh ...

EPFL2017

Approximate cloaking for the full wave equation via change of variables: The Drude-Lorentz model

Hoài-Minh Nguyên

This paper concerns approximate cloaking by mapping for a full, but scalar wave equation, when one allows for physically relevant frequency dependence of the material properties of the cloak. The paper is a natural continuation of [20], but here we employ ...

Elsevier2016

Decomposition Strategies for Nonconvex Problems, a Parametric Approach

Jean-Hubert Hours

This thesis deals with the development of numerical methods for solving nonconvex optimisation problems by means of decomposition and continuation techniques. We first introduce a novel decomposition algorithm based on alternating gradient projections and ...

EPFL2016

Emissions scenarios without measures 1990-2030

Philippe Thalmann, Marc Vielle, Bettina Schäppi

The goal of this study is to estimate the net impact of all measures implemented in the context of the Swiss energy and climate policies on CO2 emissions from combustion processes between 1990 and 2030. The study provides a projection of CO2 emissions unti ...

INFRAS EPFL2016

The Essence of Dependent Object Types

Martin Odersky, Tiark Rompf, Nada Amin, Sandro Stucki, Karl Samuel Grütter

Focusing on path-dependent types, the paper develops foundations for Scala from first principles. Starting from a simple calculus D-

Springer International Publishing2016

Dependent Object Types

Nada Amin

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. In particular, objects can contain type members, which can be selected as ...

EPFL2016

Deductive Program Repair, Computer Aided Verification

Viktor Kuncak, Etienne Kneuss

We present an approach to program repair and its application to programs with recursive functions over unbounded data types. Our approach formulates program repair in the framework of deductive synthesis that uses existing program structure as a hint to gu ...

2015

Formal verification of infinite-state BIP models

Simon Bliudze, Wajeb Saab

We propose two expressive and complementary techniques for the verification of safety properties of infinite-state BIP models. Both our techniques deal with the full BIP specification, while the existing approaches impose con- siderable restrictions: they ...

Springer2015

Forge: Generating a High Performance DSL Implementation from a Declarative Specification

Martin Odersky, Tiark Rompf

Domain-specific languages provide a promising path to automatically compile high-level code to parallel, heterogeneous, and distributed hardware. However, in practice high performance DSLs still require considerable software expertise to develop and force ...

Assoc Computing Machinery2014

Foundations of Path-Dependent Types

Martin Odersky, Tiark Rompf, Nada Amin

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

Effect Analysis for Programs with Callbacks

Viktor Kuncak, Etienne Kneuss, Philippe Paul Henri Suter

We introduce a precise interprocedural effect analysis for programs with mutable state, dynamic object allocation, and dynamic dispatch. Our analysis is precise even in the presence of dynamic dispatch where the context-insensitive estimate on the number o ...

Springer Berlin Heidelberg2013

Continuation of eigenvalues and invariant pairs for parameterized nonlinear eigenvalue problems

Daniel Kressner, Peter Cedric Effenberger

Invariant pairs have been proposed as a numerically robust means to represent and compute several eigenvalues along with the corresponding (generalized) eigenvectors for matrix eigenvalue problems that are nonlinear in the eigenvalue parameter. In this wor ...

Springer2011

Implementing First-Class Polymorphic Delimited Continuations by a Type-Directed Selective CPS-Transform

Martin Odersky, Tiark Rompf, Ingo Maier

We describe the implementation of first-class polymorphic delimited continuations in the programming language Scala. We use Scala's pluggable typing architecture to implement a simple type and effect system, which discriminates expressions with control eff ...

ACM2009