Find Academic Supervisors

Riadh MunjyView profile

Professor

• Photogrammetry
• Unmanned Aircraft Systems (UAS) Mapping
• Remote Sensing
• +5 more

Riadh Munjy serves as a Professor in Geomatics Engineering at California State University, Fresno's Lyles College of Engineering, where he teaches core courses including CE 205 (Computing in Engineering Analysis), GME 123 (Stereo-Photogrammetry), and GME 125 (Analytical Photogrammetry). His academic foundation includes a Ph.D. in Civil Engineering (1982), M.S. in Applied Mathematics (1981), and M.S.C.E. (1979) from the University of Washington, complemented by a B.S. in Civil Engineering from the University of Baghdad (1976). Ph.D., Civil Engineering, University of Washington (1979-1982) M.S., Applied Mathematics, University of Washington (1980-1981) M.S.C.E., Civil Engineering, University of Washington (1978-1979) B.S., Civil Engineering, University of Baghdad (1972-1976) Professor Munjy's research centers on advancing photogrammetric methodologies with particular emphasis on Unmanned Aircraft Systems (UAS) mapping accuracy, sensor calibration, and novel processing techniques for LIDAR and IFSAR data. His work bridges theoretical mathematics with practical applications in transportation infrastructure, disaster response, and terrain modeling, consistently addressing industry pain points like rolling shutter effects in UAV imagery and LIDAR strip adjustment challenges. He has pioneered standards for GPS-controlled photogrammetry adopted by Caltrans and contributed foundational chapters to the ASPRS Manual of Photogrammetry. Analysis of his 15 most recent publications (2010-2020) reveals a strategic evolution from traditional photogrammetric techniques toward UAS-centric workflows, with increasing focus on automated processing, accuracy validation, and integration of multi-sensor data. His research consistently targets real-world implementation barriers in transportation mapping and corridor projects, demonstrating strong industry relevance through Caltrans collaborations and ASPRS leadership. American Society of Photogrammetry and Remote Sensing Fellow Award (2020) ASPRS Fairchild Award (2014) Caltrans Research Innovation Award (2004) Five School of Engineering Research Excellence Awards (1992, 1996, 1998, 2002, 2003) ASPRS Meritorious Service Awards (1992, 1997) Halliburton Research Award (1992) Professor Munjy's research program has been consistently supported through Caltrans-funded projects including GPS Photogrammetry (2005), UAS Research (2018), and corridor mapping standards development. His advisory impact extends through co-authoring the ASPRS Manual of Photogrammetry and mentoring numerous conference presentations, though formal student lists aren't documented. Current initiatives focus on sUAS data accuracy validation and rolling shutter effect mitigation, positioning his work at the forefront of evolving UAV mapping regulations.

Paul DownenView profile

Assistant Professor

• Programming Languages
• Logic
• Formal Methods
• +5 more

Paul Downen is an Assistant Professor in the Miner School of Computer & Information Sciences at the University of Massachusetts Lowell, where he has been teaching since Fall 2021. His academic journey began with dual Bachelor's degrees in Computer Science and Computer Engineering from Lawrence Technological University in 2010, followed by a Ph.D. in Computer Science from the University of Oregon in 2017. He has also been a visiting researcher at INRIA and Microsoft Research. His educational background includes: Ph.D. in Computer Science (2017), University of Oregon - Eugene, OR Dissertation Title: Sequent Calculus: A Logic and a Language for Computation and Duality B.S. Computer Science (2010), Lawrence Technological University - Southfield, MI B.S. Computer Engineering (2010), Lawrence Technological University - Southfield, MI Dr. Downen's research centers on the intersection of logic and programming languages, with a focus on using logical foundations to improve the efficiency, correctness, and safety of programs and their compilation. His primary research lies in the Curry-Howard correspondence or proofs-as-programs paradigm, exploring how logical principles can inform both program design and compiler optimization. He is particularly interested in duality principles in computation, where he investigates how concepts like functional and object-oriented programming paradigms represent dual perspectives on the same underlying computational processes. His publication record shows a consistent focus on foundational aspects of programming languages, with recent work exploring copatterns, macro systems, evaluation strategies, and the relationship between type systems and machine representation. His research often bridges theoretical concepts with practical implementation, particularly through contributions to the Glasgow Haskell Compiler (GHC). Among his notable achievements are: Best Paper Award (2017) at Programming Languages Design and Implementation (PLDI) Oregon Doctoral Research Fellowship (2017) from the University of Oregon Best Paper Award nomination (2012) at European Joint Conferences on Theory and Practice of Software Best Paper Award nominee (2025) at Trends in Functional Programming Dr. Downen has been instrumental in organizing the Oregon Programming Languages Summer School, expanding its reach to diverse audiences through a "Foundations" lecture series. His teaching portfolio includes courses on Organization of Programming Languages, Assembly Language Programming, and Effective Functional Programming. His research has resulted in practical implementations within GHC, including Sequent Core (an alternative intermediate language based on sequent calculus) and Join Points (an optimization for control flow).

• Quantum Computation
• Quantum Programming
• Formal Methods
• +6 more

Professor Mingsheng Ying (University of Technology Sydney) is a Distinguished Professor specializing in quantum programming , quantum verification , and the foundations of artificial intelligence . He leads the Centre for Quantum Software and Information and co-founded the Quantum Lab . His work bridges quantum computation with formal methods and reasoning under uncertainty. Education : Mathematics, Fuzhou Teachers College (1981) Research Interests His research spans: Quantum programming languages and verification techniques Model checking quantum systems and cryptographic protocols Quantum machine learning robustness Entanglement theory and distributed quantum computation Recent Publications Key contributions include: Quantum error correction verification frameworks Quantum register machine architecture Hamiltonian simulation parallelization Symbolic execution for quantum debugging Robustness tools like VeriQR Awards & Editorial Roles NSF China Distinguished Young Scholar Award (1997) China National Science Award (2008) Co-Editor-in-Chief, ACM Transactions on Quantum Computing Vice President, International Fuzzy Systems Association (2005) Leadership & Grants He oversees 14 active grants (2010–2029) from: Australian Research Council (ARC Discovery Projects) National Natural Science Foundation of China Sydney Quantum Academy Baidu Contract Research His grants fund research in quantum program verification, entanglement classification, and distributed quantum protocols.

• Quantum computation
• Quantum information
• Quantum algorithms
• +3 more

Nengkun Yu is an Associate Professor at the Centre for Quantum Software and Information (QSI), within the Faculty of Engineering and Information Technology (FEIT) at the University of Technology Sydney (UTS). He holds an Adjunct Fellowship at the same research center and maintains an active research profile in quantum computing and quantum information theory. Dr. Yu received his BS and PhD from the Department of Computer Science and Technology at Tsinghua University in Beijing, China, in 2008 and 2013, respectively. His academic journey has led him to become a prominent researcher in quantum computing, with a focus on quantum algorithms, quantum programming, and quantum information theory. Dr. Yu's research interests span multiple areas within quantum computing, with particular emphasis on quantum algorithms, quantum programming languages, quantum verification, and quantum information theory. His work bridges theoretical foundations with practical applications in quantum software development. He has made significant contributions to understanding quantum state tomography, quantum error correction, quantum network protocols, and quantum program verification. Analysis of Dr. Yu's recent publications reveals a strong focus on fundamental aspects of quantum computing, particularly quantum algorithms, quantum program verification, and quantum information theory. His work often combines theoretical rigor with practical implications for quantum software development and quantum network design. A notable trend in his research is the development of verification methods for quantum programs, which is crucial for the reliability of future quantum computing systems. Chris Wallace Award for Outstanding Research (2021) J G Russell Award (2018) Dr. Yu actively supervises research students and has received significant research funding, including an ARC DECRA Fellowship and multiple ARC Discovery Projects. His funded research focuses on quantum property testing, quantum algorithms, and reasoning about quantum programs. He collaborates extensively with researchers across institutions on topics ranging from quantum networking to quantum software engineering. As a member of the Centre for Quantum Software and Information at UTS, Dr. Yu contributes to one of Australia's leading quantum research groups. The center focuses on developing the software and algorithms necessary for future quantum computers, with applications in cryptography, optimization, and simulation.

• Formal Verification
• Programming Languages
• Certified Programming
• +7 more

Bas Spitters is affiliated with Aarhus University and is an active researcher in the fields of formal verification, programming languages, and certified software systems. His work centers on applying proof assistants like Coq to ensure correctness in smart contracts, cryptographic implementations, and compilers. His research interests include: Formal Verification of Software and Protocols Smart Contracts and Decentralized Finance (DeFi) Verified Compilation and Compiler Correctness Cryptography and Zero-Knowledge Proofs Proof Assistants and Theorem Proving Secure and High-Performance Systems The recent publications highlight a consistent focus on end-to-end verification of critical systems, particularly in blockchain and cryptography. His work often bridges theoretical foundations with practical implementation, aiming to produce high-assurance, executable code through extraction from formal proofs. There is a strong emphasis on using Coq for building certified tools and frameworks. Bas Spitters has no listed scientific awards in the provided text. He has not been mentioned as advising any students in the provided data. There is no mention of grants or funding sources. His research appears to be conducted within a collaborative academic environment focused on programming language theory and formal methods. No specific lab or research team is named, but his contributions to the CPP conference series suggest involvement in the broader formal methods and certified programming community.

William ManskyView profile

Assistant Professor

• Program Verification
• Concurrency
• Theorem Proving
• +7 more

William Mansky is a faculty member in the Department of Computer Science at the University of Illinois Chicago, College of Engineering. He is actively engaged in research in formal methods, program verification, and programming languages. His work focuses on applying theorem proving and separation logic to verify concurrent and systems software, particularly under relaxed memory models. His research interests include: Program Verification Concurrency and Parallelism Theorem Proving (especially using Iris and Coq) Language Semantics Compiler and Systems Verification Memory Models and Race Detection The recent articles indicate a strong trend in mechanized verification of low-level systems code, compositional reasoning for concurrent programs, and integration of formal methods with practical software like CompCert and CUDA. His work often bridges theoretical logic with real-world implementation challenges. He has served on program committees for premier conferences including POPL, CPP, and CoqPL, and has chaired sessions on weak memory and program logics. He also contributes to open-source formal verification projects on GitHub, including Coq-related packages and the Iris framework. Notable roles: Program Committee Member – POPL, CPP, CoqPL Session Chair – POPL (Weak Memory and Concurrent Separation Logic) Artifact Evaluation Committee – POPL William Mansky leads a research lab at UIC, accessible at https://mansky.lab.uic.edu/ , where he supervises research in formal verification and programming language theory.

Kenneth M. HopkinsonView profile

Professor

• Cybersecurity
• Networking
• Smart Grid Protection
• +12 more

Dr. Kenneth M. Hopkinson is a Professor of Computer Science and Head of the Department of Electrical and Computer Engineering at the Air Force Institute of Technology (AFIT) in Dayton, Ohio. He holds a Ph.D. and M.S. from Cornell University and a B.S. from Rensselaer Polytechnic Institute, all in Computer Science. He is a Senior Member of IEEE and ACM, reflecting his active engagement in the academic and professional communities. Ph.D., Computer Science, Cornell University, 2004 M.S., Computer Science, Cornell University, 2002 B.S., Computer Science, Rensselaer Polytechnic Institute, 1997 Dr. Hopkinson's research focuses on cybersecurity, networking, smart grid protection, critical infrastructure, and sensor fusion. His work integrates formal methods, machine learning, and distributed systems to enhance the reliability and security of cyber-physical systems. He has pioneered research in trust management, agent-based protection systems, and formal verification of safety-critical software. His recent publications highlight a strong trend in applying machine learning to hardware security, formal verification of algorithms, and resilience in critical infrastructure using social sensing. These works span domains from FPGA Trojan detection to SPARK-based verification of sorting algorithms, indicating a multidisciplinary approach that bridges theory and practical defense applications. Best Student Paper Award Winner, 15th International Command and Control Research and Technology Symposium (ICCRTS), 2010 Dr. Hopkinson has secured significant research funding and leads projects involving simulation, wargaming, and critical infrastructure protection. He has mentored numerous students through collaborative research, though formal advisee lists are not provided. He is actively involved in major research initiatives, including the EPOCHS simulation platform for power and communication systems. He has also contributed to book chapters and edited volumes on avionics cybersecurity and cyber-physical systems. He leads or contributes to research teams focused on cognitive radio networks, secure SCADA systems, and space applications. His work often involves interdisciplinary collaboration with electrical engineers, computer scientists, and defense analysts. Labs under his oversight likely include those in cybersecurity, network simulation, and hardware security, supporting both academic and military applications.

• Programming Languages
• Formal Methods
• Logic in Computer Science
• +9 more

Dmitriy Traytel is an Associate Professor in the Department of Computer Science at the University of Copenhagen, affiliated with the Software, Data, People & Society research section. His work bridges formal methods, programming languages, and runtime verification, with a strong emphasis on correctness and efficiency. His research focuses on the logical and formal foundations of programming systems, including syntax with bindings, higher-order logic, type systems, and temporal logics. He develops verified tools and frameworks for runtime monitoring, policy enforcement, and query evaluation, often using interactive theorem provers like Isabelle/HOL. His recent publications demonstrate a consistent contribution to top venues such as POPL, CAV, and TACAS. The trends in his recent articles show a deep engagement with runtime verification , particularly in developing explainable , efficient , and first-order monitoring techniques. He combines theoretical rigor with practical tool building, as seen in systems like WHYMON and TimelyMon. His work often intersects with security policies, functional programming, and formal semantics. He has not been mentioned in the text as receiving scientific awards, but his publication record in premier venues indicates high scholarly impact. While no students are explicitly listed, his role as an Associate Professor and active researcher suggests involvement in advising. There is no mention of specific grants, but his participation in a Promotion Programme implies institutional support. He is part of a vibrant research environment within the Department of Computer Science, which is involved in the SCIENCE AI Centre, suggesting interdisciplinary collaboration potential. Traytel maintains a personal website and ORCID profile, and his contact information is publicly available. He is actively contributing to the research output of the department, with 59 recorded publications, including journal articles and conference proceedings.

Erez PetrankView profile

Professor

• Concurrent Computing
• Programming Languages
• Memory Management
• +5 more

Erez Petrank is a Professor at the Department of Computer Science , Technion - Israel Institute of Technology , where he holds the Andrew and Erna Viterbi Chair. His research focuses on concurrent computing , programming languages , and systems with an emphasis on memory management . Additional interests include parallelism , cryptography , data structures , approximation algorithms , and distributed computing . Research Trends Recent publications highlight his work on safe memory reclamation (ERA Theorem, VBR), lock-free data structures (queues, stacks, B+ Trees), and persistent memory algorithms (NVTraverse, Mirror). These works span concurrent computing , distributed systems , and memory efficiency in multi-threaded environments. Scientific Awards Distinguished Paper Award at Euro-Par 2015 Contact Information Email: erez@cs.technion.ac.il Office: Taub 528, Technion Phone: +972-73-378-4942

• Formal Methods
• Verification
• Probabilistic Systems
• +7 more

Christoph Matheja is a Professor at the University of Oldenburg , where he leads the Theory of Correct Systems group. Additionally, he holds an Associate Professor position in the Software Systems Engineering section at the Technical University of Denmark . His research focuses on formal methods and verification, particularly for probabilistic and heap-manipulating systems. His work spans quantitative verification , probabilistic programs , separation logic , and static analysis using graph grammars . Recent research includes the development of the LogPPL tool for probabilistic process mining and a game-based semantics for the HeyVL verification language. Matheja has also contributed to PC committees for conferences like ESOP 2026, LICS 2026, and CAV 2025. He previously held a postdoctoral position at ETH Zürich under Peter Müller and completed his PhD at RWTH Aachen under Joost-Pieter Katoen.

• Verification
• Cyber-Physical Systems
• Formal Methods
• +1 more

Chiao Hsieh is a Program-Specific Assistant Professor in the Computer Software Group at Kyoto University, Japan. Their research focuses on verification, cyber-physical systems, formal methods, and testing. Chiao Hsieh's research interests include: Verification Cyber-Physical Systems Formal Methods Testing Chiao Hsieh's publication record demonstrates expertise in developing verification techniques for complex systems. Their work spans from distributed robotics applications (Koord language framework) to safety contracts for machine learning systems, showing a consistent focus on applying formal methods to ensure system correctness in safety-critical domains. The research shows strong connections between programming languages theory and practical robotics/ML applications. Chiao Hsieh has served on program committees for major conferences including: SPLASH 2026 (OOPSLA Review Committee) ATVA 2025 (Artifact Evaluation Committee) ECOOP 2022 (Extended Review Committee and Artifact Evaluation Committee) These committee roles demonstrate recognition within the programming languages and formal methods research community.

Mayur NaikView profile

Professor

• Programming Languages
• Artificial Intelligence
• Neurosymbolic Programming
• +5 more

Mayur Naik is the Misra Family Professor in the Department of Computer and Information Science at the University of Pennsylvania’s School of Engineering and Applied Science. His research lies at the intersection of programming languages and artificial intelligence, with a current focus on neurosymbolic programming, trustworthy AI for healthcare, and AI-enabled software engineering tools. Education & Career: Ph.D. in Computer Science, Stanford University (2008) – advisor Alex Aiken M.S. in Computer Science, Purdue University (2003) – advisor Jens Palsberg B.E. in Computer Science, BITS Pilani (1999) Former faculty at Georgia Institute of Technology and researcher at Intel Labs, Berkeley Research Interests: Naik’s group develops languages, algorithms, and compilers for neurosymbolic programming, an emerging paradigm that unites symbolic reasoning with data-driven learning. Their flagship system is the open-source Scallop language and toolchain, applied to computer vision, cybersecurity, medicine, and bioinformatics. He also investigates AI-assisted programming tools that boost productivity and software quality by marrying traditional program analysis with modern machine learning. Recent Highlights: In 2024 he was named Misra Family Professor; his former student Elizabeth Dinella received the 2025 ACM SIGSOFT Outstanding Dissertation Award; his team released IRIS , an LLM-assisted static analysis framework for security vulnerabilities, and published the first comprehensive book on Neurosymbolic Programming in Scallop . Teaching: He regularly teaches CIS 5470 (Software Analysis) every Fall and CIS 5500 (Database Systems) every Spring, both of which are also delivered in Penn’s MCIT Online and Georgia Tech’s OMSCS programs. Advising & Service: Naik has graduated 8 Ph.D. students and mentored numerous postdocs and undergraduates; many alumni now hold faculty or research positions worldwide. He has served on organizing, program, and steering committees for premier venues such as PLDI, POPL, OOPSLA, SPLASH, ESEC/FSE, ISSTA, SAS, and others.

Ambros GleixnerView profile

Professor

• Mathematical Optimization
• Operations Research
• Computational Mathematics
• +7 more

Ambros Gleixner is a Professor at HTW Berlin since 2020 and an affiliated researcher at the Zuse Institute Berlin (ZIB) since 2008. His research focuses on computational aspects of mixed-integer linear and nonlinear programming, with emphasis on exact rational arithmetic and algorithm verification. PhD in Mathematics (2015), Technische Universität Berlin Diplom (MSc) in Mathematics (2008), Technische Universität Berlin Vordiplom (BSc) in Mathematics (2004), Universität Bayreuth His work spans mathematical optimization, operations research, and computational mathematics. At ZIB, he leads projects like developing the MINLP solver SCIP , the LP solver SoPlex , and verifying integer programming results through VIPR . Recent publications highlight advancements in exact rational MIP, GPU-parallel algorithms, and energy system optimization. Scientific Awards : MERIT Visiting Scholar at University of Melbourne (2013) Teaching : Offers bachelor's theses in optimization and computational mathematics. Requires students to have attended relevant seminars and possess programming skills. Office hours by email appointment through Ambros.Gleixner@HTW-Berlin.de . Labs & Teams : Principal investigator at ZIB's Mathematical Algorithmic Intelligence division, Research Campus MODAL , and Linear, Integer, and Constraint Programming project.

Surya MathialaganView profile

Research Fellow

• Theoretical Computer Science
• Cryptography
• Algorithms
• +3 more

Surya Mathialagan is a Research Fellow at the University of California, Berkeley 's Simons Institute . He will join NTT Research (CIS Lab) as a postdoctoral researcher in the fall. His research spans algorithms , theoretical cryptography , and computational complexity , with applications in blockchain verification and secure computation. Education: PhD in Theoretical Computer Science from Massachusetts Institute of Technology , advised by Vinod Vaikuntanathan and Virginia Vassilevska Williams . Research Interests focus on indistinguishability obfuscation, zero-knowledge proofs, and cryptographic protocols. His work addresses challenges in succinct verifiable computation , LWE-based security , and graph algorithm optimization . Recent publications at FOCS 2025 and Crypto 2025 explore obfuscation efficiency and adaptive proof systems. Scientific Awards include the Best Young Researcher Award at TCC 2023. His collaborations with experts like Abhishek Jain and Omer Paneth highlight interdisciplinary contributions.

Andrew HeadView profile

Assistant Professor

• Human-computer interaction
• Programming tools
• Interactive reading systems
• +4 more

Andrew Head is an Assistant Professor in the Department of Computer and Information Science at the University of Pennsylvania's School of Engineering and Applied Science. He leads research on interactive reading and reasoning systems, working closely with Benjamin Pierce from PLClub and Chris Callison-Burch from PennNLP. He co-leads the Penn Human-Computer Interaction (Penn HCI) group alongside Danaé Metaxa and serves as a faculty affiliate for Penn's MindCORE center. His research focuses on developing technology for interactive reading and reasoning, with specific goals of helping scientists get more from their readings, making mathematical notation understandable, assisting programmers with AI comprehension tools, and accelerating programmers in writing correctness proofs. His group follows a systems-centric HCI approach, conducting in-depth user studies followed by building interactive systems that are published at top venues like ACM CHI and UIST. His publication record shows strong focus on human-computer interaction applied to programming environments, reading systems, and mathematical notation. Recent work demonstrates growing integration of AI techniques into interactive systems, particularly for code explanation and document augmentation. His research bridges theoretical programming language concepts with practical user needs. Best Paper Award, ICSE 2024 for Property-Based Testing in Practice Best Paper Award, CHI 2023 for CiteSee Nominated for Best Paper Award, CHI 2023 for Colaroid $1M NSF grant for Property-based Testing for the People project (2024) Professor Head advises multiple PhD students including Alyssa Hwang, Litao Yan, Hita Kambhamettu, Jeff Tao, Jessica Shi, and Xiaorui Liu. His group works closely with PLClub and PennNLP researchers, and he has secured significant funding including a $1M NSF grant. His lab develops working interactive systems that emerge from thorough user studies, focusing on practical applications of HCI research.