From the 1 of 2.5k papers with an AI index.
29.3k citations
- Centre National de la Recherche ScientifiqueFR646 papers
- Laboratoire Lorrain de Recherche en Informatique et ses ApplicationsFR180 papers
- Centre Inria de SaclayFR175 papers
- Sorbonne UniversitéFR174 papers
- Université Grenoble AlpesFR119 papers
- Université Paris CitéFR114 papers
- École Normale Supérieure - PSLFR113 papers
- Université Paris-SaclayFR96 papers
- Centre Inria de l'Université Grenoble AlpesFR94 papers
- Institut de Recherche en Informatique et Systèmes AléatoiresFR94 papers
- Centre Inria de l'Université de LilleFR90 papers
- École Normale Supérieure de LyonFR88 papers
8 papers · 2 filters
Compiling and securing cryptographic protocols
Yannick Chevalier, Michael Rusinowitch
Protocol narrations are widely used in security as semi-formal notations to specify conversations between roles. We define a translation from a protocol narration to the sequences…
A Formalization of the Semantics of Functional-Logic Programming in Isabelle
Francisco López Fraguas, Stephan Merz, Juan Rodríguez Hortalá
Modern functional-logic programming languages like Toy or Curry feature non-strict non-deterministic functions that behave under call-time choice semantics. A standard formulation…
Rewrite based Verification of XML Updates
Florent Jacquemard, Michael Rusinowitch
We consider problems of access control for update of XML documents. In the context of XML programming, types can be viewed as hedge automata, and static type checking amounts to ve…
On the relation between size-based termination and semantic labelling
Frédéric Blanqui, Cody Roux
We investigate the relationship between two independently developed termination techniques. On the one hand, sized-types based termination (SBT) uses types annotated with size expr…
On the distributed evaluation of recursive queries over graphs
Stephane Grumbach, Fang Wang, Zhilin Wu
Logical formalisms such as first-order logic (FO) and fixpoint logic (FP) are well suited to express in a declarative manner fundamental graph functionalities required in distribut…
Logical locality entails frugal distributed computation over graphs
Stephane Grumbach, Zhilin Wu
First-order logic is known to have limited expressive power over finite structures. It enjoys in particular the locality property, which states that first-order formulae cannot hav…