Find Academic Supervisors

Adam ChlipalaView profile

Professor

• Programming Languages
• Formal Methods
• Computer Systems
• +12 more

Adam Chlipala is the Arthur J. Conner (1888) Professor of Computer Science at the Massachusetts Institute of Technology (MIT), where he is a faculty member in the Department of Electrical Engineering and Computer Science (EECS), the Computer Science and Artificial Intelligence Laboratory (CSAIL), and leads the Programming Languages & Verification Group. He has been a faculty member at MIT since 2011, following a postdoctoral position at Harvard University. PhD in Computer Science, UC Berkeley (2007) BS in Computer Science, Carnegie Mellon University (2003) His research lies at the intersection of programming languages and formal methods, with a strong emphasis on using the Coq proof assistant to build verified compilers, cryptographic systems, and hardware-software stacks. His work spans from high-level language design to gate-level hardware verification, aiming for end-to-end correctness proofs. Recent efforts focus on high-performance parallel computing systems with full formal assurance. The 15 most recent publications highlight a consistent trend in verified compilation, cryptographic security, hardware verification, and tensor/ML program optimization. His work increasingly integrates software and hardware verification, emphasizing modular, extensible frameworks and end-to-end correctness. Key themes include side-channel resistance, automated proof techniques, and practical deployment of formally verified systems. Advisory Board Member, BlueRock Systems (formerly BedRock Systems) Member, DARPA Information Science and Technology (ISAT) Study Group (2018–2022) Advisory Board Member, SiFive Former Advisor, krypt.co (acquired by Akamai) Chlipala has advised numerous PhD and Master’s students and regularly teaches core MIT courses such as 6.009 (Fundamentals of Programming), 6.042 (Mathematics for Computer Science), and 6.822/6.5120 (Formal Reasoning About Programs). He is the author of the widely used textbook Certified Programming with Dependent Types and co-developer of the FRAP (Formal Reasoning About Programs) educational materials. He is also the founder of Nectry, a startup based on Ur/Web and UPO, aiming to democratize enterprise application development through AI-assisted, type-safe programming. His research group develops tools and frameworks for modular verification, verified compilation, and formal analysis of complex digital systems. The work is deeply collaborative, involving students, industry partners, and open-source contributions via GitHub. Projects like Fiat Cryptography have been deployed in major web browsers, demonstrating real-world impact.

Benjamin KaminskiView profile

Professor

• Formal Verification
• Probabilistic Programs
• Quantitative Verification
• +12 more

Benjamin Kaminski is a Professor at Saarland University and a Lecturer at University College London, where he contributes to the field of computer science with a strong emphasis on formal verification and logic. He is currently the Head of the Examination Board for the B.Sc. in Computer Science (English) program at Saarland University and actively supervises PhD, Master’s, and Bachelor’s students in research projects related to logic and verification. His research centers on the quantitative aspects of formal program verification , particularly in probabilistic and quantum programs. Key interests include weakest-precondition reasoning, expected runtimes, incorrectness logic, and the integration of machine learning with formal methods. He advocates for explainable verification and explores non-classical models such as weighted programming. His recent publications reflect a consistent focus on probabilistic semantics , runtime analysis , and deductive verification of programs, utilizing formal logic and mathematical structures to ensure correctness and efficiency. These works span high-impact venues such as POPL, LICS, and JACM. Ackermann Award for outstanding dissertations 2020 Distinguished Paper at POPL 2021 Best Paper Award at LOPSTR 2020 EATCS Best Paper Award at ESOP 2016 Borchers Badge for doctoral distinction 2019 Best scientific production award at Université Paris-Saclay 2022 Benjamin Kaminski has advised numerous students at various levels, including current PhD candidates Tobias Gürtler, Lena Verscht, Anran Wang, and Linpeng Zhang. He has served on program committees for top conferences such as POPL, CAV, LICS, and ICALP, and has reviewed for prestigious journals including Journal of the ACM and TOPLAS . He has also evaluated research proposals for the Israel Science Foundation and Czech Science Foundation, highlighting his role in shaping global research agendas. His editorial work includes contributions to Foundations of Programming and Software Systems (2019). He is actively involved in the formal methods research community, contributing to workshops and symposia on static analysis, dependable software engineering, and quantitative evaluation of systems. His leadership in organizing and reviewing for major conferences underscores his influence in theoretical computer science.

• Theoretical Computer Science
• Formal Methods
• Automata Theory
• +7 more

Ismaël Jecker is a tenured Associate Professor in the Department of Computer Science at Université de Franche-Comté, affiliated with the Vesontio research team. He previously held postdoctoral positions at the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics, University of Warsaw (2021–2023), and at the Institute of Science and Technology Austria (IST Austria) in the Chatterjee group (2019–2021). His educational background includes a PhD in Computer Science from Université libre de Bruxelles (ULB) (2014–2019), supervised by Emmanuel Filiot and Jean-François Raskin, and undergraduate studies in Mathematics at École Polytechnique Fédérale de Lausanne (EPFL). Jecker's research focuses on theoretical computer science, particularly automata theory, formal methods, verification, transducers, weighted automata, and game semantics. His work bridges logic, computation, and algebraic structures, with applications in program verification and formal language processing. He investigates expressiveness, determinization, complexity, and equivalence problems in various automata models. His recent publications, appearing in top venues like LICS, CONCUR, MFCS, and STACS, show a consistent trend toward understanding computational models with quantitative features—such as counting, bidding, and delays—and their algorithmic properties. Themes include reachability in vector addition systems, determinization of weighted automata, and strategic reasoning in graph games with partial observability. Best Paper Award, MFCS 2021 – A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct Jecker has collaborated widely with leading researchers in formal methods, including Emmanuel Filiot, Wojciech Czerwiński, Krishnendu Chatterjee, and Christof Löding. While no formal advising or grant information is listed, his extensive publication record and collaborations suggest active mentorship and research leadership. He is a core member of the Vesontio team, which focuses on foundational aspects of computer science, including automata, logic, and verification.

• Programming Languages
• Type Systems
• Software Verification
• +4 more

Lecturer Ben at Northeastern University's College of Engineering has taught diverse computer science courses from 2012 to 2025, including CS 7396: Seminar: Types, Inference, and Proof Search , CS 4470: Compilers , and CS 6110/5110: Software Verification . His work emphasizes programming language design, verification tools, and human factors in software systems. Research trends include: Language support for tabular data Curry-Howard isomorphism applications Compiler implementation techniques He has mentored students through courses like CS 3520/6520: Programming Languages and co-taught CS 4500: Software Development with Matthew Flatt. Ben's teaching philosophy incorporates hands-on projects, collaborative coding (e.g., pair programming), and cultural experiences like Zardoz screenings during his TA tenure at Cornell.

Pedro Jose Sousa Da FonsecaView profile

Assistant Professor

• Computer Security
• Operating Systems
• Distributed Systems
• +3 more

Pedro Jose Sousa Da Fonseca is an Assistant Professor in the Department of Computer Science at Purdue University, where he leads the Reliable and Secure Systems Lab. His research focuses on building reliable and secure systems, particularly in core software components like operating systems, hypervisors, and distributed systems. He joined Purdue in Fall 2018 and has received awards including the NSF CAREER Award and Google Faculty Research Awards. Education: PhD from Max Planck Institute for Software Systems and University of Saarland (advised by Rodrigo Rodrigues), postdoc at University of Washington (with Arvind Krishnamurthy, Hank Levy). Research interests span system reliability, security, and concurrency testing. His work includes frameworks like MultiNyx for hypervisor analysis, SKI for kernel bug detection, and KARD for data race detection. Teaching includes courses on Operating Systems (CS503), Reliable and Secure Systems (CS592), and Software Testing (CS408). Active in academic service as PC member for OSDI, EuroSys, and SOSP. Advises PhD students on topics like kernel testing, serverless computing, and confidential cloud systems. Awards: NSF CAREER Award (202?), Google Faculty Research Award, Google Research Scholar Award. Over 30 publications in top venues like SOSP, OSDI, EuroSys, and ASPLOS. Collaborations with institutions like MPI-SWS, University of Washington, and industry partnerships with Google.

Bartek KlinView profile

Associate Professor

• Computation Theory with Atoms
• Operational Semantics
• Coalgebraic Methods
• +3 more

Bartek Klin is an Associate Professor in the Department of Computer Science at the University of Oxford and a Tutorial Fellow at University College. His research focuses on foundational aspects of computation theory, including nominal techniques, coalgebraic methods, and formal verification. Key areas include computation with atoms (nominal sets), operational semantics of programming languages, and algebraic specifications. He has supervised several PhD students, including Zev Shirazi and Jingjie Yang, and previously advised Joanna Fijalkow, Michał Szynwelski, and Jędrzej Kołodziejski. His work bridges theoretical computer science with practical formal methods, emphasizing automata theory and modal logics. Dr. Klin serves as Editor-in-Chief of Fundamenta Informaticae and has contributed to over 50 peer-reviewed publications since 2003, with recent work on polyregular functions, orbit-finite vector spaces, and μ-calculus extensions.

• Cryptography
• Quantum Information
• Secure Protocol Design
• +3 more

Dakshita Khurana is an Associate Professor of Computer Science at the University of Illinois, Urbana-Champaign (UIUC), affiliated with the College of Engineering and the Department of Computer Science. Her research focuses on cryptography and its intersection with quantum information, particularly secure protocol design, zero-knowledge proofs, and quantum-resistant cryptographic systems. Education: She earned her PhD from UCLA, where she received the UCLA Dissertation Year Fellowship and Outstanding PhD Student Award. Her thesis work was also recognized with awards from Symantec and Cisco. Research Interests: Her work explores cryptographic foundations, quantum cryptography, secure computation, and the application of quantum hardness to theoretical computer science. Notable contributions include advances in non-malleable protocols, succinct proofs, and quantum-secure encryption frameworks. Awards: Khurana has received prestigious recognitions including the NSF CAREER Award, Google Research Scholar Award, IIT Delhi GOLD Alumni Award, and was named to Forbes' 30 Under 30 in Science. Her research has been funded by NSF, AFOSR, DARPA, and industry grants. Teaching: She has been consistently ranked as an Excellent Teacher at UIUC for multiple semesters, teaching courses such as Quantum Cryptography, Topics in Cryptography, and Cryptography. Her courses emphasize foundational concepts and cutting-edge research. Service: Khurana serves on program committees for top venues like STOC, CRYPTO, and TCC. She co-chairs the Midwest Crypto Day and contributes to initiatives like the Quantum Cryptography Workshop at Asiacrypt.

Swarup BhuniaView profile

Professor

• Hardware Security
• IoT Systems
• Adaptive Computing
• +4 more

Dr. Swarup Bhunia is the Semmoto Endowed Professor and Director of the Warren B. Nelms Institute for the Connected World at the University of Florida's Department of Electrical and Computer Engineering. He leads the Nanoscape Lab, focusing on hardware security, IoT systems, and wearable devices. His research spans adaptive computing, food safety detection using NQR spectroscopy, and AI-driven hardware security frameworks. Education: PhD in Electrical Engineering, Purdue University (2005) MTech in Computer Science, Indian Institute of Technology (1997) BE in Computer Science, Jadavpur University (1995) Research Interests: Hardware and systems security IoT-driven healthcare and environmental monitoring Energy-efficient computing architectures Anti-counterfeiting and authentication systems His lab develops technologies like wearable health sensors, bee behavior monitoring systems, and secure edge devices. Recent projects include the 'SAMURAI' AI protection framework and NQR-based substance authentication. Scientific Awards: 2024 IEEE Fellow & UFRF Professorship 2013 IBM Faculty Award and Schroeder Chair Professorship NSF CAREER Award (2011) Advising & Grants: Mentor to students like Rohan Reddy Kalavakonda (Attributes of a Gator Engineer Award) and Sudipta Paria (Graduate Research Excellence) Recipient of grants from IBM, NSF, and the Semiconductor Research Corporation His work includes collaborative initiatives like the Cade Museum's microelectronics education program and the Nelms IoT Conference. Labs & Teams: Nanoscape Lab: Specializes in secure IoT systems and hardware IP protection Warren B. Nelms Institute: Leads industry-academia partnerships in connected technologies Current projects include drone-based battery charging (D2DC) and 'BoW' mobile battery systems for EVs.

Saman P. AmarasingheView profile

Professor

• High-Performance Computing
• Compilers
• Domain-Specific Languages
• +3 more

Professor Saman P. Amarasinghe is a renowned academic in the Department of Electrical Engineering and Computer Science at MIT, leading the Commit compiler group within CSAIL. His research focuses on high-performance domain-specific languages (DSLs) and compilers, addressing the end of Moore's Law by optimizing software efficiency. He pioneered tools like Halide, Simit, and Taco, which are industry-adopted for image processing and sparse systems. Additionally, he co-founded Determina (acquired by VMware) and is the faculty director of MIT Global Startup Labs, fostering entrepreneurship globally. Education: B.S., Electrical Engineering and Computer Science, Cornell University (1988) M.S., Electrical Engineering, Stanford University (1990) Ph.D., Electrical Engineering, Stanford University (1997) Research Interests: High-performance computing, domain-specific languages (DSLs), compilers with machine learning integration, and compiler optimization techniques. His work emphasizes practical applications in image processing, graph analytics, and tensor algebra. Awards: ACM Fellow (2019) Teaching & Mentorship: Courses include 6.172 (Performance Engineering) and project-based labs. His mentorship supports over 20 startups through Global Startup Labs. Labs & Projects: Leads the Commit Group and contributes to frameworks like GraphIt and OpenTuner. Collaborates on industry projects such as the Tensor Algebra Compiler (TACO).

David BrumleyView profile

Professor

• Software Security
• Formal Methods
• Cryptography
• +5 more

David Brumley is a Professor of Electrical and Computer Engineering at Carnegie Mellon University with a courtesy appointment in the Computer Science Department. He previously served as Director of CyLab, CMU's Security and Privacy Institute, from 2015 to 2017. His research focuses on developing systems that automatically check software for exploitable bugs using program analysis with security-specific properties. Brumley received his Ph.D. in Computer Science from Carnegie Mellon University, an MS in Computer Science from Stanford University, and a BA in Mathematics from the University of Northern Colorado. Before his academic career, he served as a Computer Security Officer for Stanford University from 1998-2002. Brumley's research focuses on software security techniques that provide users with guarantees. His work sits at the intersection of model checking, formal methods, compilers, and logic, all applied to security problems. He develops efficient symbolic execution, reasoning about bit-level arithmetic in finite fields, sound decompilation, and decision procedures. His research also extends to network security and applied cryptography, focusing on efficient protocols, signature schemes, and privacy-preserving cryptography. A key aspect of his work involves binary code analysis, which allows reasoning about the security of code that actually executes. Brumley's publication record shows a consistent progression from theoretical foundations in program analysis to practical security systems. His work spans symbolic execution, fuzzing, exploit generation, and binary analysis. The Mayhem Cyber Reasoning System, which won the DARPA Cyber Grand Challenge, represents the culmination of his research vision for automated vulnerability detection and patching. His publications demonstrate how theoretical advances in program analysis can be translated into real-world security tools. USENIX Security Best Paper Awards (2003, 2007) International Conference on Software Engineering Distinguished Paper Award (2014) NSF CAREER Award (2010) United States Presidential Early Career Award for Scientists and Engineers (PECASE) (2010) Sloan Foundation Award (2013) DARPA Cyber Grand Challenge Winner ($2,000,000) (2016) Brumley has mentored numerous PhD students who have gone on to successful careers in academia and industry, including co-founders of ForAllSecure. He served as faculty mentor for the CMU Hacking Team Plaid Parliament of Pwning (PPP), which has been ranked #1 internationally and won DefCon 2013. His research has been supported by significant grants including DARPA programs and the NSF CAREER award. He also runs PicoCTF, an annual computer security contest for high school students that has become one of the largest cybersecurity education initiatives of its kind. Brumley leads the development of security systems through both academic research and commercialization. He is the CEO of ForAllSecure, which commercializes the Mayhem system developed through his academic research. His work bridges the gap between theoretical security research and practical security tools used by industry, creating a pipeline from academic innovation to real-world impact.

William RegliView profile

Professor

• Artificial Intelligence
• Robotics
• Computational Modeling
• +9 more

William Regli is a Professor at the University of Maryland's Clark School of Engineering, holding appointments in Computer Science, Electrical and Computer Engineering, and the Institute for Systems Research. He also directs the Applied Research Laboratory for Intelligence and Security (ARLIS), overseeing over 75 researchers focused on defense and intelligence challenges. Regli's career spans academia, government leadership (including DARPA's Defense Sciences Office), and industry, with over 250 publications and five foundational U.S. patents in 3D CAD search. His research integrates AI, robotics, and computational modeling to address interdisciplinary problems in engineering, materials science, and national security. Education: Ph.D. and B.S. in Mathematics from the University of Maryland and Saint Joseph's University, respectively. He is a Fellow of AAAS and IEEE, recognized for contributions to 3D search and intelligent manufacturing. Research interests include AI agents, cyber-infrastructure for engineering data sustainability, advanced materials design, and robotic interoperability using category theory. His recent work emphasizes applying AI to national security, including trustworthy AI evaluation and social science integration. Awards include the DARPA Meritorious Public Service Medal (2018), AAAS Fellowship (2020), and IEEE Fellowship (2017). His articles reflect a focus on multi-agent systems, robotic task planning, and formal methods in autonomous systems. He advises multiple PhD students and has spun off two tech startups. Regli's laboratories include ARLIS, where he develops solutions for defense missions, and collaborates with the Maryland Robotics Center. His work bridges academia and government, emphasizing real-world impact through innovative computing research.

Laure DaviaudView profile

Associate Professor

• Formal Verification
• Automata Theory
• Models of Computation
• +4 more

Laure Daviaud is an Associate Professor in the School of Computing Sciences at the University of East Anglia (UEA). She holds associate membership in the Algebra, Number Theory, Logic, and Representations (ANTLR) group and the Computational Biology team, and is a member of UEA's Data Science and AI initiatives. Her academic background includes a Doctor of Philosophy from IRIF - CNRS/Université de Paris, focusing on the asymptotic behavior of min-plus and max-plus automata (2014). Her research interests center on Formal Verification, Automata Theory, Logic, Automata Learning, and Decidability. Recent work explores decidability questions in max-plus automata, probabilistic automata containment, and neural network analysis. She has contributed to quasi-polynomial lower bounds for parity games and the study of counting mechanisms in ReLU RNNs. Current projects include the Engineering and Physical Sciences Research Council-funded 'Learning, Approximating and Minimising Streaming Automata for Large-scale Optimisation' (2023–2024). She collaborates internationally, including as a Visiting Research Fellow at City, University of London since 2023. Her publications span over 25 peer-reviewed articles, with recent focus on weighted automata, max-plus algebra, and formal methods. She actively participates in program committees for conferences like ICALP and FoSSaCS, and delivers invited talks at events such as Highlights of Logic, Games and Automata.

Stephen ChangView profile

Assistant Professor

• Programming Languages
• Type Systems
• Language-Oriented Programming
• +5 more

Stephen Chang is an Assistant Professor in the Department of Computer Science at the University of Massachusetts Boston, affiliated with the PLT Research Group. His research focuses on programming languages, particularly type systems and language-oriented frameworks for creating extensible languages. He has contributed to foundational work on macro-extensible type systems, lazy evaluation semantics, and tools like Typed Rosette. His teaching spans courses in programming languages, formal languages, and computational theory. Chang holds a PhD in Computer Science from Northeastern University, where his dissertation explored the relationship between lazy and strict evaluation models. Research interests include advancing typed language design through macros, enabling flexible domain-specific extensions while maintaining soundness. Notable projects include Turnstile+, a Racket-based framework for building typed DSLs, and contributions to the Rosette solver-aided programming language. His work bridges theory and practice, with applications in formal verification, educational tools like ProofViz, and industry collaborations. Key publications include foundational papers on type systems as macros (POPL 2017/2020), lenient symbolic execution (POPL 2018), and lazy evaluation profiling (POPL 2014). Chang has advised multiple students in research roles, including Sloan IDS Fellow Chantelle Boateng and industry professionals like Kyle Clapper (Jabra) and Vishesh Yadav (Apple). Awards include the Best Student Paper Award at TFP 2010 for work on control stack evaluation. His teaching portfolio spans over a decade, covering theory of computation, programming paradigms, and formal language theory across institutions including Northeastern University and Harvard University.

Jia SongView profile

Assistant Professor

• Cybersecurity
• Software Testing
• IoT Security
• +3 more

Jia (Cindy) Song is an Assistant Professor in the Department of Computer Science at the University of Idaho, affiliated with the College of Engineering. Her research focuses on cybersecurity, software testing, IoT security, fuzzing techniques, and real-time systems. She holds a Ph.D. in Computer Science from the University of Idaho (2014), an M.S. in Computer Science from the same institution (2012), and dual B.S./B.A. degrees in Information Security and Human Resource Management from Sichuan University, China (2009). Dr. Song’s work emphasizes practical applications of automated testing tools and formal methods to enhance software security and reliability. Her contributions include developing fuzzing frameworks, analyzing real-time operating systems compliance, and designing IoT security protocols. She maintains an active research website and is professionally active on LinkedIn. Her recent publications span innovations in grammar-based fuzzing, Rust programming language safety analysis, IoT firmware labeling systems, and cybersecurity benchmarking methodologies. She has contributed to academic conferences such as the Cyber Security Symposium and published reviews on symbolic execution tools and dynamic taint analysis.

• Photogrammetry
• Remote Sensing
• Computer Vision
• +3 more

Niclas Börlin is an Associate Professor in the Department of Computing Science at Umeå University, Sweden, with his office located at MIT-huset, MIT.A.431 in Umeå. He leads the research group focused on Non-linear estimation and contact-free measurements, driving innovation in photogrammetric computation methodologies. His research spans Photogrammetry , Remote Sensing , Computer Vision , and Medical Imaging , with core expertise in bundle adjustment algorithms and radiostereometric analysis (RSA) . He pioneered the Damped Bundle Adjustment Toolbox (DBAT) for MATLAB, enabling robust verification of photogrammetric software through modular design principles. His work bridges theoretical optimization and practical applications in environmental monitoring, medical diagnostics, and industrial measurement systems. Analysis of his 2012-2020 publications reveals a dominant trend in modular bundle adjustment techniques , with significant contributions to covariance computation, underwater photogrammetry accuracy, and forestry applications. His research consistently emphasizes independent verification frameworks for photogrammetric software, addressing challenges in large-scale reconstruction, laser scanning bias, and architectural modeling. Börlin has secured funding for critical projects including the DBAT toolbox development (2018), RSA medical applications (2018), and non-linear least squares algorithms (2008-2009), demonstrating sustained impact across academic and clinical domains. His collaborative work with researchers like Murtiyoso and Grussenmeyer has established new standards for quality control in photogrammetric workflows. He directs a specialized research team developing contact-free measurement solutions, with the DBAT toolbox serving as their flagship contribution to open photogrammetric science. Their work directly impacts fields requiring high-precision 3D reconstruction, from orthopedic implant analysis to periglacial environmental monitoring.