Across diverse biological systems -- ranging from neural networks to intracellular signaling and genetic regulatory networks -- the information about changes in the environment is frequently encoded in the full temporal dynamics of the network nodes. A pressing data-ana...

TLA+ is a language for formal specification of all kinds of computer systems. System designers use this language to specify concurrent, distributed, and fault-tolerant protocols, which are traditionally presented in pseudo-code. TLA+ is extremely concise yet expressive:...

International audience; Executable Domain-Specific Modeling Languages (xDSMLs) enable the application of early dynamic verification and validation (V&V) techniques for behavioral models. At the core of such techniques, execution traces are used to represent the evolutio...

International audience; Designing algorithms for distributed systems that provide a round abstraction is often simpler than designing for those that do not provide such an abstraction. Further, distributed systems need to tolerate various kinds of failures. The concept ...

Author summary Mathematical understanding of how randomness at the molecular scale, also known as molecular noise, ultimately affects the fate of organisms and whole populations is widely recognized as a challenging problem in multi-scale modeling. Here, we develop an a...

International audience We propose an $\textit{experimental mathematics approach}$ leading to the computer-driven $\textit{discovery}$ of various conjectures about structural properties of generating functions coming from enumeration of restricted lattice walks in 2D and...

International audience; We present an online occlusion culling system which computes visibility in parallel to the rendering pipeline. We show how to use point visibility algorithms to quickly calculate a tight potentially visible set (PVS) which is valid for several fr...

Agreeing on a common value among a set of agents is a fundamental problem in distributed computing, which occurs in several variants: In contrast to exact consensus, approximate variants are studied in systems where exact agreement is not possible or required, e.g., in ...

This paper surveys the emerging methods to automate reasoning over large libraries developed with formal proof assistants. We call these methods hammers. They give the authors of formal proofs a strong "one-stroke" tool for discharging difficult lemmas without the need ...

International audience; The convergence behaviour of multi-revolution composition methods combined with time-splitting methods is analysed for highly oscillatory linear differential equations of Schrödinger type. Numerical experiments illustrate and complement the theor...