| 2019 | DSD | LAOCON: A Run-Time Monitoring and Verification Approach for Hardware Trojan Detection. | Jean-Luc Danger, Laurent Fribourg, Ulrich Khne, Maha Naceur |
| 2019 | VMCAI | Verification of an Industrial Asynchronous Leader Election Algorithm Using Abstractions and Parametric Model Checking. | tienne Andr, Laurent Fribourg, Jean-Marc Mota, Romain Soulat |
| 2014 | RTCSA | Component-based analysis of hierarchical scheduling using linear hybrid automata. | Youcheng Sun, Giuseppe Lipari, Romain Soulat, Laurent Fribourg, Nicolas Markey |
| 2013 | ATVA | Merge and Conquer: State Merging in Parametric Timed Automata. | tienne Andr, Laurent Fribourg, Romain Soulat |
| 2012 | FM | IMITATOR 2.5: A Tool for Analyzing Robustness in Scheduling Problems. | tienne Andr, Laurent Fribourg, Ulrich Khne, Romain Soulat |
| 2012 | TIME | Robustness Analysis for Scheduling Problems Using the Inverse Method. | Laurent Fribourg, Romain Soulat, David Lesens, Pierre Moro |
| 2005 | PODC | Brief announcement: coupling for Markov decision processes - application to self-stabilization with arbitrary schedulers. | Laurent Fribourg, Stphane Messika |
| 2001 | CONCUR | Unavoidable Configurations of Parameterized Rings of Processes. | Marie Duflot, Laurent Fribourg, Ulf Nilsson |
| 1999 | CAV | Automated Verification of a Parametric Real-Time Program: The ABR Conformance Protocol. | Batrice Brard, Laurent Fribourg |
| 1999 | CONCUR | Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic. | Batrice Brard, Laurent Fribourg |
| 1999 | LOPSTR | Constraint Logic Programming Applied to Model Checking. | Laurent Fribourg |
| 1998 | LATIN | Unfolding Parametric Automata. | Marcos Veloso Peixoto, Laurent Fribourg |
| 1997 | CONCUR | Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic. | Laurent Fribourg, Hans Olsn |
| 1996 | LOPSTR | Reductions of Petri Nets and Unfolding of Propositional Logic Programs. | Laurent Fribourg, Hans Olsn |
| 1996 | LOPSTR | Symbolic Verification with Gap-Order Constraints. | Laurent Fribourg, Julian Richardson |
| 1994 | CADE | Bottom-up Evaluation of Datalog Programs with Arithmetic Constraints. | Laurent Fribourg, Marcos Veloso Peixoto |
| 1992 | LICS | Mixing List Recursion and Arithmetic | Laurent Fribourg |
| 1992 | LOPSTR | A Unifying View of Structural Induction and Computation Induction for Logic Programs. | Laurent Fribourg, Hans Olsn |
| 1991 | ICLP | Extracting Logic Programs from Proofs that Use Extended Prolog Execution and Induction. | Laurent Fribourg |
| 1990 | ICLP | Extracting Logic Programs from Proofs that Use Extended Prolog Execution and Induction. | Laurent Fribourg |
| 1988 | ICLP | Equivalence-Preserving Transformations of Inductive Properties of Prolog Programs. | Laurent Fribourg |
| 1987 | STACS | SLOG: A Logic Interpreter for Equational Clauses. | Laurent Fribourg |
| 1986 | ICALP | A Strong Restriction of the Inductive Completion Procedure. | Laurent Fribourg |
| 1984 | CADE | A Narrowing Procedure for Theories with Constructors. | Laurent Fribourg |
| 1984 | ICALP | Oriented Equational Clauses as a Programming Language. | Laurent Fribourg |
| 1983 | IJCAI | A Superposition Oriented Theorem Prover. | Laurent Fribourg |