Publications : Marie FORTIN

[For20]

M. Fortin. Expressivity of first-order logic, star-free propositional dynamic logic and communicating automata. Thèse de doctorat, École Normale Supérieure Paris-Saclay, France, November 2020.
[ BibTex | Web page | PDF ]

[BFG20]

B. Bollig, M. Fortin, and P. Gastin. Communicating Finite-State Machines, First-Order Logic, and Star-Free Propositional Dynamic Logic. Journal of Computer and System Sciences, pages 22--53, 2020.
doi: 10.1016/j.jcss.2020.06.006.
[ BibTex | DOI | PDF ]

[For19]

M. Fortin. FO = FO3 for linear orders with monotone binary relations. In Proceedings of the 46th International Colloquium on Automata, Languages and Programming (ICALP'19), volume 132 of Leibniz International Proceedings in Informatics, pages 116:1--116:13, Patras, Greece, July 2019. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.ICALP.2019.116.
[ BibTex | DOI | Web page | PDF ]

[BFG18b]

B. Bollig, M. Fortin, and P. Gastin. It Is Easy to Be Wise After the Event: Communicating Finite-State Machines Capture First-Order Logic with ”Happened Before”. In Proceedings of the 29th International Conference on Concurrency Theory (CONCUR'18), volume 118 of Leibniz International Proceedings in Informatics, pages 7:1--7:17, Beijing, China, September 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.CONCUR.2018.7.
[ BibTex | DOI | Web page | PDF ]

[BFG18a]

B. Bollig, M. Fortin, and P. Gastin. Communicating Finite-State Machines and Two-Variable Logic. In Proceedings of the 35th Annual Symposium on Theoretical Aspects of Computer Science (STACS'18), volume 96 of Leibniz International Proceedings in Informatics, pages 17:1--17:14, Caen, France, February 2018. Leibniz-Zentrum für Informatik.
doi: 10.4230/LIPIcs.STACS.2018.17.
[ BibTex | DOI | Web page | PDF ]

[FMW17]

M. Fortin, A. Muscholl, and I. Walukiewicz. Model-checking linear-time properties of parametrized asynchronous shared-memory pushdown systems. In Proceedings of the 29th International Conference on Computer Aided Verification (CAV'17), volume 10427 of Lecture Notes in Computer Science, pages 155--175, Heidelberg, Germany, July 2017. Springer.
doi: 10.1007/978-3-319-63390-9_9.
[ BibTex | DOI | Web page ]

[FG16]

M. Fortin and P. Gastin. Verification of parameterized communicating automata via split-width. In Proceedings of the 19th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'16), volume 9634 of Lecture Notes in Computer Science, pages 197--213, Eindhoven, The Netherlands, April 2016. Springer.
doi: 10.1007/978-3-662-49630-5_12.
[ BibTex | DOI | Web page | PDF ]

[For15]

M. Fortin. Verification of distributed systems with parameterized network topology. Rapport de Master, Master Parisien de Recherche en Informatique, Paris, France, September 2015.
[ BibTex ]

This file was generated by bibtex2html 1.98.