[1] Dominique Cansell, Paul Gibson, and Dominique Méry. Formal verification of tamper-evident storage for e-voting. In ( SEFM 2007 5th IEEE International Conference on Software Engineering and Formal Methods. [ bib ]
[2] Jérémie Chalopin and Yves Métivier. An efficient message passing election algorithm based on mazurkiewicz's algorithm. Fundamenta Informaticae, à paraître. [ bib ]
[3] J. Chalopin. Election and rendezvous with incomparable labels. Theoretical Computer Science, to appear in 2007. [ bib ]
[4] Jérémie Chalopin, Emmanuel Godard, Yves Métivier, and Rodrigue Ossamy. Mobile agent algorithms versus message passing algorithms. In OPODIS, pages 187-201, 2006. [ bib ]
[5] Joris Rehm and Dominique Cansell. Proved Development of the Real-Time Properties of the IEEE 1394 Root Contention Protocol with the Event B Method. In En cours de publication ISoLA Workshop On Leveraging Applications of Formal Methods, Verification and Validation, page ?, Poitiers-Futuroscope France, 12 2007. [ bib | http ]
[6] Dominique Cansell, Paul Gibson, and Dominique Méry. Refinement: A constructive approach to formal software design for a secure e-voting interface. Electr. Notes Theor. Comput. Sci., 183, 2007. [ bib ]
[7] Dominique Cansell and Dominique Méry. Incremental parametric development of greedy algorithms. Electr. Notes Theor. Comput. Sci., 185:47-62, 2007. [ bib ]
[8] Hédi Hamdi, Adel Bouhoula, and Mohamed Mosbah. A software architecture for automatic security policy enforcement in distributed systems. In IEEE International Conference on Emerging Security Information, Systems and Technologies. IEEE Computer Society Press, 2007. [ bib ]
[9] Hédi Hamdi, Adel Bouhoula, and Mohamed Mosbah. A domain specific language for securing distributed systems. In IEEE Second International Conference on Systems and Networks Communications. IEEE Computer Society Press, 2007. To appear. [ bib ]
[10] Hédi Hamdi, Adel Bouhoula, and Mohamed Mosbah. Automating enforcement mechanisms generation for security policies in distributed systems. In IEEE Global informations infrastructures Symposium 2007 (GIIS 2007). IEEE Computer Society Press, 2007. To appear. [ bib ]
[11] Shehla Abbas, Mohamed Mosbah, and Akka Zemmari. Merging time of random mobile agents. In International Conference on Dynamics in Logistics 2007 (LDIC 2007), Lect. Notes in Comp. Sciences. Springer-Verlag, 2007. To appear. [ bib ]
[12] Shehla Abbas, Mohamed Mosbah, and Akka Zemmari. Collecte d'informations par des agents mobiles. In NOuvelles TEchnologies de la REpartition, NOTERE 2007. Hermès - Lavoisier, 2007. [ bib ]
[13] Brahim Hamid, Bertrand Le Saec, and Mohamed Mosbah. Simple distributed algorithm for the maintenance of a spanning tree. In Proceedings VECoS 2007, First International Workshop on Verification and Evaluation of Computer and Communication Systems, eWiC. British Computer Society, 2007. [ bib ]
[14] Brahim Hamid, Bertrand Le Saec, and Mohamed Mosbah. Distributed 2-vertex connectivity test of graphs using local knowledge. In Proceeding of the International Conference on Parallel and Distributed Computing Systems, pages 71-76. WASET, 2007. [ bib ]
[15] Brahim Hamid, Bertrand Le Saec, and Mohamed Mosbah. Distributed local 2-connectivity test of graphs and applications. In ISPA 2007, The Fifth International Symposium on Parallel and Distributed Processing and Applications, volume (to appear) of Lect. Notes in Comp. Sciences. Springer-Verlag, 2007. [ bib ]
[16] Dominique Cansell. Modélisation incrémentale de l'algorithme de mazurkiewicz. Présentation orale des modèles event B, 2007. [ bib ]
[17] Jérémie Chalopin, Emmanuel Godard, and Yves Métivier. About the termination detection in the asynchronous message passing model. In SOFSEM, volume 4362 of Lecture Notes in Computer Science, pages 200-211, 2007. [ bib ]
[18] J. Chalopin, S. Das, and N. Santoro. Rendezvous of mobile agents in unknown graphs with faulty links. In Proc. of Distributed Computing, 21st International Conference (DISC 2007), Lecture Notes in Computer Science. Springer-Verlag, 2007. [ bib ]
[19] Dominique Cansell and Dominique Méry. Festschrift Egon Börger, chapter Designing old and new distributed algorithms by replaying an incremental proof-based development. Springer, 2007. [ bib ]
[20] Thierry Lecomte, Dominique Cansell, and Dominique Méry. Patrons de conception prouvés. In Journées Neptune 22 et 23 mai, 2007. [ bib ]
[21] Dominique Cansell and Dominique Méry. Proved-patterns-based development for structured programs. In CSR, pages 104-114, 2007. [ bib ]
[22] Bill Stoddart, Dominique Cansell, and Frank Zeyda. Modelling and proof analysis of interrupt driven scheduling. In B, pages 155-170, 2007. [ bib ]
[23] Dominique Cansell, Dominique Méry, and Joris Rehm. Time constraint patterns for event b development. In B, pages 140-154, 2007. [ bib ]
[24] Nazim Benaïssa, Dominique Cansell, and Dominique Méry. Integration of security policy into system modeling. In B, pages 232-247, 2007. [ bib ]
[25] Dominique Cansell, J. Paul Gibson, and Dominique Méry. Refinement: A constructive approach to formal software design for a secure e-voting interface. Electronic Notes in Theoretical Computer Science, Volume 183:39-55, July 2007. Proceedings of the First International Workshop on Formal Methods for Interactive Systems (FMIS 2006). [ bib ]

This file has been generated by bibtex2html 1.87.