Directory of Experts

You are here

Back to search results
John Mullins
B.Sc., M.Sc. (Montréal), Ph.D. (INRS)

Phone: (514) 340-4711 Ext. 3278 Fax: (514) 340-5139 Room: M-4101

Research interests and affiliations

Research interests
  • Formal methods

  • Models and calculi of distributed systems including OO and mobile systems

  • Analysis of distributed systems

  • Functional and quantitative information security analysis

Affiliation(s)
Expertise type(s) (NSERC subjects)
  • 2700 INFORMATION TECHNOLOGY
  • 2710 Information systems design
  • 2713 Algorithms
  • 2714 Mathematics of computing

Publications

Recent publications
Conference paper
Helouet, L., Marchand, H. & Mullins, J. (2018). Concurrent Secrets with Quantified Suspicion. Paper presented at the 18th International Conference on Application of Concurrency to System Design (ACSD 2018), Bratislava, Slovakia (pp. 75-84). Retrieved from https://doi.org/10.1109/ACSD.2018.00011
Journal article
Bérard, B., Kouchnarenko, O., Mullins, J. & Sassolas, M. (2018). Opacity for linear constraint Markov chains. Discrete Event Dynamic Systems: Theory and Applications, 28(1), 83-108. Retrieved from https://doi.org/10.1007/s10626-017-0259-4
Journal article
Robati, T., Gherbi, A., El Kouhen, A. & Mullins, J. (2017). Design and simulation of distributed IMA architectures using TTEthernet: a model-driven approach. Journal of Ambient Intelligence and Humanized Computing, 8(3), 345-355. Retrieved from https://doi.org/10.1007/s12652-017-0449-9
Conference paper
Robati, T., Gherbi, A. & Mullins, J. (2016). A modeling and verification approach to the design of distributed ima architectures using TTEthernet. Paper presented at the 7th International Conference on Ambient Systems, Networks and Technologies (ANT2016) and 6th International Conference on Sustainable Energy Information Technology (SEIT2016), Madrid, Spain (pp. 229-236). Retrieved from https://doi.org/10.1016/j.procs.2016.04.120

Teaching

Requis et spécification de logiciels. Méthodes formelles de validation de logiciels. Spécification et vérification des protocoles de communication.

Supervision at Polytechnique

COMPLETED

  • Ph.D. Thesis (3)

    • Abouzaid, M.F. (2010). Analyse formelle d'orchestrations de services Web (Ph.D. Thesis, École Polytechnique de Montréal). Retrieved from https://publications.polymtl.ca/445
    • Hamadou, S. (2008). Analyse formelle des protocoles cryptographiques et flux d'information admissible (Ph.D. Thesis, École Polytechnique de Montréal).
    • Lafrance, S. (2005). Spécification et validation de protocoles de sécurité (Ph.D. Thesis, École Polytechnique de Montréal).
  • Master's Thesis (7)

    • Dupeuble, G. (2017). Préservation de l'opacité par raffinement de systèmes spécifiés par des chaînes de Markov discrètes à intervalles (Master's Thesis, École Polytechnique de Montréal). Retrieved from https://publications.polymtl.ca/2569/
    • Nleng, C.H. (2014). Modélisation et vérification du flux d'information pour les systèmes orientés objets (Master's Thesis, École Polytechnique de Montréal). Retrieved from https://publications.polymtl.ca/1549
    • Khadem Mohtaram, A. (2013). Classification, Formalization and Automatic Verification of Untraceability in RFID Protocols (Master's Thesis, École Polytechnique de Montréal). Retrieved from https://publications.polymtl.ca/1094
    • Kiraga, A.F. (2010). Vérification des systèmes de sécurité probabilistes : restriction de l'attaquant (Master's Thesis, École Polytechnique de Montréal). Retrieved from https://publications.polymtl.ca/349
    • Oarga, R.-M. (2005). Vérification à la volée de contraintes OCL étendues sur des modèles UML (Master's Thesis, École Polytechnique de Montréal).
    • Bastien, G. (2004). ASPiC : un outil d'analyse symbolique automatisée de protocoles cryptographiques basé sur le modèle de flux d'information (Master's Thesis, École Polytechnique de Montréal).
    • Bergeron, M. (2004). Model-checking UML designs using a temporal extension of the object constraint language (Master's Thesis, École Polytechnique de Montréal).