Publications associées à Swift (langage d'Apple)

Automated Formal Verification of Software Network Functions

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

EPFL2024

Degrees of Separation: A Flexible Type System for Safe Concurrency

Martin Odersky, Yichen Xu, Aleksander Slawomir Boruch-Gruszecki

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

2024

Scaling Language Features for Program Verification

Georg Stefan Schmid

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

EPFL2022

Declarative Variables in Online Dating: A Mixed-Method Analysis of a Mimetic-Distinctive Mechanism

Daniel Gatica-Perez, Jessica Carolina Pidoux

Declarative variables of self-description have a long-standing tradition in matchmaking media. With the advent of online dating platforms and their brand positioning, the volume and semantics of variables vary greatly across apps. However, a variable lands ...

2021

Safe initialization of objects

Fengyun Liu

The inception of object-oriented programming introduces a category of bugs related to object construction: initialization errors. Every newly created object goes through several initialization states: starting from a state where all fields are uninitialize ...

EPFL2020

Experimental Characterization of a T-Shaped Programmable Multistable Mechanism

Simon Nessim Henein, Mohamed Gamal Abdelrahman Ahmed Zanaty

Programmable multistable mechanisms (PMM) exhibit a modifiable stability behavior in which the number of stable states, stiffness, and reaction force characteristics are controlled via their programming inputs. In this paper, we present experimental charac ...

2018

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

Improving systems software security through program analysis and instrumentation

Volodymyr Kuznetsov

Security and reliability bugs are prevalent in systems software. Systems code is often written in low-level languages like C/C++, which offer many benefits but also delegate memory management and type safety to programmers. This invites bugs that cause cra ...

EPFL2016

Distributed Programming via Safe Closure Passing

Heather Christine Klug, Philipp Haller

Programming systems incorporating aspects of functional programming, e.g., higher-order func- tions, are becoming increasingly popular for large-scale distributed programming. New frameworks such as Apache Spark leverage functional techniques to provide hi ...

2015

Pattern-oriented memory interpolation of sparse historical rainfall records

Anton Schleiss, José Pedro Gamito de Saldanha Calado Matos, Théodora Cohen Liechti

The pattern-oriented memory (POM) is a novel historical rainfall interpolation method that explicitly takes into account the time dimension in order to interpolate areal rainfall maps. The method is based on the idea that rainfall patterns exist and can be ...

Elsevier2014

Code-Pointer Integrity

George Candea, Volodymyr Kuznetsov, Mathias Josef Payer

Systems code is often written in low-level languages like C/C++, which offer many benefits but also delegate memory management to programmers. This invites memory safety bugs that attackers can exploit to divert control flow and compromise the system. Depl ...

2014

RAY: Integrating Rx and Async for Direct-Style Reactive Streams

Heather Christine Klug, Philipp Haller

Languages like F#, C#, and recently also Scala, provide “async” extensions which aim to make asynchronous programming easier by avoiding an inversion of control that is inherent in traditional callback-based programming models (for the purpose of this pape ...

2013

Branch and Price for the Vehicle Routing Problem with Discrete Split Deliveries and Time Windows

Matteo Salani, Ilaria Vacca

The Discrete Split Delivery Vehicle Routing Problem with Time Windows (DSDVRPTW) consists of designing the optimal set of routes to serve, at least cost, a given set of customers while respecting constraints on vehicles' capacity and customer time windows. ...

2011

Swift Algorithms for Repeated Consensus

André Schiper, Martin Hutle, Fatemeh Borran, Nuno Filipe de Sousa Santos

We introduce the notion of a swift algorithm. Informally, an algorithm that solves the repeated consensus is swift if, in a partial synchronous run of this algorithm, eventually no timeout expires, i.e., the algorithm execution proceeds with the actual spe ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2010

Systems interactions analysis for the energy efficiency improvement of a Kraft process

François Maréchal

There is a broad range of techniques available to the engineer and that should be considered in a retrofit project to enhance the energy efficiency of an operating process. The two best known techniques and most often utilized are internal heat recovery by ...

2010

Implementing Joins using Extensible Pattern Matching

Philipp Haller

Join patterns are an attractive declarative way to synchronize both threads and asynchronous distributed computations. We explore joins in the context of extensible pattern matching that recently appeared in languages such as F# and Scala. Our implementati ...

Springer2008