A Unifying View of Structural Induction and Computation Induction for Logic Programs. - Laurent Fribourg; Hans Olsén (LOPSTR, 1992)

Reductions of Petri Nets and Unfolding of Propositional Logic Programs. - Laurent Fribourg; Hans Olsén (LOPSTR, 1996)

Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic. - Laurent Fribourg; Hans Olsén (CONCUR, 1997)

A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with Z-Counters. - Laurent Fribourg; Hans Olsén (Constraints An Int. J., 1997)

Reachability sets of parameterized rings as regular languages. - Laurent Fribourg; Hans Olsén (INFINITY, 1997)