| |
| 1997 | ||
|---|---|---|
| 5 | Laurent Fribourg, Hans Olsén: Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic. CONCUR 1997: 213-227 | |
| 4 | Laurent Fribourg, Hans Olsén: A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with Z-Counters. Constraints 2(3/4): 305-335 (1997) | |
| 3 | EE | Laurent Fribourg, Hans Olsén: Reachability sets of parameterized rings as regular languages. Electr. Notes Theor. Comput. Sci. 9: (1997) |
| 1996 | ||
| 2 | Laurent Fribourg, Hans Olsén: Reductions of Petri Nets and Unfolding of Propositional Logic Programs. LOPSTR 1996: 187-203 | |
| 1992 | ||
| 1 | Laurent Fribourg, Hans Olsén: A Unifying View of Structural Induction and Computation Induction for Logic Programs. LOPSTR 1992: 46-60 | |
| 1 | Laurent Fribourg | [1] [2] [3] [4] [5] |