A Formal Approach to prevent Attacks on Mobile Agent Systems. - Monia Loulou; Mohamed Tounsi 001; Ahmed Hadj Kacem; Mohamed Jmaiel (SECURWARE, 2007)

Proving Distributed Algorithms by Combining Refinement and Local Computations. - Mohamed Tounsi 001; Mohamed Mosbah 001; Dominique Méry (Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010)

Refinement-Based Verification of Local Synchronization Algorithms. - Dominique Méry; Mohamed Mosbah 001; Mohamed Tounsi 001 (FM, 2011)

Towards Proved Distributed Algorithms through Refinement, Composition and Local Computations. - Vincent Filou; Mohamed Mosbah 001; Mohamed Tounsi 001 (WETICE, 2013)

Enhancing Proofs of Local Computations through Formal Event-B Modularization. - Maha Boussabbeh; Mohamed Tounsi 001; Ahmed Hadj Kacem; Mohamed Mosbah 001 (WETICE, 2014)

A formal pattern for dynamic networks through evolving graphs. - Faten Fakhfakh; Mohamed Tounsi 001; Ahmed Hadj Kacem; Mohamed Mosbah 001 (AICCSA, 2015)

Towards a Formal Model for Dynamic Networks Through Refinement and Evolving Graphs. - Faten Fakhfakh; Mohamed Tounsi 001; Ahmed Hadj Kacem; Mohamed Mosbah 001 (SNPD (revised selected papers), 2015)

A Fault-Tolerant Handshake Algorithm for Local Computations. - Allyx Fontaine; Mohamed Mosbah 001; Mohamed Tounsi 001; Akka Zemmari (AINA Workshops, 2016)

Formal Proofs of Termination Detection for Local Computations by Refinement-Based Compositions. - Maha Boussabbeh; Mohamed Tounsi 001; Mohamed Mosbah 001; Ahmed Hadj Kacem (ABZ, 2016)

Towards a General Framework for Ensuring and Reusing Proofs of Termination Detection in Distributed Computing. - Maha Boussabbeh; Mohamed Tounsi 001; Ahmed Hadj Kacem; Mohamed Mosbah 001 (PDP, 2016)

A Refinement-Based Approach for Proving Distributed Algorithms on Evolving Graphs. - Faten Fakhfakh; Mohamed Tounsi 001; Ahmed Hadj Kacem; Mohamed Mosbah 001 (WETICE, 2016)

From Event-B specifications to programs for distributed algorithms. - Mohamed Tounsi 001; Mohamed Mosbah 001; Dominique Méry (Int. J. Auton. Adapt. Commun. Syst., 2016)

A correct-by-construction approach for proving distributed algorithms in spanning trees. - Faten Fakhfakh; Mohamed Tounsi 001; Mohamed Mosbah 001; Dominique Méry; Ahmed Hadj Kacem (ICIS, 2017)

Algorithms for Finding Maximal and Maximum Cliques: A Survey. - Faten Fakhfakh; Mohamed Tounsi 001; Mohamed Mosbah 001; Ahmed Hadj Kacem (ISDA, 2017)

Formal Development of Distributed Enumeration Algorithms By Refinement-Based Techniques. - Maha Boussabbeh; Mohamed Tounsi 001; Ahmed Hadj Kacem; Mohamed Mosbah 001 (SCSS, 2017)

Proving Distributed Coloring of Forests in Dynamic Networks. - Faten Fakhfakh; Mohamed Tounsi 001; Mohamed Mosbah 001; Dominique Méry; Ahmed Hadj Kacem (Computación y Sistemas, 2017)

Distributed Computations in Wireless Sensor Networks by Local Interactions. - Emna Taktak; Mohamed Tounsi 001; Mohamed Mosbah 001; Ahmed Hadj Kacem (ADHOC-NOW, 2018)

Formal Verification Approaches for Distributed Algorithms: A Systematic Literature Review. - Faten Fakhfakh; Mohamed Tounsi 001; Mohamed Mosbah 001; Ahmed Hadj Kacem (KES, 2018)

A Formal Approach for Distributed Computing of Maximal Cliques in Dynamic Networks. - Faten Fakhfakh; Mohamed Tounsi 001; Mohamed Mosbah 001; Ahmed Hadj Kacem (SEKE, 2018)

Proving Distributed Algorithms for Wireless Sensor Networks by Combining Refinement and Local Computations. - Emna Taktak; Mohamed Tounsi 001; Mohamed Mosbah 001; Ahmed Hadj Kacem (WETICE, 2018)

Energy Efficient Handshake Algorithm for Wireless Sensor Networks. - Emna Taktak; Mohamed Tounsi 001; Mohamed Mosbah 001; Ahmed Hadj Kacem (DiCES-N@ICTAC, 2019)

An Evaluative Review of the Formal Verification for VANET Protocols. - Faten Fakhfakh; Mohamed Tounsi 001; Mohamed Mosbah 001 (IWCMC, 2019)

A Comprehensive Survey on Broadcasting Emergency Messages. - Faten Fakhfakh; Mohamed Tounsi 001; Mohamed Mosbah 001 (IWCMC, 2019)

Formal Modeling and Verification of a Distributed Algorithm for Constructing Maximal Cliques in Static Networks. - Faten Fakhfakh; Mohamed Tounsi 001; Mohamed Mosbah 001 (Computación y Sistemas, 2019)

Towards an Efficient Clustering-Based Algorithm for Emergency Messages Broadcasting. - Faten Fakhfakh; Mohamed Tounsi 001; Mohamed Mosbah 001 (ICCCI, 2020)

Formal specification and verification of a broadcasting protocol: a refinement-based approach. - Faten Fakhfakh; Mohamed Tounsi 001; Mohamed Mosbah 001 (KES, 2020)

Modeling and Proving Distributed Algorithms for Dynamic Graphs. - Faten Fakhfakh; Mohamed Tounsi 001; Mohamed Mosbah 001 (Future Gener. Comput. Syst., 2020)

Vehicle Platooning Systems: Review, Classification and Validation Strategies. - Faten Fakhfakh; Mohamed Tounsi 001; Mohamed Mosbah 001 (Int. J. Networked Distributed Comput., 2020)

High-Level Approach for the Reconfiguration of Distributed Algorithms in Wireless Sensor Networks. - Emna Taktak; Mohamed Tounsi 001; Mohamed Mosbah 001; Ahmed Hadj Kacem (AINA (2), 2021)

A handshake algorithm for scheduling communications in wireless sensor networks. - Emna Taktak; Mohamed Tounsi 001; Mohamed Mosbah 001; Abdessalem Mnif; Ahmed Hadj Kacem (Concurr. Comput. Pract. Exp., 2022)

Cybersecurity attacks on CAN bus based vehicles: a review and open challenges. - Faten Fakhfakh; Mohamed Tounsi 001; Mohamed Mosbah 001 (Libr. Hi Tech, 2022)

A Formal Approach for a Railway Level Crossing Using the Event-B Method. - Mohamed Tounsi 001; Faten Fakhfakh (DiCES-N, 2023)