60 citations
- Université Paris-SaclayFR43 papers
- Centre National de la Recherche ScientifiqueFR36 papers
- CentraleSupélecFR17 papers
- Institut national de recherche en sciences et technologies du numériqueFR14 papers
- École Normale Supérieure - PSLFR11 papers
- École Normale Supérieure Paris-SaclayFR8 papers
- Laboratoire de Biologie et Pharmacologie AppliquéeFR8 papers
- Laboratoire Lorrain de Recherche en Informatique et ses ApplicationsFR8 papers
- Centre Inria de SaclayFR6 papers
- Institut Universitaire de FranceFR6 papers
- Université de LorraineFR6 papers
- Aix-Marseille UniversitéFR5 papers
9 papers · 1 filter
Proceedings of the Twentieth International Conference on Quantum Physics and Logic
Shane Mansfield, Benoît Valiron, Vladimir Zamdzhiev
This volume contains the proceedings of the 20th International Conference on Quantum Physics and Logic (QPL 2023). The aim of the QPL conference series is to bring together academi…
Semantics for a Turing-complete Reversible Programming Language with Inductive Types
Kostia Chardonnet, Louis Lemonnier, Benoît Valiron
This paper is concerned with the expressivity and denotational semantics of a functional higher-order reversible programming language based on Theseus. In this language, pattern-ma…
Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing
Renaud Vilmart
The "Sum-Over-Paths" formalism is a way to symbolically manipulate linear maps that describe quantum systems, and is a tool that is used in formal verification of such systems. We…
On the Satisfiability of Local First-Order Logics with Data
Benedikt Bollig, Arnaud Sangnier, Olivier Stietel
We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain. Data values can be compared wrt.\ equality. As the…
Analyzing Robustness of Angluin's L Algorithm in Presence of Noise
Lina Ye, Igor Khmelnitsky, Serge Haddad +5
Angluin's L algorithm learns the minimal deterministic finite automaton (DFA) of a regular language using membership and equivalence queries. Its probabilistic approximatively…
Games on Graphs: From Logic and Automata to Algorithms
Nathanaël Fijalkow, C. Aiswarya, Guy Avni +22
The objective of this book is to give a comprehensive presentation of the research field concerned with infinite duration games on graphs. Historically, these game models appeared…