Publications associées à Verification of Component-based Systems via Predicate Abstraction and Simultaneous Set Reduction

Scalable Metaprogramming in Scala 3

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

EPFL2023

Towards Novel Evaluation Methods for Social Dialog Systems

Ekaterina Svikhnushina

Language has shaped human evolution and led to the desire to endow machines with language abilities. Recent advancements in natural language processing enable us to achieve this breakthrough in human-machine interaction. However, introducing conversational ...

EPFL2023

Robust Collaborative Learning with Linear Gradient Overhead

Rachid Guerraoui, John Stephan, Sadegh Farhadkhani, Le Nguyen Hoang, Nirupam Gupta, Rafaël Benjamin Pinot

Collaborative learning algorithms, such as distributed SGD (or D-SGD), are prone to faulty machines that may deviate from their prescribed algorithm because of software or hardware bugs, poisoned data or malicious behaviors. While many solutions have been ...

PLMR2023

A biohybrid interaction framework for the integration of robots in animal societies

Francesco Mondada, Daniel Burnier, Vaios Papaspyros, Raphael Cherfan

The collective behavior of animals has been traditionally studied through observation, quantitative models of behavior, and devices of low intelligence. Nowadays, the advancements in the field of robotics allow for closed-loop experiments that occur in rea ...

2023

Human-Robot Swarm Interaction: An Explorative Path to Foster Complex Systems Understanding

Hala Khodr

Order, regularities, and patterns are ubiquitous around us. A flock of birds maneuvering in the sky, the self-organization of social insects, a global pandemic or a traffic jam are examples of complex systems where the macroscopic patterns arise from the m ...

EPFL2023

Automated Verification of Network Function Binaries

George Candea, Solal Vincenzo Pirelli, Aikaterini Argyraki

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

USENIX Association2022

Do Children Adapt Their Perspective to a Robot When They Fail to Complete a Task?

Pierre Dillenbourg, Elmira Yadollahi, Ana Paiva

Spatial understanding and communication are essential skills in human interaction. An adequate understanding of others' spatial perspectives can increase the quality of the interaction, both perceptually and cognitively. In this paper, we take the first st ...

Assoc Computing Machinery2022

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

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

Charly Nicolas Lucien Castes

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

IEEE COMPUTER SOC2022

MaxwellNet: Physics-driven deep neural network training based on Maxwell's equations

Demetri Psaltis, Joowon Lim

Maxwell's equations govern light propagation and its interaction with matter. Therefore, the solution of Maxwell's equations using computational electromagnetic simulations plays a critical role in understanding light-matter interaction and designing optic ...

AIP Publishing2022