Find Academic Supervisors

Ridha KhedriView profile

Professor

• Cybersecurity
• Formal Methods in Software Engineering
• Information Security Ontology
• +6 more

Ridha Khedri is a Professor in the Department of Computing and Software at McMaster University . His research spans formal methods in software engineering, cybersecurity, information security ontology, network segmentation, and covert channels analysis. Full Professor since 2000 Contact: khedri@mcmaster.ca Research Interests : Prof. Khedri develops algebraic frameworks for software security, with recent work on network segmentation , ontology engineering , and covert channel detection . His interdisciplinary efforts include hybrid machine learning-ontology models for environmental predictions (e.g., river ice breakup) and digital twin healthcare systems . Article Trends : His 15 most recent works (2016-2025) focus on network security , knowledge representation , and formal verification . Notable trends include automated security testing , ontology modularization , and multi-context reasoning systems . Teaching : He has taught courses like Software Design (CAS 703), Discrete Mathematics (SFWRENG 2DM3), and Algebraic Methods in Software Engineering (CAS 738) since 2017.

Ilya ShapirovskiyView profile

Assistant Professor

• Modal Logic
• Mathematical Logic
• Foundations of Mathematics
• +5 more

Ilya Shapirovskiy is an Assistant Professor in the Department of Mathematical Sciences at New Mexico State University's College of Arts & Sciences. His academic position is listed as Tenure Track Faculty within the university's mathematics department structure. Shapirovskiy's research focuses on advanced topics in mathematical logic, particularly modal logic and its applications. His work spans Kripke frame theory, decidability problems, local tabularity conditions, and connections between modal logic and graph theory. His publications demonstrate expertise in both theoretical foundations and computational aspects of logic systems. Analysis of his recent publications (2016-2025) reveals a consistent research trajectory centered on frame constructions, decidability conditions, and completeness results for various modal logics. His work frequently addresses the finite model property, local tabularity criteria, and relationships between logical systems and mathematical structures like well-orders and graph colorings. The publications appear in leading logic venues including Advances in Modal Logic, Journal of Symbolic Logic, and Studia Logica. Shapirovskiy maintains active scholarly engagement through presentations at major logic conferences including the Association for Symbolic Logic Annual Meeting, Logic Colloquium, and Advances in Modal Logic workshops. His recent talks address topics such as expressibility in distance logics, decidability of modal logics of non-k-colorable graphs, and locally finite polymodal logics.

Ryszard JanickiView profile

Professor

• Concurrency
• Rough Sets
• Pairwise Comparisons
• +7 more

Dr. Ryszard Janicki is a Professor in the Department of Computing and Software at McMaster University, affiliated with the Faculty of Engineering. He serves as the Graduate Advisor for Computer Science and has held academic positions since 1975. His expertise spans concurrency theory, rough sets, pairwise comparisons, software engineering fundamentals, and formal verification. He earned a Dr. Habil. from the Polish Academy of Sciences (1980), a Ph.D. (1977), and an M.Sc. (1975) in Computer Science and Applied Mathematics. Ph.D.: Computer Science, Polish Academy of Sciences, 1977 Dr. Habil.: Computer Science, Polish Academy of Sciences, 1980 M.Sc.: Applied Mathematics, Warsaw University of Technology, 1975 His research focuses on concurrency semantics (interval orders, Petri nets), approximation theory (rough sets, pairwise comparisons), software engineering (tabular expressions), and mereology applications. His work bridges theoretical foundations with practical systems modeling, including cardiac pacemakers and elevator systems using Petri nets. Recent publications emphasize advancements in pairwise comparison methods, data poisoning attack prevention in federated learning, and formal verification techniques for concurrent systems. He has advised numerous PhD students and contributed to textbooks and special journal issues on concurrency and rough sets. His contributions span 40+ years of academic leadership, with over 150 publications and international collaborations. He actively participates in conferences like Petri Net Theory and chairs special issues on concurrency and software certification.