33 citations · 47 across the 7 of their papers we have counts for
7 papers
Designing and Comparing RPQ Semantics
Victor Marsault, Antoine Meyer
Modern property graph database query languages such as Cypher, PGQL, GSQL, and the standard GQL draw inspiration from the formalism of regular path queries (RPQs). In order to outp…
Counting CTL
François Laroussinie, Antoine Meyer, Eudes Petonnet
This paper presents a range of quantitative extensions for the temporal logic CTL. We enhance temporal modalities with the ability to constrain the number of states satisfying cert…
On Term Rewriting Systems Having a Rational Derivation
Antoine Meyer
Several types of term rewriting systems can be distinguished by the way their rules overlap. In particular, we define the classes of prefix, suffix, bottom-up and top-down systems,…
Symbolic Reachability Analysis of Higher-Order Context-Free Processes
Ahmed Bouajjani, Antoine Meyer
We consider the problem of symbolic reachability analysis of higher-order context-free processes. These models are generalizations of the context-free processes (also called BPA pr…
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…
Linearly bounded infinite graphs
Arnaud Carayol, Antoine Meyer
Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural class of infinite automata representing their observable…