Formal Methods in Computer Science Professors and Supervisors in France | ApplySharif

Active facets:

Find Academic Supervisors

Find and connect with academic supervisors, professors, and scholars for your research journey.

Showing 31-45 of 602 supervisors

Profile data may be stale. It is sourced from public faculty pages.

Florian BrandnerView profile

Associate Professor

Télécom ParisFrance

Florian Brandner is an Associate Professor at Télécom Paris , Institut Polytechnique de Paris, and a member of the AuTonomous Critical Embedded Systems (ACES) team within the Information Processing and Communication Laboratory (LTCI) . His research focuses on compiler backend optimization for embedded processors , especially VLIW architectures , in the context of real-time systems . He specializes in worst-case execution time (WCET) optimization , code generation techniques, register allocation, and dynamic binary translation. His work addresses challenges in identifying code paths critical for WCET and ensuring predictable behavior in embedded environments. Academic Appointments: Associate Professor (HDR) at Télécom Paris (2025–present); previous roles at COMPSYS team, ENS Lyon; Microsoft Research; Technical University of Denmark. Research Grants: Involved in projects like Designing Formally Verified Predictable Architectures (CEA 2023–2026), Collaborative Action on Timing Interferences (ANR 2022–2026), and Time-Predictable Cache Management (CEA 2016–2019). Scientific Awards: Outstanding Paper at ECRTS'25, Best Paper at RTNS'22, RTNS'20, SoftCOM'17, and RTNS'15. Patents: Co-inventor of Time-Division Multiplexing Methods (US Patent US20210397488A1, French Patent FR3087982B1). Recent Publications highlight advancements in formal verification for memory controllers (Real-Time Systems 2023), causality modeling in timing anomalies (STTT 2022), and context-sensitive cache analysis (Real-Time Systems 2022). His work spans real-time systems theory, practical compiler design, and hardware-software co-verification.

Official University Profile

Amal AhmedView profile

Professor

InriaFrance

Amal Ahmed is a Professor and Associate Dean for Graduate Programs at Khoury College of Computer Sciences, Northeastern University, USA. Her career spans over two decades, with a focus on correct and secure compilation , safe language interoperability , and semantic type systems . Research Interests: Her work addresses key challenges in Secure compilation across software-hardware stacks Design of sound foreign-function interfaces (FFIs) Typed compiler intermediate languages for multi-language systems Probabilistic and modal separation logic Gradual typing with parametricity Provenance and concurrency semantics Recent Publications highlight advancements in application binary interfaces , probabilistic logic , WebAssembly interoperability , and gradual typing . These works span POPL , ICFP , LICS , and PLDI , with collaborations across institutions like Cornell and UBC. Scientific Recognition: NSF CISE CAREER Workshop awardee (2016) Editorial Board, Journal of Functional Programming (2017–present) Editorial Board, Mathematical Structures in Computer Science (2016–present) Advising & Mentorship: She mentors PhD students like John Li (co-advised with Steven Holtzen) and Andrew Wagner, alongside postdocs and undergraduates. Alumni include Daniel Patterson (Assistant Teaching Professor at Northeastern), Max New (Assistant Professor at U. Michigan), and William Bowman (Assistant Professor at UBC). Professional Leadership: Active in program committees for POPL , OOPSLA , and LICS , she co-organizes workshops like Dagstuhl Seminars and chairs PLDI 2024 and POPL 2023 .

Official University Profile

Eunsuk KangView profile

Associate Professor

InriaFrance

Eunsuk Kang is an Associate Professor in the Software and Societal Systems Department at Carnegie Mellon University's School of Computer Science. Their research focuses on the intersection of software engineering and formal methods, emphasizing rigorous modeling and analysis techniques to create safe, secure, and reliable systems. PhD in Computer Science from MIT Postdoctoral scholar at NSF ExCAPE program Former connected vehicles researcher at Toyota Their research interests span software design, requirements engineering, modeling, specification and verification, system safety, security, and cyber-physical systems (CPS). Recent projects explore robustness in evolving environments, specification engineering, automated reasoning for complex systems, and safety/resilience mechanisms in ML-based CPS. Publications highlight advancements in Signal Temporal Logic decomposition, LTL specification learning, and requirement-driven adaptation frameworks. Selected scientific contributions include: tl;dr: Chill, y’all – AI will not devour SE (Onward! Essays 2024): Critical perspective on AI integration in software engineering FairSense (ICSE 2025): Long-term fairness analysis for ML-enabled systems AlloyMax (ESEC/FSE 2021): Relational specification satisfaction techniques As an educator, Kang teaches graduate courses in software design and formal methods, including: 17-423/723: Designing Large-Scale Software Systems 17-614 & 624: Formal Methods 17-445/645: Software Engineering for AI-enabled Systems 17-651: Models of Software Systems Service activities include: Program co-chair for SEAMS 2026 Co-organizer of Dagstuhl Seminar on Specification Engineering Co-organizer of International Workshop on Designing Software Program committee member for ICSE, OOPSLA, ASE, and specialized conferences Notable research collaborations include work with: Ben-hau Chia (PhD student) Parv Kapoor (PhD student) Yiliang (Leo) Liang (PhD student) Sumon Biswas (Postdoc) Rômulo Meira-Góes (Postdoc)

Official University Profile

Joanna C. S. SantosView profile

Assistant Professor

InriaFrance

Joanna C. S. Santos is an Assistant Professor at the University of Notre Dame's Department of Computer Science and Engineering. She leads the Security and Software Engineering research lab (S²E) and focuses on Software Engineering, Security, and Program Analysis. Her work bridges empirical studies with practical tool development. PhD in Computing and Information Sciences (Rochester Institute of Technology) M.Sc. in Software Engineering (Rochester Institute of Technology) B.Sc. in Computer Engineering (Federal University of Sergipe) Her research spans Software Security (vulnerability detection, ReDoS), Code Generation (LLM evaluation, benchmarking), and Program Analysis (taint tracking, call graphs). Recent articles show a strong focus on LLM-generated code quality and quantum computing applications. Scientific Awards : 2023 - Distinguished Reviewer (ESEC/FSE) 2020 - Research Pitch Winner (JOBS @MICRO) 2017 - Best Paper (ICSA) 2014 - CAPES Scholarship 2013 - ERBASE 3rd Place She actively contributes to conference committees (OOPSLA, ICSE, SCAM) and collaborates across institutions. Her lab S²E drives research in secure software development and empirical cybersecurity validation.

Official University Profile

Véronique CortierView profile

Researcher

Grenoble Alps UniversityFrance

Véronique Cortier is a CNRS Research Director at the Lorraine Laboratory for Research in Computer Science and its Applications (Loria) in Nancy, France. She specializes in formal verification of security systems, particularly electronic voting protocols, and has co-authored over 80 publications. Her work bridges symbolic and computational models for cryptographic security. Notable roles include serving as program chair for CSF 2012-2013 and editorial duties for journals like TISSEC/TOPS. She leads the PEPR Cybersecurity Security Verification Protocol (SVP) (2022–2028) and has received grants from ANR, ERC, and PHC Alliance. Her research focuses on ensuring vote secrecy and verifiability in e-voting systems like Belenios , which has been used in 3,500+ elections. She also emphasizes transparency and public engagement through books and talks. 2022 : CNRS Silver Medal 2021 : Swiss Post bug bounty 2015 : Inria-French Académie des sciences Young Researcher Award Current advisees: Léo Louistisserand and Florian Moser.

Official University Profile

Jamal AtifView profile

Professor

Paris-Dauphine UniversityFrance

Jamal Atif is a Professor at Paris-Dauphine University and holds multiple significant leadership positions including Project Manager for 'Data Science and Artificial Intelligence' at the Institute of Information Sciences and their Interactions (INS2I) of the CNRS, Deputy Scientific Director of 3IA PRAIRIE, Head of the MILES team/project at LAMSADE (UMR CNRS-Université Paris-Dauphine), Co-leader of the Transverse Artificial Intelligence Program at PSL University, and Director of the Dauphine Numérique program. Professor Atif's primary research focuses on the foundations of responsible artificial intelligence, with specific expertise in privacy preservation in machine learning, robustness of deep learning algorithms to malicious attacks, causality, and explainability. His work bridges theoretical foundations with practical applications in security and reliability of AI systems. He has developed innovative approaches to address adversarial vulnerabilities in machine learning models and has made significant contributions to privacy-preserving techniques in data analysis. His publication record demonstrates a consistent focus on robust and trustworthy AI systems, with recent work exploring differential privacy in clustering, adversarial robustness, and explainable AI. The research spans theoretical foundations in logic and knowledge representation to practical applications in finance, healthcare, and computer vision. His publications appear in top-tier venues including Machine Learning journal, Neural Information Processing Systems, and International Joint Conferences on Artificial Intelligence. Scientific Awards: Recipient of two awards from the North American Society of Radiology for his thesis work Professor Atif has co-supervised or is currently supervising around fifteen doctoral students, demonstrating his commitment to mentoring the next generation of AI researchers. His leadership extends to directing major institutional programs including Dauphine Numérique and the Transverse Artificial Intelligence Program at PSL University, where he shapes strategic research directions in AI. He leads the MILES team/project at LAMSADE, which focuses on foundational aspects of machine learning and artificial intelligence. The team's research spans theoretical aspects of learning algorithms to practical applications requiring robust and reliable AI systems, with particular emphasis on security and privacy considerations in modern machine learning deployments.

Official University Profile

Tej ChajedView profile

Assistant Professor

InriaFrance

Tej Chajed is an Assistant Professor in the Department of Computer Sciences at the University of Wisconsin-Madison, focusing on formal verification of systems software. His research bridges theoretical foundations and practical implementations to ensure software correctness in concurrent and crash-safe systems. Research interests include formal verification, concurrency, crash safety, and programming languages, particularly using Coq, Perennial, and Goose frameworks. He has contributed to systems like DaisyNFS, a verified file system with sequential reasoning, and Verus, a foundation for systems verification. His work appears in top venues like SOSP, OSDI, and PLDI. 2025: Dafny PC Member 2024: PLDI Committee Member, CoqPL Co-chair 2023: CoqPL Co-chair, POPL Program Committee He actively mentors students and develops tools for systems verification education, including extensive Coq-based course materials.

Official University Profile

OUCHANI SamirView profile

Researcher

CESI Graduate School of EngineeringFrance

Samir Ouchani is a Research Director at the CESI LINEACT laboratory (Aix-en-Provence, France), affiliated with the CESI Engineering School. He holds a PhD in Computer Science from Concordia University (2013) and an HDR (Accreditation to Supervise Research) from CNAM Paris (2022). His research focuses on securing cyber-physical systems (CPS) through formal methods, blockchain, and AI-driven approaches. Key roles include leading projects on resilient CPS architectures, IoT security, and federated learning in industrial contexts. Education: 2022: HDR in Security and Reliability of Smart CPS (CNAM Paris) 2013: PhD in Computer Science (Concordia University, Montreal) 2006: Master in Computer Science (Lorraine University, France) 1997: Engineering Degree in Computer Science (Djillali Liabess University, Algeria) Research Interests: His work emphasizes secure CPS design, including cryptographic protocols for IoT, formal verification frameworks, and AI applications for intrusion detection. He explores blockchain for smart cities, federated learning in distributed systems, and resilience engineering for autonomous vehicles. Recent projects include developing PUF-based authentication protocols and digital twin architectures for resource-constrained systems. Advising & Collaborations: Supervised PhD theses on IoT security (Fahem Zerrouki), smart city formal verification (Walid Miloud Dahmane), and federated learning in industrial CPS (Souhila Bedra Guendouzi). Collaborates with institutions like Blida University (Algeria) and HESAM University. Active in conferences such as CRISIS, ICFNDS, and IEEE WETICE. Labs & Teams: Leads the Engineering and Numerical Tools research team at CESI LINEACT, focusing on model-based design, CPS simulation, and cybersecurity tool development. Engaged in EU-funded projects on Industry 4.0 and smart infrastructure security.

Official University Profile

Umang MathurView profile

Assistant Professor

InriaFrance

Umang Mathur is an Assistant Professor at the National University of Singapore's School of Computing, where he leads the FOCS Lab and is affiliated with PLSE@NUS. His research focuses on Formal Methods , Concurrency , and Decidability in Programming Languages and Software Engineering . PhD in Computer Science from the University of Illinois at Urbana-Champaign (advisor: Prof. Mahesh Viswanathan) Former Research Scientist at Facebook Inc. and Research Fellow at the Simons Institute Recipient of Google PhD Fellowship, 2024 CPP Distinguished Paper Award, 2023 ACM SIGPLAN Award, and ASPLOS 2022 Best Paper Award His recent work explores algorithmic techniques for detecting concurrency bugs , decidable program verification , and synthesis , with a focus on weak memory models, predictive monitoring, and automata-theoretic approaches. Articles span topics like causal concurrency, tree clock data structures, and probabilistic counting algorithms, reflecting interdisciplinary intersections of logic and systems research. Scientific Awards Google PhD Fellowship 2024 CPP Distinguished Paper 2023 ACM SIGPLAN Distinguished Paper 2022 ASPLOS Best Paper 2018 ESEC/FSE Distinguished Paper He advises PhD students in Formal Methods and supervises teams in the FOCS Lab. Teaching includes advanced modules on Automata Theory, Logic, and Verification at NUS.

Official University Profile

Aws AlbarghouthiView profile

Researcher

InriaFrance

Aws Albarghouthi is affiliated with the University of Wisconsin-Madison, USA. He is an active researcher with significant contributions to program synthesis, formal verification, and machine learning. Key roles: Author, Session Chair, Committee Member in conferences like PLDI, POPL, VMCAI, SPLASH, and ICFP. Research spans quantum computing, differential privacy, and static analysis. Research Trends include: Quantum Circuit Compilation and Optimization Probabilistic Verification of Fairness and Privacy Synthesis of Datalog and MapReduce Programs Neural-Augmented Static Analysis Bias Detection in Data Security Robustness in Machine Learning

Official University Profile

Frédéric Tran MinhView profile

Lecturer

Grenoble INPFrance

Frédéric Tran Minh is a Lecturer at Esisar – Grenoble INP-UGA and a PhD student affiliated with the CTSYS team at LCIS laboratory. His career spans academic teaching, software development, and research in formal verification for education. PhD in progress on proof assistants for teaching mathematics Former software engineer in computer-assisted surgery (8 years) Member of the APPAM ANR project Develops the Yalep proof assistant environment Research focus: Integration of Lean theorem prover and mechanized proofs into undergraduate mathematics pedagogy, emphasizing interactive learning and web-based accessibility. Teaching areas: Algebra, Analysis, C Programming, and automata theory, with innovative use of proof assistants in curricula.

Official University Profile

Sao Mai NguyenView profile

Lecturer

ENSTA ParisFrance

Sao Mai Nguyen is an Enseignante-Chercheuse (Lecturer-Researcher) at ENSTA Paris, affiliated with the Unité d'Informatique et d'Ingénierie des Systèmes (U2IS). Her research bridges robotics, artificial intelligence, and cognitive science, focusing on cognitive developmental robotics, intrinsic motivation in learning, and human-robot interaction. She explores how robots can adapt to social and physical environments, particularly in physical rehabilitation and smart home applications. Research Interests: Nguyen’s work integrates machine learning, robotic embodiment, child psychology, and neuroscience. Key areas include human-robot interaction, assistive robotics for chronic low back pain rehabilitation, activity recognition in smart homes using IoT sensors, and intrinsic motivation-driven learning frameworks. Recent Contributions: Her 2024 HDR thesis on reinforcement and imitation learning for sequential tasks underscores her expertise in strategic learning systems. Recent publications address bio-inspired robotics models, hierarchical reinforcement learning, and benchmark environments like 'Open the Chests' for activity recognition. Collaborations include projects like the R-COOL randomized trial for robot-coached physical exercises. Labs & Teams: She contributes to the U2IS lab, advancing interdisciplinary research in AI and robotics. Her work spans experimental platforms for sensorimotor learning and healthcare robotics applications.

Official University Profile

Deepak GargView profile

Researcher

InriaFrance

Deepak Garg is a researcher at the Max Planck Institute for Software Systems (MPI-SWS) in Germany. His work primarily focuses on secure compilation , type theory , and formal verification of software systems. Conference Roles: He has served as an author and committee member in premier programming language conferences such as POPL , PLDI , ICFP , and ESOP since 2015. Research Interests include: Secure compilation techniques for hyperproperty preservation. Modal and refined type theories for cost analysis and concurrency. Formal verification of C code and probabilistic programs. Compiler correctness and decentralized multi-language verification. Contributions span foundational research in programming languages, with a focus on security, complexity, and concurrency. His work has been published in tracks like PriSC , OOPSLA , and ESOP , addressing topics such as data-flow back-translation and robust property preservation.

Official University Profile

Ioan TodincaView profile

Professor

University of OrléansFrance

Ioan Todinca is a Professor of Computer Science at the University of Orléans, France, affiliated with the LIFO (Laboratoire d'Informatique Fondamentale d'Orléans) research laboratory. His academic career spans over two decades, with significant contributions to theoretical computer science, particularly in graph algorithms and distributed computing. Faculty of Science, University of Orléans LIFO Research Laboratory Member of Institut thématique pluridisciplinaire Modélisation, Systèmes, Langages (since 2014) Former director of MIPTIS doctoral school (2012-2014) Former head of Computer Science degree program (2007-2011) Former leader of LIFO Graphs, Algorithms and Computational Models team (2008-2012) Todinca's research focuses primarily on graph algorithms, with expertise in exact algorithms (moderately exponential), parameterized algorithms, and algorithms for specific graph classes. He has made significant contributions to techniques involving tree decompositions, treewidth, minimal separators, and potential maximal cliques. More recently, his work has expanded into distributed algorithms, especially in communication-constrained models like the broadcast congested clique. His research bridges theoretical foundations with practical algorithmic approaches for NP-hard problems. The analysis of his recent publications reveals a strong trend toward distributed computing problems, particularly in congested network models. His work spans from fundamental graph theory problems (cycle detection, graph modification) to applications in quantum computing and model checking. The consistent focus on communication complexity, verification, and efficient algorithms across different computational models demonstrates his ability to adapt theoretical computer science principles to emerging computational paradigms. Todinca has supervised numerous PhD students and has been actively involved in the theoretical computer science community through conference organization and editorial work. His publications appear consistently in top-tier venues including SIAM Journal on Computing, Algorithmica, and proceedings of major conferences like STACS, WG, and DISC. Teaching responsibilities include algorithms, graph theory, and discrete structures for undergraduate and graduate students, with previous experience teaching databases, programming, and software engineering. His educational materials are hosted on the university's Celene platform.

Official University Profile

Clément Pit-ClaudelView profile

Assistant Professor

InriaFrance

Clément Pit-Claudel is an Assistant Professor at École Polytechnique Fédérale de Lausanne (EPFL), leading the SYSTEMF lab focused on programming languages, formal methods, and systems engineering. His work bridges mathematical formalisms with practical system development to achieve full assurance in critical software and hardware. PhD in Computer Science from MIT (2016) William A. Martin Memorial Thesis Award recipient Former Senior Applied Scientist at Amazon AWS Teaching accolades including the Frederick C. Hennie III Teaching Award Research spans three axes: extensible proof-producing compilers for performance-critical systems, verified hardware compilation with cycle-accurate semantics, and interactive theorem prover tooling for democratizing verification technology. Key projects include Kôika for hardware verification, Alectryon for Coq proof visualization, and Fiat for correct-by-construction program synthesis. Recent publications address JavaScript regex verification (ICFP 2024), cryptographic server integration (PLDI 2024), and hardware simulation optimization (ASPLOS 2021). Articles demonstrate expertise in functional-to-imperative translation, domain-specific compiler extensions, and hardware-software co-verification. Scientific contributions recognized through: Distinguished artifact award (SLE 2020) MIT William A. Martin Thesis Award Frederick C. Hennie III Teaching Award Teaching philosophy emphasizes hands-on lab instruction , oral assessment , and automated tooling . Courses taught include Software Construction (undergraduate) and Interactive Theorem Proving (graduate) at EPFL. Research service includes program committee roles at Dafny, POPL, and SPLASH conferences.

Official University Profile