Mohamed Tounsi

Orcid: 0000-0002-1299-9005

Affiliations:
  • University of Sfax, ReDCAD Laboratory, Tunisia
  • University of Bordeaux, France (PhD)


According to our database1, Mohamed Tounsi authored at least 31 papers between 2007 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Cybersecurity attacks on CAN bus based vehicles: a review and open challenges.
Libr. Hi Tech, 2022

A handshake algorithm for scheduling communications in wireless sensor networks.
Concurr. Comput. Pract. Exp., 2022

2021
High-Level Approach for the Reconfiguration of Distributed Algorithms in Wireless Sensor Networks.
Proceedings of the Advanced Information Networking and Applications, 2021

2020
Vehicle Platooning Systems: Review, Classification and Validation Strategies.
Int. J. Networked Distributed Comput., 2020

Modeling and Proving Distributed Algorithms for Dynamic Graphs.
Future Gener. Comput. Syst., 2020

Formal specification and verification of a broadcasting protocol: a refinement-based approach.
Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 24th International Conference KES-2020, 2020

Towards an Efficient Clustering-Based Algorithm for Emergency Messages Broadcasting.
Proceedings of the Computational Collective Intelligence - 12th International Conference, 2020

2019
Formal Modeling and Verification of a Distributed Algorithm for Constructing Maximal Cliques in Static Networks.
Computación y Sistemas, 2019

A Comprehensive Survey on Broadcasting Emergency Messages.
Proceedings of the 15th International Wireless Communications & Mobile Computing Conference, 2019

An Evaluative Review of the Formal Verification for VANET Protocols.
Proceedings of the 15th International Wireless Communications & Mobile Computing Conference, 2019

Energy Efficient Handshake Algorithm for Wireless Sensor Networks.
Proceedings of the Distributed Computing for Emerging Smart Networks, 2019

2018
Proving Distributed Algorithms for Wireless Sensor Networks by Combining Refinement and Local Computations.
Proceedings of the 27th IEEE International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises, 2018

A Formal Approach for Distributed Computing of Maximal Cliques in Dynamic Networks.
Proceedings of the 30th International Conference on Software Engineering and Knowledge Engineering, 2018

Formal Verification Approaches for Distributed Algorithms: A Systematic Literature Review.
Proceedings of the Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 22nd International Conference KES-2018, 2018

Distributed Computations in Wireless Sensor Networks by Local Interactions.
Proceedings of the Ad-hoc, Mobile, and Wireless Networks, 2018

2017
Proving Distributed Coloring of Forests in Dynamic Networks.
Computación y Sistemas, 2017

Formal Development of Distributed Enumeration Algorithms By Refinement-Based Techniques.
Proceedings of the SCSS 2017, 2017

Algorithms for Finding Maximal and Maximum Cliques: A Survey.
Proceedings of the Intelligent Systems Design and Applications, 2017

A correct-by-construction approach for proving distributed algorithms in spanning trees.
Proceedings of the 16th IEEE/ACIS International Conference on Computer and Information Science, 2017

2016
From Event-B specifications to programs for distributed algorithms.
Int. J. Auton. Adapt. Commun. Syst., 2016

A Refinement-Based Approach for Proving Distributed Algorithms on Evolving Graphs.
Proceedings of the 25th IEEE International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises, 2016

Towards a General Framework for Ensuring and Reusing Proofs of Termination Detection in Distributed Computing.
Proceedings of the 24th Euromicro International Conference on Parallel, 2016

Formal Proofs of Termination Detection for Local Computations by Refinement-Based Compositions.
Proceedings of the Abstract State Machines, Alloy, B, TLA, VDM, and Z, 2016

A Fault-Tolerant Handshake Algorithm for Local Computations.
Proceedings of the 30th International Conference on Advanced Information Networking and Applications Workshops, 2016

2015
Towards a Formal Model for Dynamic Networks Through Refinement and Evolving Graphs.
Proceedings of the Software Engineering, 2015

A formal pattern for dynamic networks through evolving graphs.
Proceedings of the 12th IEEE/ACS International Conference of Computer Systems and Applications, 2015

2014
Enhancing Proofs of Local Computations through Formal Event-B Modularization.
Proceedings of the 2014 IEEE 23rd International WETICE Conference, 2014

2013
Towards Proved Distributed Algorithms through Refinement, Composition and Local Computations.
Proceedings of the 2013 Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, 2013

2011
Refinement-Based Verification of Local Synchronization Algorithms.
Proceedings of the FM 2011: Formal Methods, 2011

2010
Proving Distributed Algorithms by Combining Refinement and Local Computations.
Electron. Commun. Eur. Assoc. Softw. Sci. Technol., 2010

2007
A Formal Approach to prevent Attacks on Mobile Agent Systems.
Proceedings of the First International Conference on Emerging Security Information, 2007


  Loading...