10 citations · 13 across the 4 of their papers we have counts for
5 papers
On Complexity Bounds and Confluence of Parallel Term Rewriting
Thaïs Baudon, Carsten Fuhs, Laure Gonnord
We revisit parallel-innermost term rewriting as a model of parallel computation on inductive data structures and provide a corresponding notion of runtime complexity parametric in…
A Survey on Parallelism and Determinism
Laure Gonnord, Ludovic Henrio, Lionel Morel +1
Parallelism is often required for performance. In these situations an excess of non-determinism is harmful as it means the program can have several different behaviours or even dif…
Analysing Parallel Complexity of Term Rewriting
Thaïs Baudon, Carsten Fuhs, Laure Gonnord
We revisit parallel-innermost term rewriting as a model of parallel computation on inductive data structures and provide a corresponding notion of runtime complexity parametric in…
An encoding of array verification problems into array-free Horn clauses
David Monniaux, Laure Gonnord
Automatically verifying safety properties of programs is hard, and it is even harder if the program acts upon arrays or other forms of maps. Many approaches exist for verifying pro…
Using Bounded Model Checking to Focus Fixpoint Iterations
David Monniaux, Laure Gonnord
Two classical sources of imprecision in static analysis by abstract interpretation are widening and merge operations. Merge operations can be done away by distinguishing paths, as…