Find Academic Supervisors

Stephen A. EdwardsView profile

Associate Professor

• Embedded Systems
• Real-Time Systems
• Hardware Synthesis
• +5 more

Stephen A. Edwards is an Associate Professor at the Computer Science Department of Columbia University , where he explores automating software for embedded systems and real-time control . His work focuses on compiler techniques for languages like Esterel and domain-specific solutions for device drivers and communication protocols . Education : PhD in Electrical Engineering, University of California, Berkeley (1997) MS in Electrical Engineering, UC Berkeley (1994) BS in Electrical Engineering, California Institute of Technology (1992) Research Interests span hardware synthesis , functional programming , and synchronous languages . He develops domain-specific languages to bridge software and hardware, emphasizing determinism and timing precision in embedded systems. His group's work includes projects like the FHW compiler and the Sparse Synchronous Model . Article Trends show a focus on FPGA-based systems , garbage collection for accelerators, and parallel functional programming . These reflect his broader interests in hardware-software co-design and compiler optimization for real-time applications. Students : John Hui (2021-2024, Apple) Max Levatich (2020-) Richard Townsend (2013-2019, Tufts) Nalini Vasudevan (2007-2011, Google) Marcio Buss (2004-2008) Jia Zeng (2002-2008) Cristian Soviani (2002-2007, Synopsys) Consulting & Expert Services : He provides litigation support and expert witness services in patent cases involving software architecture and computer design , including ITC cases. Labs & Projects : Leads research on sparse synchronous systems and hardware synthesis , with initiatives like the GAPS CLOSURE Project and FHW Compiler for translating Haskell to System Verilog.

Jeffrey StackertView profile

Professor

• Ancient Near Eastern Studies
• Hebrew Bible
• Pentateuchal Studies
• +5 more

Jeffrey Stackert is the Caroline E. Haskell Professor of Hebrew Bible at the University of Chicago Divinity School, with affiliations in Classics and Middle Eastern Studies. He holds a PhD from Brandeis University and specializes in siting the Hebrew Bible within ancient Near Eastern contexts, focusing on Pentateuchal composition, prophecy, cultic texts, and law. His major works include Rewriting the Torah (2007), A Prophet Like Moses (2014), and Deuteronomy and the Pentateuch (2022), which explore biblical legal collections and their intertextual relationships. Research interests emphasize Pentateuchal sources, ancient Near Eastern legal comparisons, and the relationship between prophecy and law. He leads the CEDAR digital humanities project and edited the Oxford Handbook of the Pentateuch . His scholarship has been honored with the 2010 John Templeton Award for Theological Promise. Stackert serves on editorial boards for Maarav , Die Welt des Orients , and The Catholic Biblical Quarterly , and co-leads the Divinity School's MA program. His current projects include a Deuteronomy commentary and studies on Priestly literature.

Jesper CockxView profile

Assistant Professor

• Type Theory
• Dependently Typed Programming
• Pattern Matching
• +6 more

Jesper Cockx is an Assistant Professor in the Programming Languages group at Delft University of Technology . His research focuses on the theory and implementation of dependently typed languages , particularly Agda , and he is a core contributor to Agda's development. His work bridges Type Theory , Pattern Matching , and practical Compiler Design through tools like agda2hs . Research Interests : Type Theory and Dependently Typed Programming Pattern Matching and Unification Agda and Compiler Implementation Erasure Annotations for Verified Compilation Generic Programming and Language Design Formal Verification of Functional Code Scientific Awards : NWO Veni Grant (2020) for a Trustworthy and Extensible Core Language for Agda Conference Contributions : He serves on program committees for CPP , WITS , POPL , and ICFP . Recent publications analyze erasure annotations , correct-by-construction compilers , and dependent (co)pattern matching in Agda. His work often intersects with Haskell and functional programming education in the Netherlands.

Asta Halkjær FromView profile

Researcher

• Formal Logic
• Automated Reasoning
• Theorem Proving
• +13 more

Asta Halkjær From is a postdoctoral researcher in the Department of Computer Science at the University of Copenhagen, affiliated with the Software, Data, People & Society (SDPS) section under Dmitriy Traytel. She previously completed her PhD at DTU Compute from 2020 to 2023, focusing on formalized deduction methods in computational logic. She holds a Master’s and Bachelor’s degree from DTU in Computer Science and Software Technology, respectively, with a specialization in Artificial Intelligence and Algorithms. Her research lies at the intersection of formal logic and computer science, particularly in automated reasoning, proof assistants (Isabelle/HOL and Lean), and mechanized metatheory. She has contributed extensively to synthetic completeness proofs, tableau systems, and verified theorem provers. Her work emphasizes formal verification of logical systems, including epistemic logic, hybrid logic, and first-order logic, with a focus on soundness and completeness. The recent publications highlight a consistent trend: the mechanization of logical foundations in proof assistants. Her work bridges theoretical logic with practical verification tools, enabling reliable automation in theorem proving. She has developed and verified provers, explored axiomatic systems, and advanced the methodology of synthetic completeness, often leveraging Isabelle/HOL’s framework. Distinguished Paper Award, CPP 2023 DTU Young Researcher Award DTU Travel Grant (Executive Board Recognition) Otto Mønsted Fonden Travel Grant She has supervised BSc and MSc theses, special courses, and research projects at DTU, and currently teaches Software Development for Digital Health . She has served on program committees for CPP, ITP, and Dalí workshops and has reviewed for journals including Journal of Automated Reasoning and Journal of Logic and Computation . She has also participated in international research visits, including at VU Amsterdam. She is actively involved in building tools for formal reasoning and maintains a personal website with resources, including an Isabelle snippets generator and bibliography tools. Her work continues to advance the foundations of formal logic through mechanized proofs and practical automation.

• Parallel Programming
• Dependently Typed Languages
• Concurrent Systems
• +3 more

Dr Adam Barwell is a Lecturer and Researcher at the School of Computer Science, University of St Andrews. His research focuses on parallel programming, dependently typed languages, and formal methods in concurrent systems. He advises PhD student Leonid Nosovitskiy and has contributed to projects involving session types, distributed systems, and type-safe refactoring techniques. His educational background includes a PhD (not explicitly detailed here), and he actively engages in academic activities such as organizing events like Doors Open @ Computer Science 2025. Key research themes include concurrency control, functional programming paradigms, and improving code security through dependent types. Recent publications emphasize advancements in parallel language design, fault-tolerant protocols, and type-driven development. Collaborations span international conferences and institutions, reflecting his contributions to both theoretical and applied computer science domains.

Peter SestoftView profile

Professor

• Programming Languages
• Software Development
• Parallel Programming
• +4 more

Peter Sestoft is a Professor at the IT University of Copenhagen (ITU), leading the Computer Science Department since 2017. His primary roles include academic leadership, research in programming languages and software engineering, and teaching. He holds a PhD in Computer Science from the University of Copenhagen (1991) and has held academic positions at institutions like the Royal Veterinary and Agricultural University and the Technical University of Denmark before joining ITU in 1999. His research focuses on programming languages, functional and managed object-oriented languages, parallel programming, compilers, and spreadsheet implementation technologies. He has developed influential tools like the C5 Generic Collection Library for C# and Moscow ML, a Standard ML implementation. His work on Funcalc and Corecalc advanced spreadsheet technology with user-defined functions and efficient recalculation algorithms. Key contributions include over 30 publications, including books on programming language concepts and Java/C# syntax. He has led major research projects such as 'Popular Parallel Programming' (P3) and 'Probabli' for actuarial calculations. His academic service includes roles on national grant committees and international conference organizing committees. Notable advising includes PhD students like Andrzej Wasowski (ITU Professor) and David Christiansen (Director of Haskell Foundation). His work has been recognized through grants exceeding 25 million DKK and collaborations with institutions like Microsoft Research and Harvard University.

Yao LiView profile

Assistant Professor

• Programming Languages
• Formal Verification
• Dependent Types

Yao Li is an Assistant Professor of Computer Science at Portland State University, specializing in Programming Languages, Formal Verification, and Dependent Types. They earned a Ph.D. in Computer and Information Science from the University of Pennsylvania (2022), supervised by Stephanie Weirich, and hold a Master’s and Bachelor’s in Software Engineering from Shanghai Jiao Tong University (2016, 2013) under Zhengwei Qi. Ph.D., Computer and Information Science, University of Pennsylvania (2022) M.S., Software Engineering, Shanghai Jiao Tong University (2016) B.S., Software Engineering, Shanghai Jiao Tong University (2013) Their research focuses on formal verification of functional programming languages, particularly Haskell, and mechanized proofs using tools like Coq. They work on specifying and verifying networked servers, lazy program cost analysis, and embedded systems through program adverbs and Tlön embeddings. Recent publications (2018-2025) demonstrate expertise in Haskell verification, formal methods, and interaction trees. Key trends include bridging the gap between mechanized formalization and real-world code, advancing lazy evaluation semantics, and enhancing software verification through dependent types. Yao Li actively participates in academic service as a committee member and session chair in conferences like POPL, ICFP, and PLDI, contributing to artifact evaluation, program organization, and student research competitions.

Noortje VenhuizenView profile

Assistant Professor

• Computational Semantics
• Discourse Processing
• Language Comprehension
• +3 more

Noortje Venhuizen is an Assistant Professor in the Department of Cognitive Science and Artificial Intelligence at the Tilburg School of Humanities and Digital Sciences, Tilburg University. She serves as Academic Director for the BSc Cognitive Science and Artificial Intelligence program since 2024, and has held academic positions at Saarland University (2015-2022) including roles as Scientific Staff member and Principal Investigator in SFB 1102 projects. PhD in Computational Semantics (University of Groningen, 2015) MSc in Logic (ILLC, University of Amsterdam, 2011) BSc in Artificial Intelligence (Utrecht University, 2009) Her research focuses on expectation-based language comprehension, neurocomputational modeling of semantic processing, distributional formal semantics, and pragmatic reasoning in discourse. Key contributions include PDRT-SANDBOX (Haskell NLP library) and DFS Tools (Prolog implementation of distributional formal semantics). Recent publications (2023-2025) explore multimodal word meaning, informativity in reference production, and neurocognitive models of surprisal processing. Her work combines formal semantics with cognitive neuroscience and computational modeling. LOT Grotevragenprijs essay contest - Second Prize She has presented research at major conferences including CogSci, AMLaP, and Sinn und Bedeutung. Current teaching includes courses on artificial intelligence, statistics, and semantic theory.

Nikolaos PapaspyrouView profile

Professor

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

Nikolaos Papaspyrou is a Professor at the School of Electrical and Computer Engineering of the National Technical University of Athens (NTUA) and a member of the Software Engineering Laboratory . His research focuses on the theory and implementation of programming languages, including semantics, type systems, compilers, static analysis, and formal verification. Since October 2021, he has been on leave from NTUA, working as a Software Engineer for Google in the memory management team for the V8 JavaScript and WebAssembly engine. He previously served as Director of the Division of Computer Science (2017-2019) and was on sabbatical with Google's compiler group in Munich (2015-2016). His work includes the RELEASE project (EU FP7 STREP) for reliable large-scale server software and uncertainty handling in distributed databases (European Social Fund). Ph.D. and Diploma in Electrical and Computer Engineering from NTUA M.Sc. in Computer Science from Cornell University His research interests span programming languages , software engineering , and formal verification , with recent publications on coinductive proofs in Liquid Haskell, concurrency semantics, and quantum compilation. He has supervised over 50 diploma projects and mentored numerous students now at institutions like MIT, Princeton, and UC Berkeley. Awards include conference organizing and program committee roles, though no formal scientific prizes are listed.

David JaninView profile

Associate Professor

• Computer Science
• Functional Programming
• Temporal Media Systems
• +4 more

David Janin is an Associate Professor in Computer Science at Bordeaux INP , specifically within the ENSEIRB-MATMECA school. He leads the PoSET research project, exploring algebraic models for heterogeneous interactive temporal media systems. Research Affiliations : CNRS INS2I , INRIA Bordeaux Sud-Ouest , Idex Bordeaux , LaBRI (CNRS UMR 5800). Research Focus : His work bridges inverse semigroup theory and functional programming to develop algebraic frameworks for synchronizing diverse temporal media (sound, animation, video). This includes T-calculus in Haskell and Octopus for 3D animation. Technical Contributions : Key developments include models for overlapping tiles , birooted tree languages , and causal function semantics in real-time systems. Contact : janin@labri.fr

David Van HornView profile

Associate Professor

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

David Van Horn is an Associate Professor in the Department of Computer Science and UMIACS at the University of Maryland, College Park. His research focuses on programming languages, formal methods, and security, with an emphasis on making software components reusable and trustworthy. He holds academic appointments in both Computer Science and UMIACS and is a co-author of Realm of Racket , an educational book on programming video games co-written with undergraduates. Education: PhD in Computer Science, Brandeis University, 2009 MA and BS in Computer Science, University of Vermont, 2004-2006 Research Interests: His work centers on program analysis, verification, static analysis, and security. He develops techniques to bridge scripting languages and formal verification, aiming to improve software reliability. Recent projects include gradual typing, contract verification, and program synthesis tools like RbSyn and Absynthe. Awards: He has received prestigious recognitions, including the NSF CAREER Award (2019), ICFP Most Influential Paper Award (2020), and OOPSLA Distinguished Paper Award (2018). His work on Abstracting Abstract Machines (2010) influenced static analyses for languages like JavaScript and Erlang. Service and Mentoring: Van Horn serves on the SIGPLAN Programming Languages Mentoring Workshop steering committee and advises Technica, the world’s largest hackathon for underrepresented genders. He mentors PhD students in areas like gradual verification and security. Labs and Teams: He directs the Programming Languages at UMD (PLUM) Lab with Prof. Mike Hicks, focusing on foundational and applied research in programming languages and verification.

Florian SchmausView profile

Researcher

• Operating Systems
• Distributed Systems
• Concurrency Platforms
• +4 more

Florian Schmaus is a Researcher at the Department of Computer Science 4 (Distributed Systems and Operating Systems) at Friedrich-Alexander-University Erlangen-Nuremberg. He is associated with the Faculty of Engineering and focuses on system software for future many-core architectures, runtime support systems, and concurrent programming platforms. His work is part of the SFB/TRR 89 Invasive Computing project, specifically Project C1 (iRTSS). Education includes a Master's in Computer Science from FAU, with thesis topics such as 'Porting Cilk to OctoPOS' and 'Development of a Customizeable Caching Service in Haskell.' Research interests span distributed systems, operating systems, concurrency platforms, and real-time systems. His work emphasizes invasive computing, runtime systems for many-core architectures, and hardware-software co-design. Recent publications focus on systems like iRTSS, Nowa, and SHARQ, addressing challenges in resource arbitration and parallel processing. Teaching activities include courses on real-time systems and applied system software, with roles in both lectures and practical labs since 2012. He has supervised multiple theses on topics like microparallelism runtimes and kernel-space system calls. Labs/Teams: Active in the ergoo group and the Invasive Computing SFB/TRR 89 project, contributing to the OctoPOS operating system and related research platforms.

J. Garrett MorrisView profile

Researcher

• Programming Languages
• Type Systems
• Functional Programming
• +4 more

J. Garrett Morris is a researcher and teacher at the University of Iowa's Department of Computer Science, with previous affiliation to the University of Kansas. His work focuses on programming languages, type systems, and formal verification. Active contributor to conferences like POPL, ICFP, and Haskell Recognized for research in session types, linear logic, and functional programming His publications span topics including Exceptional Asynchronous Session Types , Partial Type Constructors , and Constrained Type Families . While no specific awards or students are mentioned in the scraped data, his academic activities include committee roles and keynote sessions.

Stephanie WeirichView profile

Professor

• Programming Languages
• Dependent Types
• Type Systems
• +3 more

Stephanie Weirich is the ENIAC President's Distinguished Professor in the Department of Computer and Information Science at the University of Pennsylvania's School of Engineering and Applied Science. Her research focuses on programming languages, with emphasis on dependent types, formal verification, and functional programming semantics. She leads Penn's Programming Languages Group (PLClub) and teaches courses including Advanced Programming (CIS 5520) and Programming Languages and Techniques (CIS 120). Research Areas: Her work spans theoretical foundations and practical implementations, including type systems for security, mechanized program verification, cost analysis for lazy evaluation, and language-based techniques for probabilistic programming. Recent projects explore indistinguishability in dependent types and effects systems for resource-aware computation. Honors: SIGPLAN Robin Milner Young Researcher Award (2016) NSF CAREER Award (2004) Microsoft Outstanding Collaborator (2016) Most Influential Paper Award, ICFP (2016) DARPA Computer Science Study Panel (2007-2008) Advising: Mentored 15+ PhD graduates including Richard Eisenberg (2016 Reynolds Award winner) and Vilhelm Sjöberg. Current students work on stratified type theory and mechanized logical relations. Secured grants from NSF and DARPA for research in dependently typed systems. Collaborations: Leads the PLClub research group; collaborates with industry (Microsoft) on Haskell extensions and verification tools like Hs-to-Coq.

• Programming Languages
• Refactoring
• Parallel Programming
• +5 more

Dr. Christopher Mark Brown is a Lecturer in the School of Computer Science at the University of St Andrews. He holds a PhD in Computer Science from the University of Kent. His research focuses on programming languages, parallelism, and energy-efficient software development, with a particular emphasis on refactoring techniques and their application to embedded systems. **Education**: Doctor of Philosophy (2010), University of Kent, specializing in Tool Support for Refactoring Haskell Programs. **Research Interests**: Parallel programming, refactoring tools (e.g., ParaFormance), energy-aware applications, and compiler optimizations. He leads EPSRC-funded projects like Energise (2021–2024) and EU-funded TeamPlay (2018–2021), developing energy-efficient parallel programming frameworks. His work contributes to Sustainable Development Goals related to energy efficiency and innovation. **Teaching**: Undergraduate courses include CS3050 Logic and Reasoning, CS4201 Programming Language Design, and CS4204 Concurrency. Postgraduate modules include CS5031 Software Engineering Practice. **Grants & Projects**: Principal Investigator on EPSRC Energise (refactorings for energy optimization) and EU TeamPlay (non-functional properties in parallel software). Developed open-source tools like Skel (Erlang parallel patterns) and ParaFormance (C/C++ refactoring). **Labs/Teams**: Member of the Programming Languages Group at St Andrews. Collaborates on commercializing refactoring tools through spin-out ventures.