Find Academic Supervisors

Adam ChlipalaView profile

Professor

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

Adam Chlipala is a Professor at the Massachusetts Institute of Technology working at the intersection of programming languages, formal methods, and computer systems. His research focuses on building practical verified systems with end-to-end machine-checked proofs, particularly using the Coq proof assistant. His educational background includes a Computer Science undergraduate degree from Carnegie Mellon University (2003) and a PhD in Computer Science from the University of California, Berkeley (2007). Following a postdoctoral position at Harvard University through 2011, he joined MIT as faculty. Chlipala's research spans multiple domains with strong emphasis on dependent types , verified compilation , and hardware-software co-verification . His work consistently bridges theoretical foundations with practical implementation, as evidenced by his development of the Ur/Web programming language and his focus on creating clean-slate hardware-software stacks with formal guarantees. Key research thrusts include cryptographic constant-time verification, side-channel security, and verified tensor compilation. His recent publications (2020-2025) reveal a clear trajectory toward increasingly complex verified systems, with growing emphasis on hardware-software integration, cryptographic implementations, and performance-critical applications. The work consistently leverages Coq for machine-checked proofs while addressing real-world constraints like timing channels and hardware interfaces. Chlipala is the author of the influential textbook Certified Programming with Dependent Types , which serves as a primary educational resource for Coq at numerous institutions worldwide. His professional activities include significant service to the PL community through program committees for major conferences including PLDI, POPL, ICFP, and CPP. He leads research initiatives connecting hardware and software verification, most notably through the DeepSpec project which aims to build fully verified computing stacks. His current work focuses on practical applications of dependent types for business applications through Ur/Web and verified cryptographic implementations.

Ranjit JhalaView profile

Professor

• Programming Languages
• Formal Verification
• Software Engineering
• +3 more

Ranjit Jhala is a Professor of Computer Science Engineering in the Jacobs School of Engineering at the University of California, San Diego. His research focuses on building reliable computer systems through programming languages and software engineering techniques. His primary research interests include Programming Languages, Formal Verification, and Software Engineering. He draws from and contributes to areas such as Type Systems, Model Checking, Program Analysis, and Automated Deduction, bridging theoretical foundations with practical implementations for real-world software development. Prof. Jhala's publication record shows a consistent trajectory in refinement type systems, evolving from Liquid Haskell to Flux for Rust, while also exploring neurosymbolic approaches to error repair and type error diagnosis. His work demonstrates a commitment to making formal verification techniques accessible to practitioners. He leads the Programming Systems Group at UCSD, mentoring graduate students and collaborating with researchers across the programming languages community. His service includes General Chair roles for POPL 2018 and PLDI 2022, reflecting his leadership position in the field. Prof. Jhala is also known for his mentoring activities, including talks on academic presentation skills and participation in ICFP's mentoring programs for students and early-career researchers.

Fredrik KjolstadView profile

Assistant Professor

• Compilers
• Programming Models
• Performance Engineering
• +3 more

Fredrik Kjolstad is an Assistant Professor in the Department of Computer Science at Stanford University, specializing in compilers and programming models for sparse computing and performance engineering. His research focuses on separating algorithms from data representations to enable portable applications across diverse hardware platforms. His research interests span compilers, programming models, performance engineering, and computer architecture, with particular emphasis on sparse tensor algebra, compiler design for heterogeneous systems, and high-performance computing. He has pioneered frameworks like TACO, Simit, and Distal that enable efficient sparse computations across CPUs, GPUs, and specialized accelerators. Dr. Kjolstad's publications demonstrate expertise in compiler optimization techniques for sparse data structures, tensor algebra, and distributed systems. His work consistently addresses the challenge of bridging high-level programming abstractions with efficient hardware execution across diverse architectures. MIT EECS First Place George M. Sprowls PhD Thesis Award NSF CAREER Award Rosing Award Adobe Fellowship Google Research Scholarship Best Paper Awards at EuroMPI 2013, OOPSLA 2017, and OOPSLA 2021 ISCA Distinguished Artifact Award PLDI and OOPSLA Distinguished Paper Awards He advises multiple PhD students including James Dong, Olivia Hsu, and Rohan Yadav, while leading research on compiler technologies that have received significant grant support. His group develops practical tools like the TACO compiler and Legate Sparse that are used in both academic and industrial settings. Current projects focus on programmable accelerators for sparse tensor algebra, distributed sparse computing, and compiler support for emerging hardware architectures.

Chandrakana NandiView profile

Assistant Professor

• Programming Languages
• Compilers
• Equality Saturation
• +5 more

Chandrakana Nandi is the Director of US R&D at Certora and an affiliate assistant professor in the Department of Computer Science & Engineering at the University of Washington's College of Engineering. She completed her PhD at the University of Washington working with Zachary Tatlock and Dan Grossman in the PLSE research group. Her research focuses on building tools for scaling automated formal verification to real-world programs, particularly for DeFi applications. She works extensively with equality saturation techniques (egg project) and has made significant contributions to computational fabrication through projects like Carpentry Compiler, Szalinski, and LambdaCAD. Her work bridges programming languages, compilers, and digital fabrication, creating novel tools that transform how we design and manufacture physical objects. Nandi's publication record shows a strong trajectory in programming language techniques applied to verification and fabrication. Her work on equality saturation has become foundational in the field, with the egg library enabling state-of-the-art results in compiler optimization and program synthesis. Recent work has expanded into formal verification of smart contracts, demonstrating the versatility of her research approach across different domains. Distinguished Paper Award at OOPSLA 2021 Sigplan Research Highlight for POPL 2021 As Director of US R&D at Certora, she leads research efforts on verification tools for languages like WASM and techniques to help users write formal specifications more easily using mutation testing. She has served in numerous organizational roles for major programming languages conferences including as Workshops Co-Chair for ICFP 2025 and Committee Member for PLDI Review Committee. Nandi has established herself as a leader in the intersection of programming languages and computational fabrication, with her work on equality saturation becoming particularly influential across multiple subfields of programming languages research.

Rachit NigamView profile

Assistant Professor

• Programming Languages
• Computer Architecture
• Hardware Acceleration
• +3 more

Rachit Nigam serves as an Assistant Professor in the Department of Electrical Engineering and Computer Science (EECS) at the Massachusetts Institute of Technology's School of Engineering. He leads the FLAME Lab, focusing on the intersection of programming languages and computer architecture. His research profile demonstrates significant involvement in major programming languages conferences including PLDI, SPLASH, and ICFP, where he has served in various committee roles from Artifact Evaluation to Student Research Competition Chair. Dr. Nigam's research centers on programming languages and hardware systems, with particular emphasis on creating compilers that transform programs into architectures. His work bridges theoretical type systems with practical hardware implementation, developing tools like Calyx (an intermediate language for hardware accelerator generators) and Dahlia (implementing time-sensitive affine types). His approach combines formal methods with practical compiler design to address challenges in predictable accelerator generation and hardware compilation. His publication record reveals a consistent trajectory in hardware-aware programming language design, with recent work focusing on unifying static and dynamic intermediate languages for accelerator generators. The publications demonstrate expertise across multiple subfields including type systems for hardware timing constraints, modular hardware design methodologies, and synthesis-aided compiler techniques for specialized architectures like DSPs. As an active member of the programming languages community, Nigam has served on numerous conference committees including PLDI, OOPSLA, and LCTES. He has chaired sessions, organized tutorials (including 'DSL-based Hardware Generation'), and contributed to community initiatives like PL Tea. His GitHub presence shows active development in projects related to hardware compilation with significant contributions to repositories like Calyx, Filament, and Dahlia. Dr. Nigam leads the FLAME Lab at MIT, which focuses on creating programming models and compiler infrastructure for hardware acceleration. His work with the Calyx compiler ecosystem represents a significant contribution to the field of hardware accelerator generation, providing tools that enable more predictable and efficient hardware compilation processes. His research has practical implications for domain-specific hardware accelerators and the broader challenge of making hardware design more accessible through programming language techniques.

Kunle OlukotunView profile

Professor

• Computer Architecture
• Parallel Programming
• Chip Multiprocessors
• +4 more

Kunle Olukotun is a Professor of Electrical Engineering and Computer Science at Stanford University's School of Engineering, where he has been faculty since 1991. He directs the Stanford Pervasive Parallelism Lab (PPL) and co-leads the Transactional Coherence and Consistency (TCC) project. His research focuses on computer architecture, parallel programming environments, and scalable parallel systems. Key areas include chip multiprocessors (CMPs), transactional memory systems, domain-specific languages (DSLs) for heterogeneous computing, and hardware-software co-design for machine learning workloads. His work bridges theoretical foundations with practical systems implementation. Notable contributions include the Stanford Hydra research project (one of the first chip multiprocessors with thread-level speculation), founding Afara Websystems (acquired by Sun Microsystems), and developing the Niagara processor architecture. His DSL frameworks like Green-Marl and Spatial enable efficient graph analysis and hardware acceleration. His publications reveal strong trends in parallel systems evolution: from foundational CMP research (2000s) to transactional memory (2004-2010), then DSLs for heterogeneous computing (2010-2015), and currently foundation model systems (2023-2025). Subfield analysis shows consistent focus on hardware-software co-design, sparse computation, and compiler techniques across decades. ACM Fellow (2006) for contributions to multiprocessors on a chip and multi-threaded processor design Best Paper Award at IEEE International Symposium on Workload Characteristics (IISWC '10) for EigenBench Olukotun actively mentors researchers through the Stanford Pervasive Parallelism Lab (PPL), which seeks to proliferate parallelism across application domains. His projects have secured significant industry partnerships, including the acquisition of his startup Afara Websystems by Sun Microsystems. Current research focuses on compiler frameworks for foundation model systems and hardware acceleration for sparse machine learning workloads, supported by collaborations with major tech companies. He leads the Stanford Pervasive Parallelism Lab (PPL), which develops compiler and runtime systems for heterogeneous architectures. The lab's work spans DSLs, hardware acceleration, and parallel programming models, with strong industry ties to companies like NVIDIA and Google. Current initiatives include the Mosaic compiler framework and Stardust architecture for sparse tensor computation.

Fernando Magno Quintão PereiraView profile

Associate Professor

• Compilers
• Code Generation
• Compiler Optimizations
• +3 more

Fernando Magno Quintão Pereira is an Associate Professor at the Federal University of Minas Gerais (UFMG), Brazil, specializing in compiler design and program analysis. His academic journey began with a Ph.D. from UCLA in 2008 under Jens Palsberg's supervision, establishing his foundation in compiler research. His research focuses on compilers , with core expertise in code generation , compiler optimizations , and static program analyses . Recent work explores quantum compilation, binary analysis, and security-aware compilation techniques. His publications reveal consistent contributions to major conferences including PLDI, CGO, and SPLASH, with emphasis on practical optimization frameworks and theoretical compiler advancements. Analysis of his 15 most recent publications (2020-2026) shows dominant themes in binary optimization (e.g., AnghaBench), security-aware compilation (e.g., Memory-Safe Elimination of Side Channels), and emerging architecture support (e.g., Quantum Computing Compilation). His work bridges theoretical compiler principles with real-world systems challenges. He actively contributes to the academic community through: Program committees for PLDI (2020-2025), CGO (2021-2026), and SPLASH conferences Leadership roles including CGO Finance Chair (2026) and PLDI Diversity & Inclusion Co-Chair (2023-2024) Organizing JENSFEST 2024 and serving on multiple conference steering committees Pereira maintains an active research group evidenced by continuous publication output and conference leadership, with his personal website ( homepages.dcc.ufmg.br/~fernando/ ) serving as a hub for his academic activities.

• Programming Languages
• Formal Verification
• Compilers
• +8 more

Clément Pit-Claudel is an assistant professor at École Polytechnique Fédérale de Lausanne (EPFL) in the School of Computer and Communication Sciences, Department of Computer Science. He leads the SYSTEMF lab which he founded in January 2023. Prior to joining EPFL, he was a PhD candidate at MIT with Adam Chlipala and subsequently worked as a senior applied scientist at Amazon AWS. His academic journey began at École Polytechnique in France, followed by doctoral studies at MIT. Dr. Pit-Claudel's research focuses on programming languages, compilers, and formal verification, with broader interests spanning systems engineering, hardware design languages, security, performance engineering, databases, and type theory. His work centers around three main axes: extensible compilation (teaching compilers domain-specific optimization tricks), hardware design languages and verification, and tooling for proof assistants. He has developed several influential systems including Elk (a linear-time engine for JavaScript regexes), Warblre (a Coq translation of JS regex specification), Fiat (a library for correct-by-construction refinement), Narcissus (for verified binary encoders/decoders), F2F (a program extraction framework), Rupicola (a compiler-construction toolkit), Kôika (a rule-based hardware design language), Cuttlesim (a fast hardware simulator), and Alectryon (a literate programming system for Coq). His publications span top venues including PLDI, POPL, ICFP, ASPLOS, and SLE, with recent work focusing on verified JavaScript regular expressions, foundational integration verification of cryptographic servers, and relational compilation techniques. His research aims to build small, fast, and completely verified components for critical systems through a combination of machine-checked proofs, hardware-software co-design, low-level compiler engineering, and new tools for interactive theorem proving. His notable awards include the Distinguished Artifact award at SLE 2020 for 'Untangling Mechanized Proofs,' the William A. Martin Memorial Thesis Award from MIT in 2016, and the Frederick C. Hennie III Teaching Award from MIT in 2016. He has served on program committees for numerous conferences including PLDI, POPL, ICFP, and SPLASH, and has organized workshops such as the Coq Workshop and Proof Systems. As an educator, he teaches 'Software Construction' (undergraduate level, ~400 students) and 'Interactive Theorem Proving' (graduate level) at EPFL. His teaching philosophy emphasizes hands-on learning, continuous assessment through oral examinations, and designing assignments that lead students to build concrete artifacts they can be proud of. His approach is informed by hundreds of hours of in-class instruction in Europe and the US, resulting in stellar student reviews and multiple teaching awards.

Robert ClarisóView profile

Lecturer

• Formal Methods
• Software Engineering
• Model-Driven Engineering
• +3 more

Robert Clarisó is a Lecturer at Universitat Oberta de Catalunya (UOC) in the IT, Multimedia and Telecommunication Department. He has a strong background in Computer Science with a BSc (2000) and PhD (2005) from UPC-Barcelona Tech. His academic career includes positions as a part-time associate professor at UPC-Barcelona Tech and at Universitat Autònoma de Barcelona. Dr. Clarisó's educational background includes: BSc in Computer Science from UPC-Barcelona Tech (2000), graduated as the top of his class with a Special mention in the Spanish National University Degree Awards PhD in Computer Science from UPC-Barcelona Tech (2005), thesis titled "Abstract Interpretation Techniques for the Verification of Timed Systems" under Dr. Jordi Cortadella Fortuny His research primarily focuses on Formal Methods and Software Engineering, with recent expansion into AI-related topics. Dr. Clarisó has made significant contributions to Model-Driven Engineering, particularly in the area of Object Constraint Language (OCL). His recent work has shifted toward examining bias and fairness in Large Language Models and exploring the application of Generative AI in software engineering education, reflecting a strategic pivot to address contemporary challenges in AI ethics and deployment. Dr. Clarisó has held several leadership positions including Coordinator of the Research Group on Software Engineering at UOC (2008-2015), Academic Director of the Official Master in Computing Engineering (2011-2019), and Academic Director of the Bachelor's Degree in Techniques for Software Development (2020-2023). He currently leads the university's working group on "AI in education" and is a principal investigator of the SOM Research Lab. His notable recognition includes a Special mention in the Spanish National University Degree Awards. Dr. Clarisó has served on program committees for major conferences including MODELS and ASE across multiple years, demonstrating his standing in the academic community. As an educator, Dr. Clarisó has taught courses on automata theory, compilers, algorithms and data structures, graph theory, and software development. He has coordinated undergraduate theses and led postgraduate programs, showing his commitment to academic mentorship and program development. Dr. Clarisó is actively involved in research teams, currently leading the SOM Research Lab which focuses on software engineering research. His recent work has centered on the intersection of formal methods, model-driven engineering, and AI technologies, particularly examining ethical implications and educational applications.

Yu FengView profile

Associate Professor

• Programming Languages
• Program Synthesis
• Program Analysis
• +3 more

Yu Feng is an Associate Professor in the Computer Science Department at the University of California, Santa Barbara. He received his Ph.D. in Computer Science from the University of Texas at Austin in 2018 and his MS in Computer Science from Beihang University in 2008. His research focuses on programming languages, program analysis and verification, program synthesis, and security. Specifically, he aims to build automated tools that guarantee the desired behavior of systems in a sound, precise, and scalable way. He is particularly interested in applying program synthesis and analysis to tackle security and performance problems in mobile devices and blockchain applications. Professor Feng's recent publications demonstrate a strong focus on program synthesis for security applications, particularly in blockchain and zero-knowledge proofs. His work spans multiple top-tier conferences including PLDI, POPL, ASE, and CCS, showing consistent contributions to both programming languages and security communities. His research often combines logical reasoning with machine learning techniques to develop innovative solutions for complex problems in program analysis and synthesis. Ethereum Academic Award (2025, 2024, 2023) ACM SIGPLAN Distinguished Paper Award, PLDI 2022 ACM SIGCHI Best Paper Award, CHI 2021 Google Faculty Research Award (Security), 2021 ACM SIGSOFT Distinguished Paper Award, ASE 2020 DARPA HARDEN grant (2022-2025) NSF-SaTC grant (2019-2022) ACM SIGPLAN Distinguished Paper Award, PLDI 2018 Professor Feng actively mentors students in his research group, currently advising several PhD students including Yanju Chen, Junrui Liu, Hongbo Wen, and Hanzhi Liu. He has served on program committees for numerous top conferences including CCS, PLDI, OOPSLA, ICSE, ASPLOS, and POPL. His research is supported by prestigious grants including DARPA HARDEN and NSF-SaTC. His laboratory focuses on developing cutting-edge program synthesis and analysis frameworks that combine logical reasoning with machine learning. The team works on applications in blockchain security, zero-knowledge proofs, and secure protocol implementation.

• Specialized English
• Police English
• Business English
• +4 more

Audrey Cartron serves as Lecturer in English Studies at the Faculty of Foreign Languages and Cultures (FLCE) of the University of Nantes, teaching specialized English courses across undergraduate and graduate levels including Business, Marketing, and Corporate English (L1-L3, M2 LEA), British and American Civilization, oral translation, and spoken English for the Trilingual Lawyer program. Her doctoral research completed at Aix-Marseille University in 2022 established foundational work in police English as a specialist language. Key research areas include: Discursive approaches to specialized language teaching Police discourse analysis (suspect interviews, affidavits, humor functions) Business English lexicon and cultural dimensions Didactic transposition of specialized knowledge Dictionarization processes in professional contexts Cartron's publication trajectory (2019-2025) reveals progressive specialization in police linguistics, with increasing methodological sophistication in genre analysis. Her 2023-2025 work shifts toward refining discursive teaching frameworks while maintaining empirical focus on American police discourse. The research consistently bridges theoretical linguistics with practical pedagogical applications for LEA programs. No scientific awards are documented in the available information. As a lecturer, Cartron likely supervises student projects in specialized English domains though specific advisees aren't listed. Her research appears institutionally supported through her academic position, with publications in reputable journals like ASp and Languages, but no explicit grant information is provided. Collaborations with scholars across French institutions indicate active academic networking.

• Spanish Linguistics
• Spanish Lexicography
• Contrastive Grammar (Spanish-Italian)
• +6 more

Félix San Vicente serves as Professor of Spanish Linguistics at the University of Bologna's Forlì campus and directs CLIRO (Centro Linguistico dei Poli Scientifici-Didattici della Romagna), the Language Centre for Science and Education Campuses of Romagna. His academic position centers on Spanish language studies with institutional leadership in language resource development. San Vicente's primary research focuses on synchronic and diachronic Spanish lexicography, Spanish-Italian contrastive grammar, and language for specific purposes across political communication, social sciences, and artistic-cultural domains. He has extensively investigated new technologies in distance language learning, developing e-learning applications for Spanish as a second language. His work bridges theoretical linguistics with practical pedagogical applications, particularly in bilingual lexicography and grammatical description. Analysis of his recent publications reveals consistent emphasis on historical lexicography, grammatical description, and contrastive studies between Spanish and Italian. His work demonstrates methodological integration of historiographical approaches with contemporary language analysis, particularly regarding dictionary compilation and grammatical norms. Significant patterns include examination of 16th-18th century grammatical traditions and modern applications in language teaching. No scientific awards were documented in the source materials. Regarding academic advising and research funding, the available information does not specify doctoral students, major grants, or sponsored research projects. As CLIRO director, San Vicente leads institutional language services across Romagna campuses, overseeing initiatives in language certification, curriculum development, and digital learning resources that support both academic and professional language development for students and faculty.

Bas SpittersView profile

Associate Professor

• Homotopy Type Theory
• Formal Verification
• Blockchain
• +6 more

Bas Spitters is an Associate Professor at the Department of Computer Science, Aarhus University, Denmark. He leads the Concordium Blockchain Research Center and the Blockchain workpackage in Digit , and contributes to Aarhus University's Quantum Campus initiative. His research spans Homotopy Type Theory , Formal Verification , and High-assurance cryptographic software . He develops proof assistants like Coq for applications in probabilistic programming , blockchain security , and quantum computing . Recent article trends focus on verified compilation (CertiCoq-Wasm), smart contract certification (ConCert), and applications of HoTT to probabilistic and blockchain systems. Key keywords include Formal Methods , Blockchain , Quantum Computing , and Cubical Type Theory . Scientific awards and grants: AFOSR grant (2018-2021) for Homotopy Type Theory in probabilistic computation Villum Foundation grant (2015-2019) for Guarded Homotopy Type Theory NWO VENI grant (2010-2013) for Reasoning and Computing DIAMANT researcher grant Advising and collaboration: Advised PhD students: Benjamin Salling Hvass, Jakob Botsch Nielsen, Andreas Aagaard Lynge, Soren Eller Thomsen, Martin Bidlingmaier Collaborated on computer-verified exact analysis, smart contracts, and quantum logic Organized workshops: TYPES workshop , HACS , and DMV Mini-Symposium

Denis MerigouxView profile

Researcher

• Programming Languages
• Verification
• Compiler Construction
• +3 more

Denis Merigoux is a researcher at Inria specializing in the intersection of programming languages , formal verification , and computational law . As the lead of the Catala project, he focuses on translating legal texts into verifiable code to modernize tax and social welfare systems. His academic background includes a PhD in Computer Science from Université Paris Sciences et Lettres (2021) and a Master's thesis at École polytechnique.

Nate FosterView profile

Professor

• Programming Languages
• Networking
• Formal Verification
• +3 more

Nate Foster is a Professor of Computer Science at Cornell University and a Visiting Researcher at Jane Street . During 2023-24, he also holds a Visiting Professor position at EPFL in the Data Center Systems Laboratory. His research focuses on Programming Languages and Networking , with significant contributions to formal verification of network data planes and domain-specific language design. Awarded NSF CAREER Award , Sloan Research Fellowship , ACM SIGCOMM Rising Star Award , and ACM SIGPLAN Robin Milner Award Active in program committees for conferences like POPL, PLDI, SPLASH, and ICFP Research Trends : His recent work explores intersections of programming language theory with networking, including symbolic verification tools like KATch , infinite-state network analysis with StacKAT , and active learning frameworks for network automata. He applies formal methods to practical challenges in software-defined networking and hypervisor verification. Scientific Awards : NSF CAREER Award Sloan Research Fellowship ACM SIGCOMM Rising Star Award ACM SIGPLAN Robin Milner Award Academic Leadership : Serves as Session Preview Co-Chair for POPL 2024 and organizes workshops like RPLS 2025. He has chaired tutorials on P4 programming and mentored researchers through PLMW programs.