Follow
Laurent FRIBOURG
Laurent FRIBOURG
LMF - ENS Paris-Saclay & CNRS
Verified email at lsv.fr - Homepage
Title
Cited by
Cited by
Year
SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting
L Fribourg
Proc. Symp. Logic Programming, 172-184, 1985
2791985
Test sets generation from algebraic specifications using logic programming
L Bougé, N Choquet, L Fribourg, MC Gaudel
Journal of Systems and Software 6 (4), 343-360, 1986
1451986
An inverse method for parametric timed automata
É André, T Chatain, L Fribourg, E Encrenaz
International Journal of Foundations of Computer Science 20 (05), 819-836, 2009
1342009
IMITATOR 2.5: A tool for analyzing robustness in scheduling problems
É André, L Fribourg, U Kühne, R Soulat
International Symposium on Formal Methods, 33-36, 2012
1242012
A strong restriction of the inductive completion procedure
L Fribourg
Automata, Languages and Programming: 13th International Colloquium Rennes …, 1986
911986
Oriented equational clauses as a programming language
L Fribourg
Automata, Languages and Programming: 11th Colloquium Antwerp, Belgium, July …, 1984
811984
Proving safety properties of infinite state systems by compilation into Presburger arithmetic
L Fribourg, H Olsén
International Conference on Concurrency Theory, 213-227, 1997
781997
Probabilistic model checking of the CSMA/CD protocol using PRISM and APMC
M Duflot, L Fribourg, T Herault, R Lassaigne, F Magniette, S Messika, ...
Electronic Notes in Theoretical Computer Science 128 (6), 195-214, 2005
752005
Reachability analysis of (timed) Petri nets using real arithmetic
B Bérard, L Fribourg
International Conference on Concurrency Theory, 178-193, 1999
661999
A strong restriction of the inductive completion procedure
L Fribourg
Journal of Symbolic Computation 8 (3), 253-276, 1989
661989
Extracting Logic Programs from Proofs that Use Extended Prolog Execution and Induction.
L Fribourg
ICLP, 685-699, 1990
591990
A decompositional approach for computing least fixed-points of Datalog programs with Z-counters
L Fribourg, H Olsén
Constraints 2, 305-335, 1997
581997
Automated verification of a parametric real-time program: the ABR conformance protocol
B Béerard, L Fribourg
Computer Aided Verification: 11th International Conference, CAV’99 Trento …, 1999
561999
Reachability sets of parameterized rings as regular languages
L Fribourg, H Olsén
Electronic Notes in Theoretical Computer Science 9, 40, 1997
521997
Constraint logic programming applied to model checking
L Fribourg
International Workshop on Logic Programming Synthesis and Transformation, 30-41, 1999
451999
A closed-form evaluation for extended timed automata
L Fribourg
Rapport technique LSV-98-2, LSV, ENS Cachan, 1998
431998
Symbolic verification with gap-order constraints
L Fribourg, J Richardson
International Workshop on Logic Programming Synthesis and Transformation, 20-37, 1996
421996
Robustness analysis for scheduling problems using the inverse method
L Fribourg, R Soulat, D Lesens, P Moro
2012 19th International Symposium on Temporal Representation and Reasoning …, 2012
412012
Coupling and self-stabilization
L Fribourg, S Messika, laudine Picaronny
Distributed Computing 18 (3), 221-232, 2006
412006
Timed verification of the generic architecture of a memory circuit using parametric timed automata
R Chevallier, E Encrenaz-Tiphene, L Fribourg, W Xu
Formal Methods in System Design 34, 59-81, 2009
392009
The system can't perform the operation now. Try again later.
Articles 1–20