Publications : Laurent FRIBOURG

[JFA20a]
J. Jerray, L. Fribourg, and É. André. Guaranteed phase synchronization of hybrid oscillators using symbolic Euler's method: The Brusselator and biped examples. Research Report 2006.09993, Computing Research Repository, 2020.
BibTex | Web page | PDF ]
[JFA20b]
J. Jerray, L. Fribourg, and É. André. Robust optimal control using dynamic programming and guaranteed Euler's method. Research Report 2007.13644, Computing Research Repository, 2020.
BibTex | Web page | PDF ]
[JF20]
J. Jerray and L. Fribourg. Generation of bounded invariants via stroboscopic set-valued maps: Application to the stability analysis of parametric time-periodic systems. Research Report 2012.09310, Computing Research Repository, 2020.
BibTex | Web page | PDF ]
[LF19a]
A. Le Coënt and L. Fribourg. Guaranteed Control of Sampled Switched Systems using Semi-Lagrangian Schemes and One-Sided Lipschitz Constants. In Proceedings of the 58th IEEE Conference on Decision and Control (CDC'19), pages 599--604, Nice, France, December 2019. IEEE Control System Society.
doi: 10.1109/CDC40024.2019.9029376.
BibTex | DOI | Web page | PDF ]
[LF19b]
A. Le Coënt and L. Fribourg. Guaranteed Optimal Reachability Control of Reaction-Diffusion Equations Using One-Sided Lipschitz Constants and Model Reduction. In 9th International Workshop on Cyber Physical Systems (CyPhy'19) and 15th International Workshop on Model-Based Design (WESE'19), Revised Selected Papers, volume 11971 of Lecture Notes in Computer Science, pages 181--202, New York City, NY, USA, October 2019. Springer.
doi: 10.1007/978-3-030-41131-2_9.
BibTex | DOI | Web page ]
[DFKN19]
J. Danger, L. Fribourg, U. Kühne, and M. Naceur. LAOCOÖN: A Run-Time Monitoring and Verification Approach for Hardware Trojan Detection. In Proceedings of the 22nd Euromicro Conference on Digital System Design (DSD'19), pages 269--276, Kallithea, Greece, August 2019. IEEE Press.
doi: 10.1109/DSD.2019.00047.
BibTex | DOI | Web page ]
[ZSGF19]
D. Zonetti, A. Saoud, A. Girard, and L. Fribourg. A symbolic approach to voltage stability and power sharing in time-varyingDC microgrids. In Proceedings of the 18th European Control Conference (ECC'19), pages 903--909, Naples, Italy, June 2019. IEEE Press.
doi: 10.23919/ECC.2019.8796095.
BibTex | DOI | Web page ]
[ACF+19]
É. André, E. Coquard, L. Fribourg, J. Jerray, and D. Lesens. Parametric Schedulability Analysis of a Launcher Flight Control System Under Reactivity Constraints. In Proceedings of the 19th International Conference on Application of Concurrency to System Design (ACSD'19), pages 13--22, Aachen, Germany, June 2019. IEEE Computer Society Press.
doi: 10.1109/ACSD.2019.00006.
BibTex | DOI | Web page ]
[AFMS19]
É. André, L. Fribourg, J.-M. Mota, and R. Soulat. Verification of an industrial asynchronous leader election algorithm using abstractions and parametric model checking. In Proceedings of the 20th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI'19), Lecture Notes in Computer Science, pages 409--424, Cascais/Lisbon, Portugal, January 2019. Springer.
BibTex | PDF ]
[LFV18]
A. Le Coënt, L. Fribourg, and J. Vacher. Control Synthesis for Stochastic Switched Systems using the Tamed Euler Method. In Proceedings of the 6th IFAC Conference on Analysis and Design of Hybrid Systems (ADHS'18), volume 51 of IFAC-PapersOnLine, pages 259--264, Oxford, UK, July 2018. Elsevier Science Publishers.
doi: 10.1016/j.ifacol.2018.08.044.
BibTex | DOI | Web page | PDF ]
[SGF18b]
A. Saoud, A. Girard, and L. Fribourg. On the Composition of Discrete and Continuous-time Assume-Guarantee Contracts for Invariance. In Proceedings of the European Control Conference (ECC'18), pages 435--440, Limassol, Cyprus, June 2018. IEEE Press.
doi: 10.23919/ECC.2018.8550622.
BibTex | DOI | Web page | PDF ]
[SGF18a]
A. Saoud, A. Girard, and L. Fribourg. Contract based Design of Symbolic Controllers for Vehicle Platooning. In Proceedings of the 21st ACM International Conference on Hybrid Systems: Computation and Control (HSCC'18), pages 277--278, Porto, Portugal, April 2018. ACM Press. Poster.
doi: 10.1145/3178126.3187001.
BibTex | DOI | PDF ]
[LFM+18]
A. Le Coënt, L. Fribourg, N. Markey, F. De Vuyst, and L. Chamoin. Compositional synthesis of state-dependent switching control. Theoretical Computer Science, 750:53--68, 2018.
doi: 10.1016/j.tcs.2018.01.021.
BibTex | DOI | Web page | PDF ]
[LACF18]
A. Le Coënt, J. Alexandre dit Sandretto, A. Chapoutot, and L. Fribourg. An improved algorithm for the control synthesis of nonlinear sampled switched systems. Formal Methods in System Design, 53(3):363--383, 2018.
doi: 10.1007/s10703-017-0305-8.
BibTex | DOI | Web page | PDF ]
[Fri17]
L. Fribourg. Euler's Method Applied to the Control of Switched Systems. In Proceedings of the 15th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'17), volume 10419 of Lecture Notes in Computer Science, pages 3--21, Berlin, Germany, September 2017. Springer.
doi: 10.1007/978-3-319-65765-3_1.
BibTex | DOI | Web page | PDF ]
[LAC+17]
A. Le Coënt, J. Alexandre dit Sandretto, A. Chapoutot, L. Fribourg, F. De Vuyst, and L. Chamoin. Distributed Control Synthesis Using Euler's Method. In Proceedings of the 11th Workshop on Reachability Problems in Computational Models (RP'17), volume 10506 of Lecture Notes in Computer Science, pages 118--131, London, UK, September 2017. Springer.
doi: 10.1007/978-3-319-67089-8_9.
BibTex | DOI | Web page | PDF ]
[LDCF17]
A. Le Coënt, F. De Vuyst, L. Chamoin, and L. Fribourg. Control Synthesis of Nonlinear Sampled Switched Systems using Euler's Method. In Proceedings of the 3rd International Workshop on Symbolic and Numerical Methods for Reachability Analysis (SNR'17), volume 247 of Electronic Proceedings in Theoretical Computer Science, pages 18--33, Uppsala, Sweden, April 2017.
doi: 10.4204/EPTCS.247.2.
BibTex | DOI | Web page | PDF ]
[LFS16]
A. Le Coënt, L. Fribourg, and R. Soulat. Compositional analysis of Boolean networks using local fixed-point iterations. In Proceedings of the 10th Workshop on Reachability Problems in Computational Models (RP'16), volume 9899 of Lecture Notes in Computer Science, pages 134--147, Aalborg, Denmark, September 2016. Springer.
doi: 10.1007/978-3-319-45994-3_10.
BibTex | DOI | Web page | PDF ]
[LFM+16]
A. Le Coënt, L. Fribourg, N. Markey, F. De Vuyst, and L. Chamoin. Distributed Synthesis of State-Dependent Switching Control. In Proceedings of the 10th Workshop on Reachability Problems in Computational Models (RP'16), volume 9899 of Lecture Notes in Computer Science, pages 119--133, Aalborg, Denmark, September 2016. Springer.
doi: 10.1007/978-3-319-45994-3_9.
BibTex | DOI | Web page | PDF ]
[LACF16]
A. Le Coënt, J. Alexandre dit Sandretto, A. Chapoutot, and L. Fribourg. Control of Nonlinear Switched Systems Based on Validated Simulation. In Proceedings of the 2nd International Workshop on Symbolic and Numerical Methods for Reachability Analysis (SNR'16), pages 1--6, Vienna, Austria, April 2016. IEEE Computer Society Press.
BibTex | Web page | PDF ]
[FGMP16]
L. Fribourg, É. Goubault, S. Mohamed, and S. Putot. A Topological Method for Finding Invariant Sets of Switched Systems. In Proceedings of the 19th ACM International Conference on Hybrid Systems: Computation and Control (HSCC'16), pages 61--70, Vienna, Austria, April 2016. ACM Press.
doi: 10.1145/2883817.2883822.
BibTex | DOI | Web page | PDF ]
[LDR+16]
A. Le Coënt, F. De Vuyst, C. Rey, L. Chamoin, and L. Fribourg. Control of mechanical systems using set-based methods. International Journal of Dynamics and Control, pages 1--17, 2016.
doi: 10.1007/s40435-016-0245-y.
BibTex | DOI | Web page | PDF ]
[FGM+15]
L. Fribourg, É. Goubault, S. Mohamed, M. Mrozek, and S. Putot. A Topological Method for Finding Invariants of Continuous Systems. In Proceedings of the 9th Workshop on Reachability Problems in Computational Models (RP'15), volume 9328 of Lecture Notes in Computer Science, pages 63--75, Warsaw, Poland, September 2015. Springer.
doi: 10.1007/978-3-319-24537-9_7.
BibTex | DOI | Web page | PDF ]
[FKM15]
L. Fribourg, U. Kühne, and N. Markey. Game-based Synthesis of Distributed Controllers for Sampled Switched Systems. In Proceedings of the 2nd International Workshop on Synthesis of Continuous Parameters (SYNCOP'15), volume 44 of Open Access Series in Informatics, pages 47--61, London, UK, April 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/OASIcs.SynCoP.2015.47.
BibTex | DOI | Web page | PDF ]
[LDR+15]
A. Le Coënt, F. De Vuyst, Ch. Rey, L. Chamoin, and L. Fribourg. Guaranteed control of switched control systems using model order reduction and state-space bisection. In Proceedings of the 2nd International Workshop on Synthesis of Continuous Parameters (SYNCOP'15), volume 44 of Open Access Series in Informatics, pages 32--46, London, UK, April 2015. Leibniz-Zentrum für Informatik.
doi: 10.4230/OASIcs.SynCoP.2015.32.
BibTex | DOI | Web page | PDF ]
[FKS14]
L. Fribourg, U. Kühne, and R. Soulat. Finite Controlled Invariants for Sampled Switched Systems. Formal Methods in System Design, 45(3):303--329, December 2014.
doi: 10.1007/s10703-014-0211-2.
BibTex | DOI | Web page | PDF ]
[AFG14]
S. Abiteboul, L. Fribourg, and J. Goubault-Larrecq. Gérard Berry : un informaticien médaille d'or du CNRS 2014. 1024 -- Bulletin de la société informatique de France, 4:139--142, October 2014.
BibTex | Web page | PDF ]
[SLS+14]
Y. Sun, G. Lipari, R. Soulat, L. Fribourg, and N. Markey. Component-Based Analysis of Hierarchical Scheduling using Linear Hybrid Automata. In Proceedings of the 20th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'14), Chongqing, China, August 2014. IEEE Computer Society Press.
doi: 10.1109/RTCSA.2014.6910502.
BibTex | DOI | Web page | PDF ]
[FFL+14]
G. Feld, L. Fribourg, D. Labrousse, B. Revol, and R. Soulat. Correct-by-design Control Synthesis for Multilevel Converters using State Space Decomposition. In Proceedings of the 2nd French-Singaporean Workshop on Formal Methods and Applications (FSFMA'14), volume 156 of Electronic Proceedings in Theoretical Computer Science, pages 5--16, Singapore, May 2014.
doi: 10.4204/EPTCS.156.5.
BibTex | DOI | Web page | PDF ]
[SLAF14]
Y. Sun, G. Lipari, É. André, and L. Fribourg. Toward Parametric Timed Interfaces for Real-Time Components. In Proceedings of the 1st International Workshop on Synthesis of Continuous Parameters (SYNCOP'14), volume 145 of Electronic Proceedings in Theoretical Computer Science, pages 49--64, Grenoble, France, April 2014.
doi: 10.4204/EPTCS.145.6.
BibTex | DOI | Web page | PDF ]
[FGM+14]
L. Fribourg, É. Goubault, S. Mohamed, S. Putot, and R. Soulat. Synthesis of robust boundary control for systems governed by semi-discrete differential equations. Research Report LSV-14-03, Laboratoire Spécification et Vérification, ENS Cachan, France, February 2014. 8 pages.
BibTex | Web page | PDF ]
[SSL+13]
Y. Sun, R. Soulat, G. Lipari, É. André, and L. Fribourg. Parametric Schedulability Analysis of Fixed Priority Real-Time Distributed Systems. In Preproceedings of the 2nd International Workshop on Formal Techniques for Safety-Critical Systems (FTSCS'13), pages 179--194, Queenstown, New Zealand, October 2013.
BibTex | Web page | PDF ]
[AFS13a]
É. André, L. Fribourg, and R. Soulat. Merge and Conquer: State Merging in Parametric Timed Automata. In Proceedings of the 11th International Symposium on Automated Technology for Verification and Analysis (ATVA'13), volume 8172 of Lecture Notes in Computer Science, pages 381--396, Hanoi, Vietnam, October 2013. Springer.
doi: 10.1007/978-3-319-02444-8_27.
BibTex | DOI | Web page | PDF ]
[FS13c]
L. Fribourg and R. Soulat. Stability Controllers for Sampled Switched Systems. In Proceedings of the 7th Workshop on Reachability Problems in Computational Models (RP'13), volume 8169 of Lecture Notes in Computer Science, pages 135--145, Uppsala, Sweden, September 2013. Springer.
doi: 10.1007/978-3-642-41036-9_13.
BibTex | DOI | Web page | PDF ]
[SHL+13]
R. Soulat, G. Hérault, D. Labrousse, B. Revol, G. Feld, S. Lefebvre, and L. Fribourg. Use of a full wave correct-by-design command to control a multilevel modular converter. In Proceedings of the 15th European Conference on Power Electronics and Applications (EPE'13), Lille, France, September 2013. IEEE Power Electronics Society.
doi: 10.1109/EPE.2013.6634448.
BibTex | DOI | Web page | PDF ]
[FS13a]
L. Fribourg and R. Soulat. Control of Switching Systems by Invariance Analysis: Application to Power Electronics. Wiley-ISTE, July 2013. 144 pages.
BibTex | Web page ]
[Fri13]
L. Fribourg. Control of Switching Systems by Invariance Analysis (Invited Talk). In Proceedings of the 1st French-Singaporean Workshop on Formal Methods and Applications (FSFMA'13), volume 31 of Open Access Series in Informatics, page 1, Singapore, July 2013. Leibniz-Zentrum für Informatik.
doi: 10.4230/OASIcs.FSFMA.2013.1.
BibTex | DOI | Web page | PDF ]
[FKS13a]
L. Fribourg, U. Kühne, and R. Soulat. Constructing Attractors of Nonlinear Dynamical Systems by State Space Decomposition. In Proceedings of the 1st French-Singaporean Workshop on Formal Methods and Applications (FSFMA'13), volume 31 of Open Access Series in Informatics, pages 53--60, Singapore, July 2013. Leibniz-Zentrum für Informatik.
doi: 10.4230/OASIcs.FSFMA.2013.53.
BibTex | DOI | Web page | PDF ]
[FS13b]
L. Fribourg and R. Soulat. Limit Cycles of Controlled Switched Systems: Existence, Stability, Sensitivity. In Proceedings of the 3rd International Workshop on New Computational Methods for Inverse Problems (NCMIP'13), volume 464 of Journal of Physics: Conference Series, Cachan, France, May 2013. IOS Press.
doi: 10.1088/1742-6596/464/1/012007.
BibTex | DOI | Web page | PDF ]
[AFS13b]
É. André, L. Fribourg, and J. Sproston. An Extension of the Inverse Method to Probabilistic Timed Automata. Formal Methods in System Design, 42(2):119--145, April 2013.
doi: 10.1007/s10703-012-0169-x.
BibTex | DOI | Web page | PDF ]
[FKS13b]
L. Fribourg, U. Kühne, and R. Soulat. Minimator: a tool for controller synthesis and computation of minimal invariant sets for linear switched systems, March 2013.
BibTex | Web page ]
[AFKS13]
É. André, L. Fribourg, U. Kühne, and R. Soulat. Imitator: a tool for efficient synthesis of parameters for timed automata, February 2013.
BibTex | Web page ]
[FK13]
L. Fribourg and U. Kühne. Parametric Verification and Test Coverage for Hybrid Automata using the Inverse Method. International Journal of Foundations of Computer Science, 24(2):233--249, February 2013.
doi: 10.1142/S0129054113400091.
BibTex | DOI | Web page | PDF ]
[FFL+12b]
G. Feld, L. Fribourg, D. Labrousse, B. Revol, and R. Soulat. Correct-by-Design Control of 5-level and 7-level Power Converters. Research Report LSV-12-25, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2012. 8 pages.
BibTex | Web page | PDF ]
[FS12]
L. Fribourg and R. Soulat. Controlled Recurrent Subspaces for Sampled Switched Linear Systems. Research Report LSV-12-24, Laboratoire Spécification et Vérification, ENS Cachan, France, December 2012. 11 pages.
BibTex | Web page | PDF ]
[FLMS12]
L. Fribourg, D. Lesens, P. Moro, and R. Soulat. Robustness Analysis for Scheduling Problems using the Inverse Method. In Proceedings of the 19th International Symposium on Temporal Representation and Reasoning (TIME'12), pages 73--80, Leicester, UK, September 2012. IEEE Computer Society Press.
doi: 10.1109/TIME.2012.10.
BibTex | DOI | Web page | PDF ]
[AFKS12]
É. André, L. Fribourg, U. Kühne, and R. Soulat. IMITATOR 2.5: A Tool for Analyzing Robustness in Scheduling Problems. In Proceedings of the 18th International Symposium on Formal Methods (FM'12), volume 7436 of Lecture Notes in Computer Science, pages 33--36, Paris, France, August 2012. Springer.
doi: 10.1007/978-3-642-32759-9_6.
BibTex | DOI | Web page | PDF ]
[FFL+12c]
G. Feld, L. Fribourg, D. Labrousse, B. Revol, and R. Soulat. Numerical simulation and physical experimentation of a 5-level and 7-level power converter under a control designed by a formal method. Research Report LSV-12-16, Laboratoire Spécification et Vérification, ENS Cachan, France, July 2012. 18 pages.
BibTex | Web page | PDF ]
[FFL+12a]
G. Feld, L. Fribourg, D. Labrousse, S. Lefebvre, B. Revol, and R. Soulat. Control of Multilevel Power Converters using Formal Methods. Research Report LSV-12-14, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2012. 14 pages.
BibTex | Web page | PDF ]
[AFS12]
É. André, L. Fribourg, and R. Soulat. Enhancing the Inverse Method with State Merging. In Proceedings of the 4th NASA Formal Methods Symposium (NFM'12), volume 7226 of Lecture Notes in Computer Science, pages 100--105, Norfolk, Virginia, USA, April 2012. Springer.
doi: 10.1007/978-3-642-28891-3_10.
BibTex | DOI | Web page | PDF ]
[Fri12]
L. Fribourg. En quoi Turing a-t-il changé ma vie ?, April 2012.
BibTex | Web page | PDF ]
[BLL+12]
G. Belkacem, D. Labrousse, S. Lefebvre, P.-Y. Joubert, U. Kühne, L. Fribourg, R. Soulat, É. Florentin, and Ch. Rey. Distributed and Coupled Electrothermal Model of Power Semiconductor Devices. In Proceedings of the 1st International Conference on Renewable Energies and VEhicular Technology (REVET'12), pages 84--89, Hammamet, Tunisia, March 2012. IEEE Power & Energy Society.
doi: 10.1109/REVET.2012.6195253.
BibTex | DOI | Web page | PDF ]
[FRS11]
L. Fribourg, B. Revol, and R. Soulat. Synthesis of Switching Rules for Ensuring Reachability Properties of Sampled Linear Systems. In Proceedings of the 13th International Workshops on Verification of Infinite State Systems (INFINITY'11), volume 73 of Electronic Proceedings in Theoretical Computer Science, pages 35--48, Taipei, Taiwan, October 2011.
doi: 10.4204/EPTCS.73.6.
BibTex | DOI | Web page | PDF ]
[FK11a]
L. Fribourg and U. Kühne. Parametric Verification and Test Coverage for Hybrid Automata Using the Inverse Method. In Proceedings of the 5th Workshop on Reachability Problems in Computational Models (RP'11), volume 6945 of Lecture Notes in Computer Science, pages 191--204, Genova, Italy, September 2011. Springer.
doi: 10.1007/978-3-642-24288-5_17.
BibTex | DOI | Web page | PDF ]
[FFK+11]
É. Florentin, L. Fribourg, U. Kühne, S. Lefebvre, and Ch. Rey. COUPLET: Coupled Electrothermal Simulation. Research Report LSV-11-18, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2011. 32 pages.
BibTex | Web page | PDF ]
[FK11b]
L. Fribourg and U. Kühne. Parametric Verification of Hybrid Automata Using the Inverse Method. Research Report LSV-11-04, Laboratoire Spécification et Vérification, ENS Cachan, France, March 2011. 25 pages.
BibTex | Web page | PDF ]
[ABB+11]
É. André, A. Bara, P. Bazargan-Sabet, R. Chevallier, D. Le Dû, E. Encrenaz, L. Fribourg, and P. Renault. Compte-rendu de fin du projet ANR VALMEM, January 2011. 14 pages.
BibTex | Web page | PDF ]
[ABB+10]
É. André, A. Bara, P. Bazargan-Sabet, R. Chevallier, D. Le Dû, E. Encrenaz, L. Fribourg, and P. Renault. Experiments of Prototype Tools on Case Studies, Comparison of Obtained Results and Conclusion. Deliverables VALMEM 4.2 and 4.3, (ANR-06-ARFU-005), December 2010. 31 pages.
BibTex | Web page | PDF ]
[AF10]
É. André and L. Fribourg. Behavioral Cartography of Timed Automata. In Proceedings of the 4th Workshop on Reachability Problems in Computational Models (RP'10), volume 6227 of Lecture Notes in Computer Science, pages 76--90, Brno, Czech Republic, August 2010. Springer.
doi: 10.1007/978-3-642-15349-5_5.
BibTex | DOI | Web page | PDF ]
[AF09]
É. André and L. Fribourg. An Inverse Method for Policy-Iteration Based Algorithms. In Proceedings of the 11th International Workshops on Verification of Infinite State Systems (INFINITY'09), volume 10 of Electronic Proceedings in Theoretical Computer Science, pages 44--61, Bologna, Italy, November 2009.
doi: 10.4204/EPTCS.10.4.
BibTex | DOI | Web page | PDF ]
[ACD+09]
É. André, Th. Chatain, O. De Smet, L. Fribourg, and S. Ruel. Synthèse de contraintes temporisées pour une architecture d'automatisation en réseau. In Actes du 7ème Colloque sur la Modélisation des Systèmes Réactifs (MSR'09), volume 43 of Journal Européen des Systèmes Automatisés, pages 1049--1064, Nantes, France, November 2009. Hermès.
BibTex | Web page | PDF ]
[ACEF09]
É. André, Th. Chatain, E. Encrenaz, and L. Fribourg. An Inverse Method for Parametric Timed Automata. International Journal of Foundations of Computer Science, 20(5):819--836, October 2009.
doi: 10.1142/S0129054109006905.
BibTex | DOI | Web page | PDF ]
[AFS09]
É. André, L. Fribourg, and J. Sproston. An Extension of the Inverse Method to Probabilistic Timed Automata. In Proceedings of the 9th International Workshop on Automated Verification of Critical Systems (AVoCS'09), volume 23 of Electronic Communications of the EASST, Swansea, UK, September 2009. European Association of Software Science and Technology.
BibTex | Web page | PDF ]
[AEF09]
É. André, E. Encrenaz, and L. Fribourg. Synthesizing Parametric Constraints on Various Case Studies Using IMITATOR. Research Report LSV-09-13, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2009. 18 pages.
BibTex | Web page | PDF ]
[CEFX09]
R. Chevallier, E. Encrenaz-Tiphène, L. Fribourg, and W. Xu. Timed Verification of the Generic Architecture of a Memory Circuit Using Parametric Timed Automata. Formal Methods in System Design, 34(1):59--81, February 2009.
doi: 10.1007/s10703-008-0061-x.
BibTex | DOI | Web page | PS | PDF ]
[ACEF08]
É. André, Th. Chatain, E. Encrenaz, and L. Fribourg. An Inverse Method for Parametric Timed Automata. In Proceedings of the 2nd Workshop on Reachability Problems in Computational Models (RP'08), volume 223 of Electronic Notes in Theoretical Computer Science, pages 29--46, Liverpool, UK, December 2008. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2008.12.029.
BibTex | DOI | Web page | PDF ]
[EF08]
E. Encrenaz and L. Fribourg. Time Separation of Events: An Inverse Method. In Proceedings of the LIX Colloquium on Emerging Trends in Concurrency Theory (LIX'06), volume 209 of Electronic Notes in Theoretical Computer Science, pages 135--148, Palaiseau, France, April 2008. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2008.04.008.
BibTex | DOI | Web page | PDF ]
[Fri07]
L. Fribourg. Probabilistic Self-Stabilizing Algorithms, Markov Chains and Markov Decision Processes. Course notes, Master Parisien de Recherche en Informatique, Paris, France, October-November 2007.
BibTex | Web page | PDF ]
[CDFP07]
N. Chamseddine, M. Duflot, L. Fribourg, and C. Picaronny. Determinate Probabilistic Timed Automata as Markov Chains with Parametric Costs. Research Report LSV-07-21, Laboratoire Spécification et Vérification, ENS Cachan, France, May 2007. 17 pages.
BibTex | Web page | PDF ]
[CEFX06b]
R. Chevallier, E. Encrenaz-Tiphène, L. Fribourg, and W. Xu. Verification of the Generic Architecture of a Memory Circuit Using Parametric Timed Automata. In Proceedings of the 4th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'06), volume 4202 of Lecture Notes in Computer Science, pages 113--127, Paris, France, September 2006. Springer.
doi: 10.1007/11867340_9.
BibTex | DOI | Web page | PS | PDF ]
[CEFX06a]
R. Chevallier, E. Encrenaz-Tiphène, L. Fribourg, and W. Xu. Timing analysis of an embedded memory: SPSMALL. WSEAS Transactions on Circuits and Systems, 5(7):973--978, July 2006.
BibTex | Web page | PDF ]
[FPP06]
L. Fribourg, C. Picaronny, and S. Pinot. Manipulation de backoff dans CSMA/CA. Contract Report (Lot 4.2 fourniture 6), projet RNTL Averroes, March 2006. 20 pages.
BibTex | Web page | PDF ]
[FMP06]
L. Fribourg, S. Messika, and C. Picaronny. Coupling and Self-Stabilization. Distributed Computing, 18(3):221--232, February 2006.
doi: 10.1007/s00446-005-0142-7.
BibTex | DOI | Web page | PS | PDF ]
[FM05]
L. Fribourg and S. Messika. Brief Announcement: Coupling for Markov Decision Processes --- Application to Self-Stabilization with Arbitrary Schedulers. In Proceedings of the Twenty-Fourth Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC'05), page 322, Las Vegas, Nevada, USA, July 2005. ACM Press.
doi: 10.1145/1073814.1073875.
BibTex | DOI | Web page | PS | PDF ]
[DFH+05]
M. Duflot, L. Fribourg, Th. Hérault, R. Lassaigne, F. Magniette, S. Messika, S. Peyronnet, and C. Picaronny. Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC. In Proceedings of the 4th International Workshop on Automated Verification of Critical Systems (AVoCS'04), volume 128 of Electronic Notes in Theoretical Computer Science, pages 195--214, London, UK, May 2005. Elsevier Science Publishers.
doi: 10.1016/j.entcs.2005.04.012.
BibTex | DOI | Web page | PDF ]
[FMP04a]
L. Fribourg, S. Messika, and C. Picaronny. Coupling and Self-Stabilization. In Proceedings of the 18th International Symposium on Distributed Computing (DISC'04), volume 3274 of Lecture Notes in Computer Science, pages 201--215, Amsterdam, The Netherlands, October 2004. Springer.
BibTex | Web page | PDF ]
[DFH+04]
M. Duflot, L. Fribourg, Th. Hérault, R. Lassaigne, F. Magniette, S. Messika, S. Peyronnet, and C. Picaronny. Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC. Contract Report (Lot 4.2 fourniture 2), projet RNTL Averroes, June 2004. 22 pages.
BibTex | Web page | PS ]
[FMP04c]
L. Fribourg, S. Messika, and C. Picaronny. Parametric and Probabilistic Verification of Nicollin-Sifakis-Yovine's Model of the CSMA/CD Protocol. Contract Report (Lot 4.2 fourniture 3), projet RNTL Averroes, June 2004. 17 pages.
BibTex | Web page | PS ]
[FMP04b]
L. Fribourg, S. Messika, and C. Picaronny. Mixing Time of the Asymmetric Simple Exclusion Problem on a Ring with Two Particles. Research Report LSV-04-12, Laboratoire Spécification et Vérification, ENS Cachan, France, June 2004. 15 pages.
BibTex | Web page | PS ]
[DFP04]
M. Duflot, L. Fribourg, and C. Picaronny. Randomized Dining Philosophers Without Fairness Assumption. Distributed Computing, 17(1):65--76, February 2004.
doi: 10.1007/s00446-003-0102-z.
BibTex | DOI | Web page | PS ]
[FMP03b]
L. Fribourg, S. Messika, and C. Picaronny. Traces of Randomized Distributed Algorithms As Markov Fields. Application to Rapid Mixing. Research Report LSV-03-10, Laboratoire Spécification et Vérification, ENS Cachan, France, July 2003. 19 pages.
BibTex | Web page | PS ]
[FMP03a]
L. Fribourg, S. Messika, and C. Picaronny. On the Absence of Phase Transition in Randomized Distributed Algorithms. Research Report LSV-03-7, Laboratoire Spécification et Vérification, ENS Cachan, France, April 2003. 17 pages.
BibTex | Web page | PS ]
[BFKM03]
B. Bérard, L. Fribourg, F. Klay, and J.-F. Monin. A Compared Study of Two Correctness Proofs for the Standardized Algorithm of ABR Conformance. Formal Methods in System Design, 22(1):59--86, January 2003.
doi: 10.1023/A:1021704214464.
BibTex | DOI | Web page | PS ]
[FMP02]
L. Fribourg, S. Messika, and C. Picaronny. Traces of Randomized Distributed Algorithms as Gibbs Fields. Research Report LSV-02-12, Laboratoire Spécification et Vérification, ENS Cachan, France, September 2002. 16 pages.
BibTex | Web page | PS ]
[DFP02]
M. Duflot, L. Fribourg, and C. Picaronny. Randomized Dining Philosophers without Fairness Assumption. In Proceedings of the 2nd IFIP International Conference on Theoretical Computer Science (IFIP TCS'02), volume 223 of IFIP Conference Proceedings, pages 169--180, Montréal, Québec, Canada, August 2002. Kluwer Academic Publishers.
BibTex | Web page | PS ]
[DFP01]
M. Duflot, L. Fribourg, and C. Picaronny. Randomized Finite-State Distributed Algorithms as Markov Chains. In Proceedings of the 15th International Symposium on Distributed Computing (DISC'01), volume 2180 of Lecture Notes in Computer Science, pages 240--254, Lisbon, Portugal, October 2001. Springer.
BibTex | Web page | PS ]
[DFN01]
M. Duflot, L. Fribourg, and U. Nilsson. Unavoidable Configurations of Parameterized Rings of Processes. In Proceedings of the 12th International Conference on Concurrency Theory (CONCUR'01), volume 2154 of Lecture Notes in Computer Science, pages 472--486, Aalborg, Denmark, August 2001. Springer.
BibTex | Web page | PS ]
[BBFM01]
J. Beauquier, B. Bérard, L. Fribourg, and F. Magniette. Proving Convergence of Self-Stabilizing Systems Using First-Order Rewriting and Regular Languages. Distributed Computing, 14(2):83--95, 2001.
doi: 10.1007/PL00008931.
BibTex | DOI | Web page | PS ]
[NDF00]
U. Nilsson, M. Duflot, and L. Fribourg. STABILO, a tool computing inevitable configurations in distributed protocols, November 2000. See description in [DFN01]. Written in PROLOG (about 500 lines on top of Gertjan van Noord's finite automata package).
BibTex ]
[Fri00c]
L. Fribourg. Petri Nets, Flat Languages and Linear Arithmetic. In Proceedings of the 9th International Workshop on Functional and Logic Programming (WFLP 2000), pages 344--365, Benicassim, Spain, September 2000. Universidad Politécnica de Valencia, Spain. Invited lecture.
BibTex | Web page | PS ]
[BCF+00]
B. Bérard, P. Castéran, E. Fleury, L. Fribourg, J.-F. Monin, Ch. Paulin, A. Petit, and D. Rouillard. Document de spécification du modèle commun. Fourniture 1.1 du projet RNRT Calife, April 2000.
BibTex ]
[Fri00b]
L. Fribourg. Document de synthèse sur les techniques d'abstraction. Fourniture 4.1 du projet RNRT Calife, January 2000.
BibTex ]
[Fri00a]
L. Fribourg. Constraint Logic Programming Applied to Model Checking. In Proceedings of the 9th International Workshop on Logic Program Synthesis and Transformation (LOPSTR'99), volume 1817 of Lecture Notes in Computer Science, pages 31--42, Venezia, Italy, 2000. Springer. Invited tutorial.
BibTex | Web page | PS ]
[BBF99]
J. Beauquier, B. Bérard, and L. Fribourg. A New Rewrite Method for Proving Convergence of Self-Stabilizing Systems. In Proceedings of the 13th International Symposium on Distributed Computing (DISC'99), volume 1693 of Lecture Notes in Computer Science, pages 240--253, Bratislava, Slovak republic, September 1999. Springer.
BibTex | Web page | PS ]
[BF99b]
B. Bérard and L. Fribourg. Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic. In Proceedings of the 10th International Conference on Concurrency Theory (CONCUR'99), volume 1664 of Lecture Notes in Computer Science, pages 178--193, Eindhoven, The Netherlands, August 1999. Springer.
BibTex | Web page | PS ]
[BF99a]
B. Bérard and L. Fribourg. Automated Verification of a Parametric Real-Time Program: The ABR Conformance Protocol. In Proceedings of the 11th International Conference on Computer Aided Verification (CAV'99), volume 1633 of Lecture Notes in Computer Science, pages 96--107, Trento, Italy, July 1999. Springer.
BibTex | Web page | PS ]
[VF98]
M. Veloso Peixoto and L. Fribourg. Unfolding Parametric Automata. In Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (LATIN'98), volume 1380 of Lecture Notes in Computer Science, pages 88--101, Campinas, Brasil, April 1998. Springer.
BibTex ]
[Fri98]
L. Fribourg. A Closed-Form Evaluation for Extended Timed Automata. Research Report LSV-98-2, Laboratoire Spécification et Vérification, ENS Cachan, France, March 1998.
BibTex | Web page | PS ]
[FO97b]
L. Fribourg and H. Olsén. Proving Safety Properties of Infinite State Systems by Compilation into Presburger Arithmetic. In Proceedings of the 8th International Conference on Concurrency Theory (CONCUR'97), volume 1243 of Lecture Notes in Computer Science, pages 213--227, Warsaw, Poland, July 1997. Springer.
BibTex | Web page | PS | PDF ]
[FO97c]
L. Fribourg and H. Olsén. Reachability Sets of Parametrized Rings As Regular Languages. In Proceedings of the 2nd International Workshop on Verification of Infinite State Systems (INFINITY'97), volume 9 of Electronic Notes in Theoretical Computer Science, page 40, Bologna, Italy, July 1997. Elsevier Science Publishers.
BibTex | Web page | PS | PDF ]
[FO97d]
L. Fribourg and H. Olsén. Reductions of Petri Nets and Unfolding of Propositional Logic Programs. In Proceedings of the 6th International Workshop on Logic Program Synthesis and Transformation (LOPSTR'96), volume 1207 of Lecture Notes in Computer Science, pages 187--203, Stockholm, Sweden, 1997. Springer.
BibTex ]
[FR97]
L. Fribourg and J. Richardson. Symbolic Verification with Gap-Order Constraints. In Proceedings of the 6th International Workshop on Logic Program Synthesis and Transformation (LOPSTR'96), volume 1207 of Lecture Notes in Computer Science, pages 20--37, Stockholm, Sweden, 1997. Springer.
BibTex | Web page | PS ]
[FO97a]
L. Fribourg and H. Olsén. A Decompositional Approach for Computing Least Fixed-Points of Datalog Programs with Z-Counters. Constraints, 2(3-4):305--335, 1997.
BibTex | Web page | PS | PDF ]
[FV94b]
L. Fribourg and M. Veloso Peixoto. Bottom-up Evaluation of Datalog Programs with Arithmetical Constraints. In Proceedings of the 12th International Conference on Automated Deduction (CADE'94), volume 814 of Lecture Notes in Computer Science, pages 311--325, Nancy, France, June 1994. Springer-Verlag.
BibTex ]
[FV94a]
L. Fribourg and M. Veloso Peixoto. Automates Concurrents à Contraintes. Technique et Science Informatiques, 13(6):837--866, 1994.
BibTex | Web page | PS ]
[Fri93]
L. Fribourg. Extracting Logic Programs from Proofs that Use Extended Prolog Execution with Induction. In Constructing Logic Programs, chapter 2, pages 39--66. John Wiley & Sons, Ltd., March 1993.
BibTex | Web page | PS ]
[CF93]
P. H. Cheong and L. Fribourg. Implementation of Narrowing: The Prolog-Based Approach. In Current Trends in Logic Programming Languages: Integration with Functions, Constraints and Objects, chapter 1, pages 1--20. MIT Press, March 1993.
BibTex | Web page | PS ]
[FO93]
L. Fribourg and H. Olsén. A Unifying View of Structural Induction and Computation Induction for Logic Programs. In Proceedings of the 2nd International Workshop on Logic Program Synthesis and Transformation (LOPSTR'92), pages 46--60, Manchester, UK, 1993. Springer-Verlag.
BibTex | Web page | PS ]
[Fri92]
L. Fribourg. Mixing List Recursion and Arithmetic. In Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science (LICS'92), pages 419--429, Santa Cruz, California, USA, June 1992. IEEE Computer Society Press.
BibTex | Web page | PS ]
[Fri91]
L. Fribourg. Automatic Generation of Simplification Lemmas for Inductive Proofs. In Proceedings of the 8th International Conference on Logic Programming (ICLP'91), pages 103--116, San Diego, California, USA, October 1991. MIT Press.
BibTex ]
[CF91]
P. H. Cheong and L. Fribourg. Efficient Integration of Simplification into Prolog. In Proceedings of the 3rd International Symposium on Programming Language Implementation and Logic Programming (PLILP'91), volume 528 of Lecture Notes in Computer Science, pages 359--370, Passau, Germany, August 1991. Springer-Verlag.
BibTex ]
[Fri90a]
L. Fribourg. Contribution à la vérification des programmes logiques. Mémoire d'habilitation, Université Paris 7, Paris, France, October 1990.
BibTex ]
[Fri90c]
L. Fribourg. A New Presburger Arithmetic Decision Procedure Based on Extended Prolog Execution. In Proceedings of the 2nd International Workshop on Programming Language Implementation and Logic Programming (PLILP'90), volume 456 of Lecture Notes in Computer Science, pages 174--188, Linköping, Sweden, August 1990. Springer-Verlag.
BibTex ]
[Fri90b]
L. Fribourg. Extracting Logic Programs from Proofs that use Extended Prolog Execution and Induction. In Proceedings of the 7th International Conference on Logic Programming (ICLP'90), pages 685--699, Jerusalem, Israel, June 1990. MIT Press.
BibTex ]
[Fri89b]
L. Fribourg. A Strong Restriction of the Inductive Completion Procedure. Journal of Symbolic Computation, 8(3):253--276, September 1989.
BibTex ]
[Fri89a]
L. Fribourg. Proofs by Combinatory Induction on Recursively Reducible Expressions. In Resolution of Equations in Algebraic Structures, chapter 5, pages 117--141. Academic Press, March 1989.
BibTex ]
[Fri88b]
L. Fribourg. Functional Extensions to Prolog: Are They Needed? In Proceedings of the 1st International Workshop on Algebraic and Logic Programming (ALP'88), volume 343 of Lecture Notes in Computer Science, pages 21--29, Gaussig, German Democratic Republic, November 1988. Springer-Verlag. Invited paper.
BibTex ]
[Fri88a]
L. Fribourg. Equivalence-Preserving Transformations of Inductive Properties of Prolog Programs. In Proceedings of the 5th International Conference and Symposium on Logic Programming (ICLP/SLP'88), pages 893--908, Seattle, Washington, USA, August 1988. MIT Press.
BibTex ]
[BCFG86]
L. Bougé, N. Choquet, L. Fribourg, and M.-C. Gaudel. Test Sets Generation From Algebraic Specifications Using Logic Programming. Journal of Systems and Software, 6(4):343--360, November 1986.
BibTex ]
[Fri86]
L. Fribourg. A Strong Restriction of the Inductive Completion Procedure. In Proceedings of the 13th International Colloquium on Automata, Languages and Programming (ICALP'86), volume 226 of Lecture Notes in Computer Science, pages 105--115, Rennes, France, July 1986. Springer-Verlag.
BibTex ]
[Fri85a]
L. Fribourg. SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting. In Proceedings of the 2nd IEEE Symposium on Logic Programming (SLP'85), pages 172--184, Boston, Massachusetts, USA, July 1985. IEEE Computer Society Press.
BibTex ]
[CFM85]
N. Choquet, L. Fribourg, and A. Mauboussin. Runnable Protocol Specifications Using the Logic Interpreter SLOG. In Proceedings of the IFIP WG6.1 5th International Conference on Protocol Specification, Testing and Verification (PSTV'85), pages 149--168, Toulouse-Moissac, France, June 1985. North-Holland.
BibTex ]
[BCFG85]
L. Bougé, N. Choquet, L. Fribourg, and M.-C. Gaudel. Application of Prolog to Test Sets Generation from Algebraic Specifications. In Proceedings of the 1st International Joint Conference on Theory and Practice of Software Development (TAPSOFT'89), Volume 2: Colloquium on Software Engineering (CSE), volume 186 of Lecture Notes in Computer Science, pages 261--275, Berlin, Germany, March 1985. Springer-Verlag.
BibTex ]
[Fri85b]
L. Fribourg. A Superposition Oriented Theorem Prover. Theoretical Computer Science, 35(2-3):129--164, February 1985.
BibTex ]
[Fri84c]
L. Fribourg. Oriented Equational Clauses as a Programming Language. Journal of Logic Programming, 1(2):165--177, August 1984.
BibTex ]
[Fri84b]
L. Fribourg. Oriented Equational Clauses as a Programming Language. In Proceedings of the 11th International Colloquium on Automata, Languages and Programming (ICALP'84), volume 172 of Lecture Notes in Computer Science, pages 162--173, Antwerp, Belgium, July 1984. Springer-Verlag.
BibTex ]
[Fri84a]
L. Fribourg. A Narrowing Procedure for Theories with Constructors. In Proceedings of the 7th International Conference on Automated Deduction (CADE'84), volume 170 of Lecture Notes in Computer Science, pages 259--281, Napa, California, USA, May 1984. Springer-Verlag.
BibTex ]
[Fri83]
L. Fribourg. A Superposition Oriented Theorem Prover. In Proceedings of the 8th International Joint Conference on Artificial Intelligence (IJCAI'83), pages 923--925, Karlsruhe, West Germany, August 1983. William Kaufmann.
BibTex ]
[Fri82]
L. Fribourg. Démonstration automatique: réfutation par superposition de clauses équationnelles. Thèse de doctorat, Université Paris 7, Paris, France, September 1982.
BibTex ]

This file was generated by bibtex2html 1.98.

About LSV