Number of documents

25

Matthieu Perrin


Matthieu Perrin graduated at ENS Cachan-Bretagne in Rennes in 2012. He is currently a PhD student in the GDD and AeLoS teams at LINA (Laboratoire d'Informatique de Nantes Atlantique) at University of Nantes under the supervision of Claude Jard and Achour Mostéfaoui. His scientific interests focus on the modelisation of distributed systems, and in particular of weakly consistent shared objects.


Journal articles3 documents

  • Matthieu Perrin, Achour Mostefaoui, Michel Raynal. Extending the Causal Consistency Condition to any Object Defined by a Sequential Specification. Bulletin- European Association for Theoretical Computer Science, European Association for Theoretical Computer Science; 1999, 2018, pp.1-12. ⟨hal-02053316⟩
  • Achour Mostefaoui, Matthieu Perrin, Michel Raynal. A Simple Object that Spans the Whole Consensus Hierarchy. Parallel Processing Letters, World Scientific Publishing, 2018, 28 (02), pp.1850006. ⟨10.1142/S0129626418500068⟩. ⟨hal-02053504⟩
  • Marin Bertier, Matthieu Perrin, Cédric Tedeschi. On the Complexity of Concurrent Multiset Rewriting. International Journal of Foundations of Computer Science, World Scientific Publishing, 2016, 27 (1), ⟨10.1142/S0129054116500052⟩. ⟨hal-01326849⟩

Conference papers11 documents

  • Benjamin Moreau, Patricia Serrano-Alvarado, Matthieu Perrin, Emmanuel Desmontils. Modelling the Compatibility of Licenses. 16th Extended Semantic Web Conference (ESWC2019), Jun 2019, Portorož, Slovenia. ⟨hal-02069076⟩
  • Benjamin Moreau, Patricia Serrano-Alvarado, Matthieu Perrin, Emmanuel Desmontils. A License-Based Search Engine. 16th Extended Semantic Web Conference (ESWC2019), Jun 2019, Portoroz, Slovenia. ⟨hal-02097027⟩
  • Damien Imbs, Achour Mostefaoui, Matthieu Perrin, Michel Raynal. Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits. ICDCN '18 - 19th International Conference on Distributed Computing and Networking, Jan 2018, Varanasi, India. pp.1-10, ⟨10.1145/3154273.3154296⟩. ⟨hal-02053261⟩
  • Hagit Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin. Separating Lock-Freedom from Wait-Freedom. The 37th ACM Symposium on Principles of Distributed Computing, Jul 2018, Egham, United Kingdom. pp.41-50. ⟨hal-02053248⟩
  • Damien Imbs, Achour Mostefaoui, Matthieu Perrin, Michel Raynal. Which Broadcast Abstraction Captures k-Set Agreement?. 31st International Symposium on Distributed Computing (DISC 2017), Oct 2017, Vienna, Austria. pp.1-16, ⟨10.4230/LIPIcs.DISC.2017.27⟩. ⟨hal-01787801⟩
  • Matthieu Perrin, Matoula Petrolia, Achour Mostefaoui, Claude Jard. On Composition and Implementation of Sequential Consistency. 30th International Symposium on Distributed Computing, Sep 2016, Paris, France. ⟨hal-01347069v2⟩
  • Davide Frey, Achour Mostefaoui, Matthieu Perrin, Pierre-Louis Roman, François Taïani. Speed for the elite, consistency for the masses: differentiating eventual consistency in large-scale distributed systems. Proceedings of the 2016 IEEE 35th Symposium on Reliable Distributed Systems (SRDS 2016), Sep 2016, Budapest, Hungary. pp.197-206, ⟨10.1109/SRDS.2016.032⟩. ⟨hal-01344138⟩
  • Matthieu Perrin, Achour Mostefaoui, Claude Jard. Causal Consistency: Beyond Memory. 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Mar 2016, Barcelone, Spain. ⟨10.1145/2851141.2851170⟩. ⟨hal-01286755⟩
  • Matthieu Perrin, Claude Jard, Achour Mostefaoui. Tracking Causal Dependencies in Web Services Orchestrations Defined in ORC. NETYS - 3rd International Conference on NETwork sYStems, May 2015, Agadir, Morocco. ⟨hal-01152761⟩
  • Matthieu Perrin, Achour Mostefaoui, Claude Jard. Update Consistency for Wait-free Concurrent Objects. IPDPS - IEEE International Parallel & Distributed Processing Symposium, May 2015, Hyderabad, India. ⟨hal-01101657⟩
  • Matthieu Perrin, Achour Mostefaoui, Claude Jard. Brief Announcement: Update Consistency in Partitionable Systems. DISC14 - 28th International Symposium on Distributed Computing, Oct 2014, Austin, United States. ⟨hal-01079112⟩

Preprints, Working Papers, ...1 document

  • Grégoire Bonin, Achour Mostefaoui, Matthieu Perrin. Does the operational model capture partition tolerance in distributed systems?: Separating the operational model and the wait-free model. 2019. ⟨hal-02055328⟩

Reports9 documents

  • Damien Imbs, Achour Mostefaoui, Matthieu Perrin, Michel Raynal. Another Look at the Implementation of Read/write Registers in Crash-prone Asynchronous Message-Passing Systems (Extended Version). [Research Report] IRISA, Inria Rennes; LS2N-University of Nantes; Technion - Israel Institute of Technology. 2017. ⟨hal-01476201⟩
  • Damien Imbs, Achour Mostefaoui, Matthieu Perrin, Michel Raynal. Set-Constrained Delivery Broadcast: Definition, Abstraction Power, and Computability Limits. [Research Report] LIF, Université Aix-Marseille; LINA-University of Nantes; IMDEA Software Institute; Institut Universitaire de France; IRISA, Université de Rennes. 2017. ⟨hal-01540010⟩
  • Davide Frey, Achour Mostefaoui, Matthieu Perrin, Anne-Marie Kermarrec, Christopher Maddock, et al.. D.1.3 – Protocols for emergent localities. [Technical Report] D1.3, IRISA; LINA-University of Nantes; Inria Rennes Bretagne Atlantique; Lancaster University. 2016. ⟨hal-01343348⟩
  • Davide Frey, Achour Mostefaoui, Matthieu Perrin, François Taïani. D.1.1 – Survey on Weak Consistency Approaches for Large-Scale Systems. [Technical Report] D1.1, LINA-University of Nantes; IRISA. 2015. ⟨hal-01174203⟩
  • Davide Frey, Roy Friedman, Achour Mostefaoui, Matthieu Perrin, Michel Raynal, et al.. D.1.2 – Modular quasi-causal data structures. [Research Report] D1.2, LINA-University of Nantes; IRISA. 2015. ⟨hal-01223119⟩
  • Matthieu Perrin, Claude Jard, Achour Mostefaoui. Proof of the Instrumented Semantics for Orc. [Research Report] LINA-University of Nantes. 2015. ⟨hal-01101340v2⟩
  • Matthieu Perrin, Matoula Petrolia, Achour Mostefaoui, Claude Jard. Consistent Shared Data Types: Beyond Memory. [Research Report] Université de Nantes. 2014. ⟨hal-01052437⟩
  • Marin Bertier, Matthieu Perrin, Cédric Tedeschi. On the Complexity of Concurrent Multiset Rewriting. [Research Report] RR-8408, INRIA. 2013, pp.17. ⟨hal-00912554⟩
  • Perrin Matthieu. Compression de séquences d'A.D.N. à base de grammaires minimales. [Stage] 2010, pp.14. ⟨inria-00536655⟩

Theses1 document

  • Matthieu Perrin. Spécification des objets partagés dans les systèmes répartis sans-attente. Calcul parallèle, distribué et partagé [cs.DC]. Université de Nantes (Unam), 2016. Français. ⟨tel-01390700⟩