dblp.uni-trier.dewww.uni-trier.de

Laurent Fribourg

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
55EERemy Chevallier, Emmanuelle Encrenaz-Tiphène, Laurent Fribourg, Weiwen Xu: Timed verification of the generic architecture of a memory circuit using parametric timed automata. Formal Methods in System Design 34(1): 59-81 (2009)
2008
54EENajla Chamseddine, Marie Duflot, Laurent Fribourg, Claudine Picaronny, Jeremy Sproston: Computing Expected Absorption Times for Parametric Determinate Probabilistic Timed Automata. QEST 2008: 254-263
53EEEmmanuelle Encrenaz, Laurent Fribourg: Time Separation of Events: An Inverse Method. Electr. Notes Theor. Comput. Sci. 209: 135-148 (2008)
52EEÉtienne André, Thomas Chatain, Laurent Fribourg, Emmanuelle Encrenaz: An Inverse Method for Parametric Timed Automata. Electr. Notes Theor. Comput. Sci. 223: 29-46 (2008)
2006
51EERemy Chevallier, Emmanuelle Encrenaz-Tiphène, Laurent Fribourg, Weiwen Xu: Verification of the Generic Architecture of a Memory Circuit Using Parametric Timed Automata. FORMATS 2006: 113-127
50EELaurent Fribourg, Stéphane Messika, Claudine Picaronny: Coupling and self-stabilization. Distributed Computing 18(3): 221-232 (2006)
2005
49EELaurent Fribourg, Stéphane Messika: Brief announcement: coupling for Markov decision processes - application to self-stabilization with arbitrary schedulers. PODC 2005: 322
48EEMarie Duflot, Laurent Fribourg, Thomas Hérault, Richard Lassaigne, Frédéric Magniette, Stéphane Messika, Sylvain Peyronnet, Claudine Picaronny: Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC. Electr. Notes Theor. Comput. Sci. 128(6): 195-214 (2005)
2004
47EELaurent Fribourg, Stéphane Messika, Claudine Picaronny: Coupling and Self-stabilization.. DISC 2004: 201-215
46EEMarie Duflot, Laurent Fribourg, Claudine Picaronny: Randomized dining philosophers without fairness assumption. Distributed Computing 17(1): 65-76 (2004)
2003
45 Béatrice Bérard, Laurent Fribourg, Francis Klay, Jean-François Monin: Compared Study of Two Correctness Proofs for the Standardized. Formal Methods in System Design 22(1): 59-86 (2003)
2002
44 Marie Duflot, Laurent Fribourg, Claudine Picaronny: Randomized Dining Philosophers without Fairness Assumption. IFIP TCS 2002: 169-180
2001
43 Laurent Fribourg: Computer Science Logic, 15th International Workshop, CSL 2001. 10th Annual Conference of the EACSL, Paris, France, September 10-13, 2001, Proceedings Springer 2001
42EEMarie Duflot, Laurent Fribourg, Ulf Nilsson: Unavoidable Configurations of Parameterized Rings of Processes. CONCUR 2001: 472-486
41EEMarie Duflot, Laurent Fribourg, Claudine Picaronny: Randomized Finite-State Distributed Algorithms as Markov Chains. DISC 2001: 240-254
40EEJoffroy Beauquier, Béatrice Bérard, Laurent Fribourg, Frédéric Magniette: Proving convergence of self-stabilizing systems using first-order rewriting and regular languages. Distributed Computing 14(2): 83-95 (2001)
2000
39 Laurent Fribourg: Petri Nets, Flat Languages and Linear Arithmetic. WFLP 2000: 344-365
1999
38EEBéatrice Bérard, Laurent Fribourg: Automated Verification of a Parametric Real-Time Program: The ABR Conformance Protocol. CAV 1999: 96-107
37EEBéatrice Bérard, Laurent Fribourg: Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic. CONCUR 1999: 178-193
36EEJoffroy Beauquier, Béatrice Bérard, Laurent Fribourg: A New Rewrite Method for Convergence of Self-Stabilizing Systems. DISC 1999: 240-253
35 Laurent Fribourg: Constraint Logic Programming Applied to Model Checking. LOPSTR 1999: 30-41
1998
34EEMarcos Veloso Peixoto, Laurent Fribourg: Unfolding Parametric Automata. LATIN 1998: 88-101
1997
33 Laurent Fribourg, Hans Olsén: Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic. CONCUR 1997: 213-227
32 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)
31EELaurent Fribourg, Hans Olsén: Reachability sets of parameterized rings as regular languages. Electr. Notes Theor. Comput. Sci. 9: (1997)
1996
30 Laurent Fribourg, Hans Olsén: Reductions of Petri Nets and Unfolding of Propositional Logic Programs. LOPSTR 1996: 187-203
29 Laurent Fribourg, Julian Richardson: Symbolic Verification with Gap-Order Constraints. LOPSTR 1996: 20-37
1994
28 Laurent Fribourg, Franco Turini: Logic Programming Synthesis and Transformation - Meta-Programming in Logic. 4th Internation Workshops, LOPSTR'94 and META'94, Pisa, Italy, June 20-21, 1994, Proceedings Springer 1994
27 Laurent Fribourg, Marcos Veloso Peixoto: Bottom-up Evaluation of Datalog Programs with Arithmetic Constraints. CADE 1994: 311-325
1993
26 Laurent Fribourg, Marcos Veloso Peixoto: Concurrent Constraint Automata. ILPS 1993: 656
1992
25 Laurent Fribourg: Mixing List Recursion and Arithmetic LICS 1992: 419-429
24 Laurent Fribourg, Hans Olsén: A Unifying View of Structural Induction and Computation Induction for Logic Programs. LOPSTR 1992: 46-60
1991
23 P. H. Cheong, Laurent Fribourg: A Survey of the Implementations of Narrowing. Declarative Programming 1991: 177-187
22 Laurent Fribourg: Extracting Logic Programs from Proofs that Use Extended Prolog Execution and Induction. ICLP Workshop on Construction of Logic Programs 1991: 39-66
21 Laurent Fribourg: Automatic Generation of Simplification Lemmas for Inductive Proofs. ISLP 1991: 103-116
20 P. H. Cheong, Laurent Fribourg: Efficient Integration of Simplifications into Prolog. PLILP 1991: 359-370
1990
19 Laurent Fribourg: Extracting Logic Programs from Proofs that Use Extended Prolog Execution and Induction. ICLP 1990: 685-699
18 Laurent Fribourg: A New Presburger Arithmetic Decision Procedure Based on Extended Prolog Execution. PLILP 1990: 174-188
1989
17 Laurent Fribourg: A Strong Restriction of the Inductive Completion Procedure. J. Symb. Comput. 8(3): 253-276 (1989)
1988
16 Laurent Fribourg: Functional Extensions to Prolog: Are they Needed? ALP 1988: 21-29
15 Laurent Fribourg: Equivalence-Preserving Transformations of Inductive Properties of Prolog Programs. ICLP/SLP 1988: 893-908
1987
14 Laurent Fribourg: On the Use of Conditional Rewrite Rules in Inductive Theorem Proving. CTRS 1987: 56-61
13 Laurent Fribourg: List concatenation via extended unification. SPLT 1987: 45-58
12 Laurent Fribourg: SLOG: A Logic Interpreter for Equational Clauses. STACS 1987: 479-480
1986
11 Laurent Fribourg: A Strong Restriction of the Inductive Completion Procedure. ICALP 1986: 105-115
10EELuc Bougé, N. Choquet, Laurent Fribourg, Marie-Claude Gaudel: Test sets generation from algebraic specifications using logic programming. Journal of Systems and Software 6(4): 343-360 (1986)
1985
9 N. Choquet, Laurent Fribourg, A. Mauboussin: Runnable protocol specifications using the logic interpreter SLOG. PSTV 1985: 149-168
8 Laurent Fribourg: Handling Function Definitions through Innermost Superposition and Rewriting. RTA 1985: 325-344
7 Laurent Fribourg: SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting. SLP 1985: 172-184
6 Luc Bougé, N. Choquet, Laurent Fribourg, Marie-Claude Gaudel: Application of Prolog to Test Sets Generation from Algebraic Specifications. TAPSOFT, Vol.2 1985: 261-275
5 Laurent Fribourg: A Superposition Oriented Theorem Prover. Theor. Comput. Sci. 35: 129-164 (1985)
1984
4 Laurent Fribourg: A Narrowing Procedure for Theories with Constructors. CADE 1984: 259-281
3 Laurent Fribourg: Oriented Equational Clauses as a Programming Language. ICALP 1984: 162-173
2 Laurent Fribourg: Oriented Equational Clauses as a Programming Language. J. Log. Program. 1(2): 165-177 (1984)
1983
1 Laurent Fribourg: A Superposition Oriented Theorem Prover. IJCAI 1983: 923-925

Coauthor Index

1Étienne André [52]
2Joffroy Beauquier [36] [40]
3Béatrice Bérard [36] [37] [38] [40] [45]
4Luc Bougé [6] [10]
5Najla Chamseddine [54]
6Thomas Chatain [52]
7P. H. Cheong [20] [23]
8Remy Chevallier [51] [55]
9N. Choquet [6] [9] [10]
10Marie Duflot [41] [42] [44] [46] [48] [54]
11Emmanuelle Encrenaz-Tiphène (Emmanuelle Encrenaz) [51] [52] [53] [55]
12Marie-Claude Gaudel [6] [10]
13Thomas Hérault [48]
14Francis Klay [45]
15Richard Lassaigne [48]
16Frédéric Magniette [40] [48]
17A. Mauboussin [9]
18Stéphane Messika [47] [48] [49] [50]
19Jean-François Monin [45]
20Ulf Nilsson [42]
21Hans Olsén [24] [30] [31] [32] [33]
22Marcos Veloso Peixoto [26] [27] [34]
23Sylvain Peyronnet [48]
24Claudine Picaronny [41] [44] [46] [47] [48] [50] [54]
25Julian Richardson [29]
26Jeremy Sproston [54]
27Franco Turini [28]
28Weiwen Xu [51] [55]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)