The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Laurent Fribourg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  50. Computing Expected Absorption Times for Parametric Determinate Probabilistic Timed Automata. [Citation Graph (, )][DBLP]


  51. Behavioral Cartography of Timed Automata. [Citation Graph (, )][DBLP]


  52. An Inverse Method for Policy-Iteration Based Algorithms [Citation Graph (, )][DBLP]


  53. Time Separation of Events: An Inverse Method. [Citation Graph (, )][DBLP]


  54. An Inverse Method for Parametric Timed Automata. [Citation Graph (, )][DBLP]


Search in 0.317secs, Finished in 0.320secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002