Publications à Polytechnique

Ces données sont extraites du Répertoire des publications de l'École Polytechnique de Montréal. La liste ci-dessous contient seulement les publications auxquelles a participé le professeur ou le chercheur depuis son entrée en fonction à l’École. De plus, certaines publications ne sont pas dans cette liste, notamment les notes de cours et les rapports techniques internes plus d'information...
1	Abouzaid, F., Mullins, J., Mazzara, M., Dragoni, N. (2012). Modelling and Analysis of Dynamic Reconfiguration in BP-Calculus. 6th KES International Conference on Agent and Multi-Agent Systems: Technologies and Applications, KES-AMSTA 2012, p. 534-543.
2	Hamadou, S., Mullins, J. (2010). Calibrating the Power of Schedulers for Probabilistic Polynomial-Time Calculus. Journal of Computer Security, 18(2), p. 265-316.
3	Abouzaid, F., Mullins, J. (2010). Formal Specification of Correlation in WS Orchestrations Using BP-Calculus. Electronic Notes in Theoretical Computer Science, 260, p. 3-24.
4	Berard, B., Mullins, J., Sassolas, M. (2010). Quantifying Opacity. Seventh International Conference on the Quantitative Evaluation of Systems (QEST 2010), p. 263-272.
5	Abouzaid, F., Mullins, J. (2009). Model-Checking Web Services Orchestrations Using BP-Calculus. Electronic Notes in Theoretical Computer Science, 255, p. 3-21.
6	Abouzaid, F., Mullins, J. (2008). A Calculus for Generation, Verification and Refinement of BPEL Specifications. Electronic Notes in Theoretical Computer Science, 200(3), p. 43-65.
7	Boteanu, D., Fernandez, J.M., McHugh, J., Mullins, J. (2007). Queue Management As a DoS Counter-Measure?. Information Security : ISC 2007. Proceedings of the 10th Information Security Conference, p. 263-280.
8	Brlek, S., Hamadou, S., Mullins, J. (2006). A Flaw in the Electronic Commerce Protocol Set. Information Processing Letters, 97(3), p. 104-108.
9	Hadj-Alouane Nejib, B.E.N., Lafrance, S., Feng, L.I.N., Mullins, J., Yeddes, M. (2005). Characterizing Intransitive Noninterference for 3-Domain Security Policies With Observability. IEEE Transactions on Automatic Control, 50(6), p. 920-925.
10	Ben Hadj-Alouane, N., Lafrance, S., Lin, F., Mullins, J., Yeddes, M.M. (2005). On the Verification of Intransitive Noninterference in Mulitlevel Security. IEEE Transactions on Systems, Man and Cybernetics. Part B, Cybernetics, 35(5), p. 948-958.
11	Brlek, S., Hamadou, S., Mullins, J. (2005). Anonymous and Secure Electronic Transaction Protocol. Annales des télécommunications, 60(5-6), p. 530-557.
12	Fellah, A., Mullins, J. (2005). Admissible Interference by Typing for Cryptographic Protocols. Information and Communications Security. Proceedings, v. 3783, p. 123-135.
13	Boucheneb, H., Mullins, J. (2003). Analyse des reseaux temporels : Calcul des classes en O(n2) et des temps de chemin en O(mxn). TSI. Technique et science informatiques, 22(4), p. 435-459.
14	Mullins, J., Lafrance, S. (2003). Bisimulation-Based Non-Deterministic Admissible Interference and Its Application to the Analysis of Cryptographic Protocols. Information and Software Technology, 45(11), p. 779-790.
15	Lafrance, S., Mullins, J. (2003). An Information Flow Method to Detect Denial of Service Vulnerabilities. Journal of Universal Computer Science, 9(11), p. 1350-1369.
16	Lafrance, S., Mullins, J. (2002). Using Admissible Interference to Detect Denial of Service Attacks. (Rapport technique EP-R ; 02-01).
17	Yeddes, M., Alla, H., Mullins, J. (2002). Analyse structurelle d'un fonctionnement séquentiel. Journal européen des systèmes automatisés, 36(8), p. 1101-1118.
18	Hains, G., Loulergue, F., Mullins, J. (2001). Concrete Data Structures and Functional Parallel Programming. Theoretical Computer Science, 258(1-2), p. 233-267.
19	Yeddes, M., Mullins, J. (2001). Quasi-Synchronous Approach for Distributed Control in Synchronous Systems. Proceeding of the 2001 IEEE International Symposium on Intelligent Control (ISIC '01), p. 231-235.