75 citations
- Université Paris CitéFR48 papers
- Centre National de la Recherche ScientifiqueFR25 papers
- Institut national de recherche en sciences et technologies du numériqueFR8 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR8 papers
- Délégation Paris 7FR7 papers
- Sorbonne UniversitéFR4 papers
- École Normale Supérieure de LyonFR3 papers
- Laboratoire d'Informatique de l'École PolytechniqueFR3 papers
- Orange (France)FR3 papers
- CEA Paris-SaclayFR2 papers
- Commissariat à l'Énergie Atomique et aux Énergies AlternativesFR2 papers
- Computer Algorithms for MedicineAT2 papers
6 papers · 1 filter
Parameterized Verification of Safety Properties in Ad Hoc Network Protocols
Giorgio Delzanno, Arnaud Sangnier, Gianluigi Zavattaro
We summarize the main results proved in recent work on the parameterized verification of safety properties for ad hoc network protocols. We consider a model in which the communicat…
Automata and temporal logic over arbitrary linear time
Julien Cristau
Linear temporal logic was introduced in order to reason about reactive systems. It is often considered with respect to infinite words, to specify the behaviour of long-running syst…
Kolmogorov Complexity in perspective. Part I: Information Theory and Randomnes
Marie Ferbus-Zanda, Serge Grigorieff
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rando…
ASMs and Operational Algorithmic Completeness of Lambda Calculus
Marie Ferbus-Zanda, Serge Grigorieff
We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any…
Kolmogorov Complexity in perspective. Part II: Classification, Information Processing and Duality
Marie Ferbus-Zanda
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rando…
A Logic of Reachable Patterns in Linked Data-Structures
Greta Yorsh, Alexander Rabinovich, Mooly Sagiv +2
We define a new decidable logic for expressing and checking invariants of programs that manipulate dynamically-allocated objects via pointers and destructive pointer updates. The m…