344 citations
- D. Chablat2 profiles36 · h 36
- Damien Chablat3 profiles17 · h 3
- Richard Dufour4 profiles16 · h 17
- S. Marx14 · h 16
- Diana Mateus12 · h 28
- Florian Boudin2 profiles9 · h 19
- Mathieu Lagrange3 profiles8 · h 24
- Vincent Labatut2 profiles8 · h 23
- Vincent Lostanlen2 profiles8 · h 11
- B. Daille7 · h 24
- C. Vaida7 · h 22
- D. Lime7 · h 25
- Nantes UniversitéFR236 papers
- Centre National de la Recherche ScientifiqueFR94 papers
- École Centrale de NantesFR70 papers
- IMT AtlantiqueFR37 papers
- Institut national de recherche en sciences et technologies du numériqueFR12 papers
- Université de NantesFR12 papers
- Laboratoire Informatique d'AvignonFR10 papers
- Université Paris-SaclayFR9 papers
- Centre Hospitalier Universitaire de NantesFR8 papers
- Japanese-French Laboratory for InformaticsJP7 papers
- Sorbonne UniversitéFR7 papers
- Universitat Pompeu FabraES7 papers
15 papers · 1 filter
Antichains for Concurrent Parameterized Games
Nathalie Bertrand, Patricia Bouyer, Gaëtan Staquet
Concurrent parameterized games involve a fixed yet arbitrary number of players. They are described by finite arenas in which the edges are labeled with languages that describe the…
Classical notions of computation and the Hasegawa-Thielecke theorem (extended version)
Éléonore Mangel, Paul-André Melliès, Guillaume Munch-Maccagnoni
In the spirit of the Curry-Howard correspondence between proofs and programs, we define and study a syntax and semantics for classical logic equipped with a computationally involut…
A First Order Theory of Diagram Chasing
Assia Mahboubi, Matthieu Piquerez
This paper discusses the formalization of proofs "by diagram chasing", a standard technique for proving properties in abelian categories. We discuss how the essence of diagram chas…
Configuring Timing Parameters to Ensure Execution-Time Opacity in Timed Automata
Étienne André, Engel Lefaucheux, Didier Lime +2
Timing information leakage occurs whenever an attacker successfully deduces confidential internal information by observing some timed information such as events with timestamps. Ti…
Compositional pre-processing for automated reasoning in dependent type theory
Valentin Blot, Denis Cousineau, Enzo Crance +4
In the context of interactive theorem provers based on a dependent type theory, automation tactics (dedicated decision procedures, call of automated solvers, ...) are often limited…
Complete trace models of state and control
Guilhem Jaber, Andrzej S. Murawski
We consider a hierarchy of four typed call-by-value languages with either higher-order or ground-type references and with either callcc or no control operator.Our first result is a…