The explosion in the amount of the available RDF data has lead to the need to explore,
query and understand such data sources. Due to the complex structure of RDF graphs and …

Equivalence checking is a formal verification approach that consists in proving that two
programs or models are related modulo some equivalence relation, or that one is included …

This paper focuses on data structures for multi-core reachability, which is a key component
in model checking algorithms and other verification methods. A cornerstone of an efficient …

This paper studies fundamental problems for distributed graph simulation. Given a pattern
query Q and a graph G that is fragmented and distributed, a graph simulation algorithm A is …

The central keywords of this thesis are “verification” and “distribution”. Verification refers to
the process of finding, by formal means, design errors in complex hardware and software …

RDF datasets with billions of triples are no longer unusual and continue to grow constantly
(eg LOD cloud) driven by the inherent flexibility of RDF that allows to represent very diverse …

We present a generic partition refinement algorithm that quotients coalgebraic systems by
behavioural equivalence, an important task in reactive verification; coalgebraic generality …

Partial order reduction and distributed-memory processing are the two essential techniques
to fight the well-known state space explosion problem in explicit state model checking …

Bisimilarity checking is an important operation to perform explicit-state model checking when
the state space of a model under verification has already been generated. It can be applied …

We showed in a recent paper that, when verifying a modal μ-calculus formula, the actions of
the system under verification can be partitioned into sets of so-called weak and strong …