Laurent FRIBOURG

Dikutip oleh

	Semua	Sejak 2020
Kutipan	2869	559
indeks-h	30	11
indeks-i10	64	16

160

120

198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202537 45 47 51 42 58 69 59 55 59 43 43 58 59 86 62 52 57 48 66 55 78 66 67 76 82 80 115 68 78 81 75 96 131 91 141 103 107 102 12

Akses publik

Lihat semua

24 artikel

1 artikel

tersedia

tidak tersedia

Berdasarkan pada mandat pendanaan

Pengarang bersama

Étienne AndréUniversité Paris 13, LIPN, CNRS, UMR 7030, F-93430, Villetaneuse, FranceEmail yang diverifikasi di univ-paris13.fr
Romain SoulatInput OutputEmail yang diverifikasi di iohk.io
Adrien Le CoëntLACL, Université Paris-Est CréteilEmail yang diverifikasi di u-pec.fr
emmanuelle encrenazassociate professor of computer science, University Pierre and Marie CurieEmail yang diverifikasi di lip6.fr
Claudine PicaronnyMaître de conférences, ENS CachanEmail yang diverifikasi di lsv.ens-cachan.fr
Ulrich KühneTélécom ParisTechEmail yang diverifikasi di telecom-paristech.fr
Marie DuflotLORIA - Université de Lorraine & INRIAEmail yang diverifikasi di inria.fr
Marie-Claude GaudelHonorary Professor of Computer Science, Université de Paris-Sud, OrsayEmail yang diverifikasi di lri.fr
Luc BougéENS Rennes, IRISA, INRIAEmail yang diverifikasi di ens-rennes.fr
Nicolas MarkeyCNRS, IRISA, Univ. Rennes, FranceEmail yang diverifikasi di irisa.fr
Giuseppe LipariFull professor, University of LilleEmail yang diverifikasi di univ-lille.fr
Youcheng SunLecturer, University of ManchesterEmail yang diverifikasi di manchester.ac.uk
Thomas HeraultUniversity of TennesseeEmail yang diverifikasi di eecs.utk.edu
Alexandre ChapoutotENSTA Paris - U2ISEmail yang diverifikasi di ensta.fr
Christian ReySafran TechEmail yang diverifikasi di safrangroup.com
Bertrand RevolENS Paris-SaclayEmail yang diverifikasi di ens-paris-saclay.fr
Sylvain PeyronnetBabbar.tech (CEO), ix-labs (CEO), former Full Prof in CSEmail yang diverifikasi di ix-labs.org
Lassaigne RichardEmail yang diverifikasi di math.univ-paris-diderot.fr
Sylvie PutotLIX, Ecole PolytechniqueEmail yang diverifikasi di polytechnique.edu
Eric GoubaultEcole PolytechniqueEmail yang diverifikasi di cea.fr

Ikuti

Laurent FRIBOURG

LMF - ENS Paris-Saclay & CNRS

Email yang diverifikasi di lsv.fr - Beranda

Computer Science Formal Methods Model Checking


Judul Urutkan menurut kutipan Urutkan menurut tahun Urutkan menurut judul	Dikutip oleh Dikutip oleh	Tahun
SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting L Fribourg Proc. Symp. Logic Programming, 172-184, 1985	284	1985
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	146	1986
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	143	2009
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	132	2012
A strong restriction of the inductive completion procedure L Fribourg Automata, Languages and Programming: 13th International Colloquium Rennes …, 1986	91	1986
Oriented equational clauses as a programming language L Fribourg Automata, Languages and Programming: 11th Colloquium Antwerp, Belgium, July …, 1984	84	1984
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	79	1997
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	76	2005
Reachability analysis of (timed) Petri nets using real arithmetic B Bérard, L Fribourg International Conference on Concurrency Theory, 178-193, 1999	68	1999
A strong restriction of the inductive completion procedure L Fribourg Journal of Symbolic Computation 8 (3), 253-276, 1989	68	1989
Extracting Logic Programs from Proofs that Use Extended Prolog Execution and Induction. L Fribourg ICLP, 685-699, 1990	61	1990
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	59	1999
A decompositional approach for computing least fixed-points of Datalog programs with Z-counters L Fribourg, H Olsén Constraints 2, 305-335, 1997	58	1997
Reachability sets of parameterized rings as regular languages L Fribourg, H Olsén Electronic Notes in Theoretical Computer Science 9, 40, 1997	55	1997
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	45	2012
Constraint logic programming applied to model checking L Fribourg International Workshop on Logic Programming Synthesis and Transformation, 30-41, 1999	45	1999
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	44	2009
Symbolic verification with gap-order constraints L Fribourg, J Richardson International Workshop on Logic Programming Synthesis and Transformation, 20-37, 1996	44	1996
Randomized dining philosophers without fairness assumption M Duflot, L Fribourg, C Picaronny Distributed Computing 17 (1), 65-76, 2004	42	2004
A closed-form evaluation for extended timed automata L Fribourg Rapport technique LSV-98-2, LSV, ENS Cachan, 1998	41	1998

Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.

Artikel 1–20

Kutipan per tahun

Kutipan duplikat

Kutipan yang digabung

Tambahkan pengarang bersamaPengarang bersama

Ikuti

Dikutip oleh

Pengarang bersama