4 citations · 6 across the 5 of their papers we have counts for
7 papers
A Simple Algorithm for Worst-Case Optimal Join and Sampling
Florent Capelli, Oliver Irwin, Sylvain Salvati
We present an elementary branch and bound algorithm with a simple analysis of why it achieves worstcase optimality for join queries on classes of databases defined respectively by…
Jumping Evaluation of Nested Regular Path Queries
Joachim Niehren, Sylvain Salvati, Rustam Azimov
Nested regular path queries are used for querying graph databases and RDF triple stores. We propose a new algorithm for evaluating nested regular path queries on a graph from a set…
is an -MCFL
Kilian Gebhardt, Frédéric Meunier, Sylvain Salvati
Commutative properties in formal languages pose problems at the frontier of computer science, computational linguistics and computational group theory. A prominent problem of this…
Typing weak MSOL properties
Sylvain Salvati, Igor Walukiewicz
We consider lambda-Y-calculus as a non-interpreted functional programming language: the result of the execution of a program is its normal form that can be seen as the tree of call…
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable
Lorenzo Clemente, Paweł Parys, Sylvain Salvati +1
A non-deterministic recursion scheme recognizes a language of finite trees. This very expressive model can simulate, among others, higher-order pushdown automata with collapse. We…
Ordered Tree-Pushdown Systems
Lorenzo Clemente, Paweł Parys, Sylvain Salvati +1
We define a new class of pushdown systems where the pushdown is a tree instead of a word. We allow a limited form of lookahead on the pushdown conforming to a certain ordering rest…
Using models to model-check recursive schemes
Sylvain Salvati, Igor Walukiewicz
We propose a model-based approach to the model checking problem for recursive schemes. Since simply typed lambda calculus with the fixpoint operator, lambda-Y-calculus, is equivale…