GPUs offer parallelism as a commodity, but they are difficult to program correctly. Static
analyzers that guarantee data-race freedom (DRF) are essential to help programmers …

This paper reports on the formalization and proof of soundness, using the Coq proof
assistant, of an alias analysis: a static analysis that approximates the flow of pointer values …

Cloud hypervisors are critical software whose formal verification can increase our
confidence in the reliability and security of the cloud. This work presents a case study on …

This book presents a modular framework for slicing in the proof assistant Isabelle/HOL which
is based on abstract control flow graphs. Building on such abstract structures renders the …

GPUs offer parallelism as a commodity, but they are difficult to program correctly. Static
analyzers that guarantee data-race freedom (DRF) are essential to help programmers …

We propose a formal definition of the notion of textual alignment as is used in programming
languages proposing spmd-like collective operations. We argue that this property provides …

An end-to-end guarantee of software correctness by formal verification must consider two
sources of bugs. First, the verification tool must be correct. Second, programs are often …

Concevoir et implanter des programmes parallèles est une tâche complexe, sujette aux
erreurs. La vérification des programmes parallèles est également plus difficile que celle des …

Explicitly managed memories have emerged as a good alternative for multicore processors
design in order to reduce energy and performance costs. Memory transfers then rely on …

With the wide expansion of multiprocessor architectures, the analysis and reasoning for
programs under weak memory models has become an important concern. This work …