Michael Alexander Riegler is a full-time Professor at Oslo Metropolitan University's Faculty of Social Sciences, specifically in the Department of Social Work, Child Welfare and Social Policy. While his formal academic affiliation focuses on social sciences, his research interests span interdisciplinary domains including computer technology, information and communication systems, medical technology, and mathematics/natural sciences. Current research projects: Strengthening solidarity for democratic unity across border (SOLIDEM) addressing trust erosion in European welfare states, and Artificial intelligence in assisted reproduction technology improving embryo/sperm selection Recent publications (2025) focus on AI applications in healthcare (wearable sensors, ECG reconstruction), anomaly detection in time-series data, multimodal healthcare data analysis, and psychiatric motor activity datasets
Eunjee Song is an Associate Professor and Graduate Program Director in the Department of Computer Science at Baylor University, Waco, Texas. She joined Baylor in 2006 and has held positions ranging from Lecturer (2006-2007) to Assistant Professor (2007-2013), Associate Professor (since 2013), and Graduate Program Director (2017-2021, 2023-current). PhD (2006) and MS (2001) in Computer Science from Colorado State University BS in Computer Engineering (1991) and Architecture (1988) from Seoul National University Her research focuses on software engineering , particularly aspect-oriented modeling for software security. Key interests include model-driven engineering , software verification , formal methods , and adaptive control of real-time systems . Her work often integrates property formalization and model verification for high-confidence systems. Recent publications emphasize hybrid access control systems , testability frameworks , and adaptive user interfaces , reflecting her expertise in model-driven security solutions . She has co-authored 15+ papers, with several appearing in SCI-indexed journals. Best Conference Paper Award at RACS 2012 She has advised 13 graduate students (PhD and MS) since 2007, including collaborations with Dr. Tomas Cerny (University of Arizona) and Dr. David Lin (SMU). Courses taught include Advanced Software Engineering, Software Verification & Validation, and Software Quality Assurance.
Christelle Scharff is a Professor at Pace University 's Seidenberg School of Computer Science and Information Systems. Her research spans Artificial Intelligence , Global Software Engineering , and ICT for Development (ICTD) , with a focus on cultural and educational applications. 1993-1999: BS, MS, PhD in Computer Science (Universite Henri Poincare, France) Her work includes AI ethics , deep learning for cultural preservation , and mobile technology for education in Africa . She leads the Seidenberg School's Artificial Intelligence Lab and has secured grants from NSF, IBM, Microsoft, Google , and USAID . Recent publications analyze global AI strategies , scrum team dynamics , and coding education in Africa . Her projects emphasize localization and sustainable technology deployment in Senegal and Cambodia. 2023 : NYAS Scientist Fellow 2019, 2012 : Fulbright Scholar in Senegal 2015 : Jefferson Award for Public Service She teaches advanced courses including Mobile Application Development , AI Ethics , and Software Reliability , with a pedagogical approach integrating field research and social entrepreneurship.
Coen De Roover is a Professor at the Software Languages Lab of the Vrije Universiteit Brussel , actively leading research in program analysis, software quality, and security. He chairs the Bachelor in Computer Science program and supervises a dynamic research group. Research Focus: Static/dynamic analysis, automated testing, software maintenance, AI for SE, infrastructure as code security. Projects: Bugatti (2025-2028), Cracy (2024-2027), CRPF (2024-2028), BaseCamp Zero (2022-2026), EcoPipe (2023-2025), APAX (2022-2024). Scientific Awards: MSR 2025 Distinguished Dataset Award IEEE TCSE Distinguished Paper Award (SANER 2022) ICSE 2022 Best Artifact Award SCAM 2022 Best Artifact Award Conference Leadership: General Chair of SCAM 2024, Program Co-Chair for GPCE 2024, and active in organizing summer schools on security testing.
Gregor Snelting is a Professor and head of the Chair of Programming Paradigms at the Karlsruhe Institute of Technology (KIT), Faculty of Computer Science, Institute for Programming Languages and Compiler Construction. His research focuses on compiler construction, program analysis, software security, and verification. His primary research interests include programming languages, compiler design, program analysis, software security, information flow control, formal verification, object-oriented and concurrent programming, and software reengineering using concept analysis. His work aims to provide solid theoretical foundations and empirical validation. The research output, particularly the 15 most recent articles, shows a strong emphasis on software security and program analysis, with a focus on information flow control in Java using the JOANA tool. There is also a significant thread on invasive computing and resource-aware parallel programming. The work combines deep theoretical contributions, such as formal semantics and correctness proofs, with practical tool development and empirical validation. Faculty Teaching Award for the course 'Practice in Software Development' Snelting leads a research group that has developed several significant tools, including JOANA for security analysis, the Praktomat system for automated grading of programming assignments, and contributions to the libFirm compiler framework. His group is a key participant in major research initiatives like the DFG Collaborative Research Center InvasIC and the DFG Priority Program RS3. He advises students and supervises theses, fostering research in programming paradigms and software security. The group is involved in several key research projects: JOANA for information flow control in Java, InvasIC for invasive computing and dynamic parallelism, Quis-Custodiet for machine-checked correctness proofs of security analyses, and the development of the libFirm compiler framework.
Chris Hawblitzel is a Senior Principal Researcher at Microsoft Research , affiliated with the Systems Research Group – Redmond . His work bridges programming languages, operating systems, verification, and security, emphasizing the integration of safe programming language features into systems development. Research interests include: Programming Languages and Type Systems Formal Verification of Systems Software Language Design for Security and Safety Systems and Networking Recent publications highlight advancements in Rust verification, linear types for systems, proof automation in F*, assembly language verification, and tactic languages. Key trends involve leveraging type systems for safety, SMT-based automation, and cross-layer formal methods. He has contributed to academic communities as a committee member for conferences such as PLDI 2025 , OOPSLA 2023 , and CPP 2019 , alongside session chair roles.
Roopsha Samanta is an Assistant Professor in the Department of Computer Science at Purdue University, where she leads the Purdue Formal Methods (PurForM) research group and is a core member of the Purdue Programming Languages (PurPL) group. She completed her PhD at the University of Texas at Austin in 2013 under the supervision of E. Allen Emerson and Vijay K. Garg, followed by postdoctoral research at IST Austria (2014-2016) with Thomas A. Henzinger. Her research focuses on developing foundational techniques at the intersection of formal methods and programming languages, with primary interests in: Program synthesis and repair using semantic guidance Modular verification of distributed systems Concurrency and synchronization synthesis Robustness analysis of I/O systems Her publication record shows consistent contributions across programming languages and formal methods venues, with recent emphasis on explainable program synthesis, bounded verification of distributed systems, and semantics-guided approaches to enhance synthesis robustness. Her work frequently appears in premier conferences including PLDI, POPL, OOPSLA, and CAV. Notable scientific recognitions include: NSF CAREER Award (2019) Amazon Research Award (2021) She actively advises graduate and undergraduate researchers in the PurForM group, with current students including Nouraldin Jaber, Christopher Wagner, and Yongwei Yuan. Her research is supported by grants from NSF and Amazon. Beyond research, she teaches courses on program reasoning (CS560) and neurosymbolic program synthesis (CS592), and serves on steering committees for VMW@CAV and DARS. She also co-edits the ACM SIGPLAN Blog on PL Perspectives.
Dr. Stephanie Balzer is an Assistant Professor in the Principles of Programming Group at Carnegie Mellon University's School of Computer Science. Her research focuses on enabling failure-free software through formal methods like type systems and verification logics. She emphasizes compositional proofs for scalability and practical validation via software artifacts. Programming Languages Type Theory Program Verification Concurrency & Security Her recent work explores timed protocols, disentanglement logic, and multiparty session types. Articles demonstrate semantic logical relations for termination (2025), deadlock freedom in Rust embeddings (2022), and information flow control (2024). Key collaborative papers address cyclic process networks and separation logic frameworks. Scientific recognition includes: NSF CAREER Award (2025) ACM SIGPLAN Distinguished Paper (2022) ECOOP Distinguished Paper (2022) She supervises PhD candidates Yue Yao, Yinsen Zhang, and Zak Kent (with Guy Blelloch), plus Master's student Sonya Simkin. Former advisee Jules Jacobs received Cum Laude distinction at Radboud University. Active in academic service, Balzer chairs PLMW@POPL workshops and co-organizes Oregon Programming Language Summer School. She serves on program committees for LICS, POPL, and ICFP.
Professor Jon Kerridge is a distinguished academic at the School of Computing, Edinburgh Napier University, where he has made significant contributions to parallel programming, software systems, and database applications. With a career spanning several decades, he has published extensively in the field of computer science and has supervised numerous PhD students. BSc, MSc, PhD Fellow of the British Computer Society (FBCS) Chartered IT Professional (CITP) Fellow of the Higher Education Academy (FHEA) Chartered Engineer (CEng) Professor Kerridge's research primarily focuses on parallel programming models, particularly through his work on the Groovy Parallel Patterns Library and Communicating Sequential Processes (CSP). His research spans multiple domains including software engineering, database systems, and interdisciplinary work in neuroscience related to dyslexia. He has also made significant contributions to pedestrian movement modeling and evolutionary algorithms. His publications demonstrate a consistent focus on practical software engineering solutions for parallel and distributed systems. The research trajectory shows progression from foundational work in computer architecture education in the 1980s through database systems in the 1990s-2000s to modern parallel programming frameworks. His interdisciplinary work connecting computer science with visual processing in dyslexia represents an innovative application of computational approaches to neuroscience problems. Fellow of the British Computer Society (FBCS) Chartered IT Professional (CITP) Fellow of the Higher Education Academy (FHEA) Chartered Engineer (CEng) Professor Kerridge has supervised several PhD students to completion, including Kevin Chalmers (Investigating communicating sequential processes for Java to support ubiquitous computing) and Robert Kukla (A software framework for the microscopic modelling of pedestrian movement). His research has been supported by Edinburgh Napier University funding, with applications ranging from healthcare systems to pedestrian flow optimization. He is a key member of the Centre for Algorithms, Visualisation and Evolving Systems at Edinburgh Napier University, where his work continues to influence both theoretical and applied aspects of computing.
Adrien Pommellet is an Associate Professor at EPITA , affiliated with the Laboratoire de Recherche en Informatique (LRE) automata team. His research focuses on formal methods, automata theory, and program synthesis. Education: PhD in Computer Science from Université Paris-Diderot (2018), Parisian Master of Research in Computer Science (2012) His research interests include active and passive learning of automata , model-checking algorithms for Büchi automata, and program synthesis . He actively contributes to the development of the Spot formal verification tool. Recent publications emphasize synthesis algorithms , automata reduction techniques , and LTL verification . He has also explored type systems and formal verification of concurrent programs. Teaching roles include courses in computer science (AAA, COMP, CPXA) and formal logic (FOLO, LOFO). Formerly taught ALGO, LOGI, and PING. He worked as a research engineer at CS Communications & Systèmes before joining EPITA's LRDE (now LRE) verification team in 2019.
Benjamin Gregoire is a Researcher at INRIA Sophia Antipolis , affiliated with the Marelle Team . His work focuses on compilers , formal verification , cryptography , proof assistants , and type theory . Education : PhD in Computer Science, Université Paris 7 (2003) Research Interests : Dr. Gregoire specializes in formal verification of cryptographic systems, compiler design for security-critical applications, type-based termination, and proof assistants like Coq. His projects include the INRIA-Microsoft Research Joint Lab , ANR Scalp (Security of Cryptographic Algorithms with Probabilities), and ANR DeCert (Certified Decision Procedures). He led the Mobius project (IP FET) and contributed to Java security validation via the JACK tool . Scientific Awards : He received the Best Paper Award at CRYPTO 2011 for 'Computer-Aided Security Proofs for the Working Cryptographer.' Advising & Collaborations : Dr. Gregoire has advised PhD students Michael Armand , Julien Charles , Sylvain Heraud , and Jorge-Luis Sacchini , with former advisee Cesar Kunz . He collaborates with teams including Marelle and INRIA-Microsoft Research .
Maxime Cordy is a researcher in Computer Science with a focus on Software Engineering and Formal Verification. He holds a PhD in Computer Science from the University of Namur, earned in 2014, and has engaged in visiting research at the University of Luxembourg (2017-2018). He also co-founded SkalUp as an R&D manager from 2015 to 2016. Education: Doctor of Science (University of Namur, 2014), Master in Computer Science (University of Namur, 2011) His research spans Software Product Lines , Model Checking , and Variability-Intensive Systems , emphasizing formal verification and automated analysis. He has contributed to over 53 research outputs with 949 citations and an h-index of 17. Recent publications include advancements in Featured Transition Systems , Mutation-Based Model Checking , and Machine Learning for Software Quality . He co-organized workshops like MaLTeSQuE 2019 and the Machine Learning and Software Engineering in Symbiosis workshop (2018). Scientific Awards: VAMOS 2024 Ten-Year Most Influential Paper Award (co-recipient) Maxime has collaborated extensively with institutions including the University of Luxembourg and co-authored works with leading researchers in formal methods and software engineering.
Prof. Dr. Mario Fritz is a leading academic at the CISPA Helmholtz Center for Information Security and Saarland University , with a focus on Trustworthy Information Processing . His work sits at the intersection of AI, Machine Learning, Security, and Privacy, addressing challenges in foundation models, health data, and adversarial robustness. Key Projects : ELLIOT (Multi-Modal Foundation Models), ELSA (Secure AI), PriSyn (Synthetic Health Data), AIgency (Generative AI in Cybersecurity), HMSP (Medical Security) Research Themes : AI/ML security, privacy-preserving techniques, causal modeling, healthcare applications, and ethical AI Recent Publications : Focus on LLM sampling, causal inference, model stealing, and privacy-aware document analysis Collaborations : European Laboratory for Learning and Intelligent Systems (ELLIS), BMBF-funded initiatives, GHGA (Human Genome Archive) Academic Leadership : As a Professor , he coordinates large-scale EU projects and mentors emerging researchers in AI ethics and security.
Christine Rizkallah is a Senior Lecturer in the School of Computing and Information Systems at the University of Melbourne, Australia. She joined the university in December 2021 after serving as a Lecturer at the University of New South Wales (UNSW) from April 2018 to December 2021. Her research focuses on interactive theorem proving, formal verification, programming languages, and systems, with an emphasis on building practical tools for high-assurance software development. She leads a research group working on the Cogent and Dargent languages, aiming to reduce the burden of formal verification in systems programming. Education: PhD in Computer Science, Universität des Saarlandes and Max-Planck-Institut für Informatik, Germany (2015), thesis: Verification of Program Computations , supervised by Prof. Dr. Kurt Mehlhorn. MSc in Computer Science, Universität des Saarlandes, Germany (2009), thesis: Proof Representations for Higher Order Logic , supervised by Prof. Dr. Gert Smolka and Dr. Chad E. Brown. BSc in Computer Science, German University in Cairo, Egypt (2007), thesis: X2-Planner: A Hierarchical Task Network Planner for Real Time Gaming Applications , supervised by Prof. Dr. Slim Abdennadher and Dr. Thorsten Maier. Her research interests lie at the intersection of programming languages and formal methods. She develops domain-specific languages with strong type systems and verified compilers to enable trustworthy software systems. Her work spans algorithms, logic, security, and social choice theory, reflecting a strong interdisciplinary approach. She has published extensively in top venues such as POPL, ICFP, ASPLOS, JAR, and PACMPL, with a focus on certifying compilation, refinement verification, and mechanized reasoning. Her recent publications reveal a consistent focus on formal verification of systems software, particularly through the Cogent language and its ecosystem. Key themes include verified data layout refinement (Dargent), property-based testing, termination analysis, cost modeling, and integration with foreign functions. Her work combines theoretical rigor with practical implementation, often involving mechanized proofs in Isabelle/HOL and Coq. Scientific Awards and Recognition: Distinguished Artefact Award at SLE'22 (awarded to Zilin Chen for work under her supervision). First Prize, SPLASH'22 Student Research Competition (undergraduate), won by Raphael Douglas Giles. Second Prize, ACM-wide Student Research Competition (undergraduate, 2023), won by Raphael Douglas Giles. She has supervised numerous PhD, Masters, and Honours students, many of whom have continued in academia or industry research roles. She has received research funding through institutional support and collaborative grants, though specific grants are not detailed in the provided text. She is actively involved in the programming languages community, serving on program committees for POPL, ICFP, CPP, PLDI, and others, and holding leadership roles such as Program Chair for FUNARCH'25 and Diversity and Inclusion Co-Chair for PLDI'25. She teaches core courses including Declarative Programming and Models of Computation at the University of Melbourne. She leads a vibrant research team and collaborates widely across institutions including UNSW, University of Pennsylvania, and international partners. Her lab focuses on building verified systems using functional programming and formal methods, with strong ties to the DeepSpec project and the Isabelle/HOL community.
Johan Commelin is an Assistant Professor in the Fundamental Mathematics group at the Mathematical Institute of Utrecht University. He works part-time (0.6FTE) at Utrecht University and part-time at Lean FRO, focusing on arithmetic geometry and formalization of mathematics. His educational background includes: PhD in Nijmegen (2013-2017), supervised by Ben Moonen Master's degree with thesis on "Algebraic cycles, Chow motives, and L-functions" (2013), supervised by Robin de Jong Bachelor's degree with thesis on "Tannaka Duality for Finite Groups" (2011), supervised by Lenny Taelman Commelin's research focuses on formalization of algebraic geometry, homological algebra, and condensed mathematics, as well as categorical logic and applications of o-minimality to algebraic geometry and topology. His work particularly examines applications of o-minimality to the theory of periods and motives. He is actively involved in the Lean community and led the Liquid Tensor Experiment following Peter Scholze's challenge. His recent publications show a strong trend toward formalization of mathematics using the Lean theorem prover, with significant contributions to formalizing advanced mathematical concepts like perfectoid spaces and Witt vectors. His work bridges traditional mathematical research with computer-assisted proof verification. Scientific awards include: Distinguished Paper Award for "Formalizing the Ring of Witt Vectors" at Certified Programs and Proofs 2021 Commelin supervises three PhD students: Raphael Douglas Giles, Christian Merten, and Pim Otte. He has received grants supporting his work in formalization of mathematics and is actively involved in organizing the group meeting on logic, formalization, and related topics at Utrecht University. He is one of the maintainers of the mathematical library of the Lean theorem prover and has collaborated on projects like "Superficie algebriche" and "Sloganerator" with Pieter Belmans.
