Find Academic Supervisors

Laure GonnordView profile

Professor

• Static Analysis
• Compilation
• Software Engineering
• +7 more

Laure Gonnord is a Full Professor in Computer Science at Grenoble INP , affiliated with the Esisar Engineer School in Valence, France, since September 2021. She is a member of the CTSYS research team at the LCIS laboratory and an external member of the CASH team at the University of Lyon / CNRS / LIP / Inria. Her research focuses on compilation , static analysis , and applications to safety , security in high-performance and embedded systems . Fields of Interest : Compiler Design Static Analysis for Safety & Security Abstract Interpretation Embedded Systems High-Performance Programming Hardware Security Engineering Research Trends (from recent publications): Her work explores modular verification through monadic abstract interpreters, complexity bounds in term rewriting , and educational tools for theorem proving . Notable contributions include compiler hardening schemes for hardware security and memory layout optimizations for algebraic data types. Academic Leadership : Scientific Director of the Summer School EJCP (École Jeune Compilation et Programmation) Board Member of the French national research group GDR GPL Teaching Responsibilities at Grenoble INP include courses in architecture , compilation , programming languages , algorithms , and databases . She has also taught at University of Lyon, ENS Lyon, Polytech'Lille, and INSA.

Jens LechtenbörgerView profile

Lecturer

• Open Educational Resources (OER)
• Data Warehousing
• Business Intelligence
• +4 more

Dr. Jens Lechtenbörger is a Faculty member and Lecturer at the Chair of Machine Learning and Data Engineering at the University of Münster's School of Business and Economics. He holds a Doctoral degree (2001) and a diploma in Computer Science (1997) from the University of Münster and Oldenburg, respectively. His roles include serving as Akademischer Oberrat since 2006, Acting Professor (2016), and Fellow for innovation in digital university teaching (2016–2017). He leads projects like Tutor.AI and OER infrastructure development, focusing on Open Educational Resources (OER), data warehousing, and educational technology. Research interests span OER creation, data integration, business intelligence, and machine learning applications in education. He has published extensively on data warehouse design, database systems, and educational technologies. Notable awards include the Best Evolutionary & Swarm Computation Paper Award (2019) and the Dissertation Prize 2003. Teaching responsibilities include courses on data structures, operating systems, and management information systems. He supervises theses on topics like AI-driven learning systems, data privacy, and business logic vulnerabilities. Active in academic service, he chairs committees on digital teaching and curriculum reform at the University of Münster.

• Computational Fluid Dynamics
• High-Performance Computing
• Turbulence Simulation
• +3 more

Martin Karp is a Research Fellow and postdoctoral researcher at KTH Royal Institute of Technology's Department of Engineering Mechanics, working under Dan Henningson. His research focuses on high-fidelity numerical simulations of turbulence and transition, with a specialization in high-performance computing (HPC) and supercomputing architectures. He holds a PhD in computer science from KTH and an MSc in Engineering Physics from Lund University, complemented by studies at ETH Zürich's computer science department. His research interests explore computational limits in nonlinear chaotic systems and future computational advancements. He leads the development of the Neko framework, a scalable simulation tool for extreme-scale CFD with extensive accelerator support. Karp's work emphasizes GPU and FPGA acceleration, parallel computing, and optimizing algorithms for heterogeneous architectures. Key contributions include large-scale turbulence simulations using GPUs, reducing communication in conjugate gradient methods, and evaluating FPGA-based flow solvers. His publications span journals like Concurrency and Computation and Scientific Reports , with conference presentations at IEEE Cluster, PASC, and HPCAsia. Karp's research bridges theoretical computational limits and practical HPC implementation, addressing challenges in precision, scalability, and hardware utilization. His educational background combines engineering physics with computer science, enabling interdisciplinary approaches to fluid dynamics and high-performance simulation. Current projects aim to push the boundaries of computational fluid dynamics through novel algorithm design and leveraging emerging hardware capabilities.

• Concurrency and Parallelism
• Real-time Systems
• Distributed Systems
• +6 more

Lukasz (Luke) Ziarek serves as Associate Dean for Academic Affairs and Associate Professor in the Department of Computer Science and Engineering at the University at Buffalo's School of Engineering and Applied Sciences. His work bridges theoretical computer science with practical systems engineering, focusing on real-time capabilities in distributed environments and safety-critical applications. His educational foundation includes a PhD in Computer Science from Purdue University (2011) and a BS in Computer Science from the University of Chicago (2003). Ziarek's research centers on formal verification of distributed protocols , real-time systems engineering , and mobile/embedded computing . He pioneers session type theory for IoT security, develops real-time variants of Android (RTDroid) and Standard ML (RTML), and investigates UAV software reliability. His work consistently addresses the tension between theoretical guarantees and practical system constraints in concurrency, timing, and security. Recent publications (2022-2025) reveal three dominant trajectories: formal methods for rate-based session types in IoT protocols, performance analysis of visual SLAM systems for robotics, and security vulnerabilities in embedded platforms like ARM TrustZone. These threads converge on ensuring correctness and timeliness in resource-constrained distributed systems. His scientific accolades include the IEEE Region One Technological Innovation Award (2023) and NSF CAREER Award (2018), reflecting dual excellence in research and education. IEEE Region One Technological Innovation (Academic) Award, 2023 President Emeritus and Mrs. Meyerson Award for Distinguished Undergraduate Teaching and Mentoring, 2022 NSF CAREER Award, 2018 SEAS Early Career Teacher of the Year, 2016 Halstead Award for Outstanding Research in Software Engineering, 2009 Intel Fellowship, 2008 GAANN Fellowship, 2004 Ziarek directs significant research initiatives including a $900K NSF UAV infrastructure project (as PI) and a $1.7M MRI grant for connected vehicle testing. His funding portfolio spans real-time systems, compiler design, and pocket-scale data management, emphasizing collaborative, interdisciplinary approaches to software reliability. CRI:CI-New UAV Infrastructure ($900K, PI 31%) NSF CAREER: Real-time Object-Oriented Systems ($500K, PI 100%) MRI: iCAVE2 Vehicle Testing ($1.7M, co-PI 14%) III: Just-in-Time Data Structures ($499K, co-PI 50%) II-EN: MLton Compiler Research ($606K, PI 63%) He leads an open-source ecosystem including RTDroid (real-time Android), Multi-MLton (parallel SML compiler), and BlueSeal (Android security analyzer), fostering community-driven advances in systems software.

Giovanni SilenoView profile

Lecturer

• Artificial Intelligence
• Logic Programming
• Knowledge Representation
• +5 more

Giovanni Sileno is an academic specializing in Artificial Intelligence, Logic Programming, and Knowledge Representation, with teaching appointments at the University of Amsterdam, EPITA Paris, and Université Pierre et Marie Curie. His primary affiliation is with the Informatics Institute at the University of Amsterdam where he serves as a Lecturer. His research interests span multiple domains within computer science, focusing particularly on formal methods for normative systems, agent-based programming, and logic-based knowledge representation. His work bridges theoretical computer science with practical applications in policy modeling, forensic science, and business information systems. Dr. Sileno has developed several notable software projects including AgentScriptCC for single-threaded intentional agents, DCPLschema for normative policy specifications, and libraries for normative primitives in Answer Set Programming. His GitHub activity shows consistent contributions from 2012 through 2025, indicating active engagement in both research and development. His publications reflect a strong focus on formal methods applied to practical problems, with particular emphasis on normative systems, agent architectures, and logic programming applications. The research trajectory shows evolution from foundational topics in logic and numeral systems toward increasingly sophisticated applications in policy modeling and agent-based systems. As an educator, he has taught across multiple institutions and disciplines, covering topics from basic programming paradigms to advanced knowledge representation and formal modeling techniques. His teaching spans undergraduate to master's level courses in information studies, cognitive science, data science, and forensic science.

Chris KöcherView profile

Researcher

• Algorithms
• Theory & Logic
• Programming Languages
• +9 more

Chris Köcher is a Researcher at the Max Planck Institute for Software Systems (MPI-SWS) in Kaiserslautern, Germany. His work focuses on theoretical computer science, with a strong emphasis on formal methods, automata theory, and verification of complex systems. He leads research in areas such as algorithms, programming languages, cyber-physical systems, and security. His research bridges foundational theory and practical applications, addressing challenges in distributed systems, mobile systems, and privacy-preserving technologies. His research interests span formal language theory, verification of concurrent systems, and the analysis of storage mechanisms in automata. Notably, he has contributed to the study of queue automata, multi-pushdown systems, and the decidability of reachability problems in lossy systems. His work often intersects with theoretical computer science and algebraic structures, exploring topics like monoids and trace languages. Chris’s publications reflect a deep engagement with foundational questions in computer science, including the verification of cooperating multi-pushdown systems, the complexity of semilinear set separability, and the formal analysis of hard attention mechanisms in transformers. His research has implications for improving the reliability and security of software systems through rigorous mathematical foundations. He is affiliated with MPI-SWS, a leading research institution in software systems, and contributes to the institute’s mission to advance theoretical and applied research in computer science. His work is supported by collaborations within the institute and the broader academic community.

Sepehr Amir-MohammadianView profile

Associate Professor

• Cybersecurity
• Programming Languages
• Formal Software Security Assurance
• +5 more

Sepehr Amir-Mohammadian is an Associate Professor in the Department of Computer Science at the University of the Pacific, part of the School of Engineering and Computer Science. His research focuses on cybersecurity, programming languages, and formal software security assurance, particularly applying linguistic approaches to ensure properties in security-critical applications. He earned his PhD in Computer Science from the University of Vermont (2017), focusing on in-depth security policy enforcement, following an MS in Information Security Engineering (Amirkabir University of Technology, 2011) and a BS in Information Technology Engineering (Amirkabir University of Technology, 2009). Teaching interests include computer networking, reliable software design, programming languages, and theoretical computer science. He has held leadership roles such as Engineering & Computer Science Council Chair (2020-2021) and currently represents his school in the Technology in Education Committee. His research bridges theory and practice, with contributions to audit logging correctness, quantitative information flow analysis, and cybersecurity in cyber-physical systems. Recent work emphasizes concurrent audit logging in distributed systems, timing attack analysis in cyber-physical systems, and leveraging digital twins for security quantification. Notable collaborations include the OpenMRS medical records system and PRISM-Leak tool development for probabilistic program analysis. His publications span conferences like ACM CPSS, IEEE COMPSAC, and IEEE ICNC, addressing challenges in microservices, concurrency, and formal methods. While no specific awards are noted, his contributions to security frameworks and practical implementations reflect significant scholarly impact. Research groups and projects include work on hybrid-dynamic systems, concurrent logging, and network protocol testing with large language models.

• Arithmetic Topology
• Number Theory
• 3-Dimensional Topology
• +5 more

Masanori Morishita is a Professor at Kyushu University, holding concurrent positions in the Faculty of Mathematics, Joint Graduate School of Mathematics for Innovation, School of Sciences Department of Mathematics, and Graduate School of Mathematics. His research focuses on Arithmetic Topology, exploring the interplay between number theory, 3-dimensional topology, and mathematical physics. He earned his Ph.D. from the University of Tokyo in 1992. Education: B.Sc. from University of Tokyo (1982–1986) Research Interests: Arithmetic Topology, Knot-Prime Analogy, Class Field Theory, Milnor Invariants, Galois Representations Teaching includes linear algebra, calculus, number theory, algebraic geometry, and topology. He has advised 11 master's and 7 doctoral students. His work bridges number theory and topology, with contributions to Ihara theory, Chern-Simons invariants, and arithmetic TQFT. Major grants include JSPS funding for projects on arithmetic field theories and 3D geometric topology. Notable contributions include founding the 'Low Dimensional Topology and Number Theory' conference series and organizing international conferences. He has been a visiting scholar at institutions worldwide, including Muenster University and the Australian National University.

• Cybersecurity
• Formal Verification
• Cyber-Physical Systems
• +7 more

Marjan Sirjani is a Professor at Mälardalen University, affiliated with the School of Innovation, Design and Engineering, and the Division of Computer Science and Software Engineering. Her research focuses on cybersecurity, formal verification, and cyber-physical systems, with notable contributions to actor-based modeling (e.g., Timed Rebeca) and tools like AFRA for model analysis. She specializes in integrating formal methods into safety-critical systems, including automotive cybersecurity, ROS2 robotics, and blockchain-based IoT systems. Her work emphasizes rigorous analysis of protocols, concurrency, and real-time constraints. Recent projects include the CRYSTAL framework for CPS assurance, Tiny Twins for runtime attack detection, and applying LLMs for automated test generation. She also explores semantic segmentation in construction and compositional analysis of distributed systems. Publications highlight advancements in protocol learning, controller synthesis for safety, and model-driven development. Her research bridges theoretical foundations (e.g., automata theory, temporal logics) with practical applications in autonomous systems, medical device interoperability, and smart mobility. Labs/Teams: Involved in the Rebeca tool development (AFRA) and collaborative projects on CPS security. Grants: Not explicitly listed but implied through project involvement.

• Semantics of programming languages
• Game semantics
• Quantitative semantics
• +5 more

Guy McCusker serves as Professor and Deputy Head of Department in the Department of Computer Science at the University of Bath, where he actively supervises doctoral students and leads research in programming language semantics. His current projects include LMS Scheme 7: Imperative Taylor Expansion (2026-2026) and collaborations with institutions like Aix-Marseille University. His research centers on game semantics, quantitative semantics, and logical approaches to decision-making for information security. Key themes include the mathematical foundations of computation, non-classical logic applications in security policy, and the interplay between category theory and programming language design. His fingerprint analysis reveals strong connections to lambda-calculus (100%), programming language theory (100%), and event calculus (50%). Recent publications demonstrate consistent focus on dinatural transformations, compositionality problems, and history-based logics across top venues like CSL and LIPIcs. His work bridges theoretical computer science with practical security applications through rigorous semantic frameworks. Scientific recognition includes: LICS Test of Time Award (2018) for foundational contributions to game semantics He has secured significant funding from EPSRC, Royal Society, and London Mathematical Society for projects including Games and Differential Nets for Concurrent Systems (2015-2017) and ALPUIS (2013-2018). His supervision portfolio encompasses 9 completed student works with emphasis on programming language theory. McCusker maintains active collaborations with Jim Laird, Alessio Guglielmi, and John Power, recently serving as Visiting Professor at Aix-Marseille University (Nov-Dec 2023). His research group focuses on categorical approaches to computation and security-aware language design.

Lindsey KuperView profile

Assistant Professor

• programming languages
• distributed computing
• concurrency
• +6 more

Lindsey Kuper is an Assistant Professor in the Computer Science and Engineering Department at the Baskin School of Engineering, University of California, Santa Cruz. She received her Ph.D. from Indiana University in 2015 and leads the CASL (Concurrency and Safety Lab) research group, which is part of the larger Languages, Systems, and Data (LSD) Lab. Her research focuses on programming-language-based approaches to building concurrent and distributed software systems that are elegant, correct, and efficient. Key research areas include: Library-level choreographic programming (in Haskell, Rust, and TypeScript) Dependently-typed diagrams for inductive reasoning about concurrent executions Expressing and verifying causal message delivery with refinement types Lindsey's research has been recognized with an NSF CAREER Award, a Stellar Development Foundation Academic Research Grant, a Google Faculty Research Award, and support from Amazon Web Services. Her work on "HasChor: functional choreographic programming for all" received the ICFP 2023 Distinguished Paper Award. She teaches courses in programming languages and distributed systems at UC Santa Cruz, including Foundations of Programming Languages and graduate/undergraduate Distributed Systems. Her undergraduate distributed systems lectures from 2020-2021 have been viewed over 200,000 times on YouTube. Lindsey co-founded the !!Con and !!Con West conferences of ten-minute talks on the joy, excitement, and surprise of computing, and serves on the board of the Exclamation Foundation. She has chaired numerous workshops and served on program committees for major programming languages conferences including PLDI, POPL, ICFP, and OOPSLA. Her current PhD students include Jonathan Castello, Tim Goodwin, Nathan Liittschwager, Patrick Redmond, Gan Shen, and Yan Tong. Recent graduates include Shun Kashiwa (MS, 2024) and Ali Ali (BS, 2024).

Guoqiang LiView profile

Associate Professor

• formal verification
• programming language theory
• zero-knowledge proofs
• +3 more

Dr. Guoqiang Li is an Associate Professor in the School of Computer Science at Shanghai Jiao Tong University, where he conducts research at the intersection of formal methods, programming languages, and security. His academic journey includes prior positions as Assistant Professor (2009-2013) and subsequent promotion to Associate Professor (2014-present) at the same institution. He has held international appointments including a postdoctoral fellowship at Nagoya University (2008-2009), an academic visit at the University of Oxford (2015-2016), and a Guest Associate Professorship at Kyushu University's Research and Development Center for Smart Mobility (2016-2020). Dr. Li earned his B.S. from Taiyuan University of Technology (2001), M.S. from Shanghai Jiao Tong University (2005), and Ph.D. from Japan Advanced Institute of Science and Technology (2008). His educational background reflects a strong foundation in both Chinese and Japanese academic traditions. His research focuses on formal verification, programming language theory, zero-knowledge proofs, knowledge reasoning, and intelligent system verification and security. Over the past decade, his work has evolved from traditional formal methods applied to timed automata and process calculi to contemporary topics including neural network verification, zero-knowledge proof systems, and the application of large language models to program analysis. His publication record demonstrates a clear progression toward addressing verification challenges in increasingly complex modern systems. Dr. Li's recent publications reveal a strategic research trajectory: early work centered on timed automata and formal verification of concurrent systems, while current research addresses the verification of AI systems, zero-knowledge cryptographic protocols, and LLM-enhanced program analysis. This evolution reflects his commitment to applying rigorous formal methods to emerging computational challenges. Distinguished Paper Award at ICSE 2020 for 'Unblind Your Apps: Predicting Natural-Language Labels for Mobile GUI Components by Deep Learning' Consistent publication in top-tier venues including ASE, ICSE, FSE, and OOPSLA Recognition through multiple National Natural Science Foundation of China (NSFC) grants as Principal Investigator Dr. Li actively contributes to the academic community as a Senior Member of the China Computer Federation, Deputy Director of Theoretical Computer Science for the Shanghai Computer Society, and committee member for multiple technical organizations. He serves as Organization Chair for SEKM'20-22 and FMAC'17, Publicity Chair for TASE'21-23, and has participated in program committees for numerous international conferences. His teaching portfolio includes undergraduate and graduate courses in algorithm design, mathematical foundations, and scientific writing, demonstrating his commitment to both theoretical computer science education and practical application.

Engelbert HubbersView profile

Lecturer

• Formal Methods
• Electronic Voting Systems
• Cybersecurity
• +3 more

Engelbert Hubbers is a Lecturer at Radboud University, affiliated with the Digital Security Group within the Institute for Computing and Information Sciences (iCIS). His primary role involves teaching responsibilities across multiple courses such as Mathematical Structures, Formal Reasoning, and Logic and Applications. His research interests focus on formal methods, electronic voting systems, and discrete mathematics, with a particular emphasis on cybersecurity applications like Java Card security and e-passport systems. Engelbert has contributed to significant projects such as the RIES internet voting system and the KOA remote voting system, emphasizing formal verification and secure protocol design. He has held roles in academic governance, including membership in the Exam Committee and Program Committee of iCIS. His work bridges theoretical computer science with practical applications in secure voting technologies and embedded systems. Publications span topics from formal logic in education to cryptographic protocols, reflecting his transition from foundational research (e.g., polynomial automorphisms) to applied security. His teaching includes coordinating courses on formal reasoning, discrete mathematics, and semantics, demonstrating a commitment to both education and cybersecurity innovation.

Anders MøllerView profile

Professor

• Static Program Analysis
• Dynamic Program Analysis
• JavaScript
• +5 more

Anders Møller is a Professor at the Department of Computer Science , Aarhus University , Denmark. His career spans roles as an author , committee member , and session chair in conferences like SPLASH, OOPSLA, ECOOP, ISSTA, ICSE, and PLDI. Affiliation: Aarhus University Co-founder: Coana Research Focus : Specializing in static and dynamic program analysis for JavaScript, TypeScript, Java, and Node.js applications, his work addresses: Pointer analysis precision in Java Race condition detection in Node.js Library evolution and semantic patching Soundness improvements in static analyzers Type safety in modern languages Concolic execution for web testing Publication Trends : Recent work (2021–2024) emphasizes security-critical static analysis (taint specifications, Node.js security), soundness optimization (approximate interpretation), and program verification (channel-based communication). Earlier work (2013–2018) includes foundational contributions to JavaScript refactoring , Dart type safety , and AJAX race detection . Scientific Recognition : ISSTA 2019 Distinguished Paper Award Leadership Roles : Active in steering committees for SPLASH, ECOOP, and SIGPLAN, with chairs in OOPSLA, ECOOP, and PLDI program committees.

Matthew FlattView profile

Professor

• Programming Languages
• Functional Programming
• Language Design
• +3 more

Matthew Flatt is a Professor in the School of Computing at the University of Utah, specializing in programming languages, runtime systems, and functional programming. He is a primary developer of the Racket programming language and focuses on extensible language design and metaprogramming tools. PhD from Rice University (1999) Active in PLDI, ICFP, and OOPSLA program committees Developed Racket's core infrastructure including submodules and chaperones His recent research trends emphasize macro systems, language composition, and runtime engineering for functional languages. Key contributions include Rhombus (2023) for macro usability and SweetPea (2021) for experimental design DSLs.