جستجوی استاد راهنمای دانشگاهی

Timothy Roscoeمشاهده پروفایل

استاد

• Operating Systems
• Networking
• Distributed Systems
• +۳ مورد دیگر

Prof. Dr. Timothy Roscoe is a Full Professor in the Department of Computer Science at ETH Zurich. His research focuses on operating systems, networking, and distributed systems. He was inducted as an ACM Fellow in 2014 for contributions to these fields. Previously, he worked at Intel Research Berkeley, UC Berkeley (Adjunct Professor), and Sprint Labs. His work includes foundational contributions to systems like PlanetLab, P2 Declarative Networking, and the Nemesis OS. Roscoe holds a PhD from the University of Cambridge and has led projects in cloud computing, wide-area network measurement, and secure systems design. His current research emphasizes hardware-software co-design, formal verification of systems, and scalable memory architectures. Education: PhD in Computer Science, University of Cambridge (1995) Key Roles: Principal Researcher at Intel Berkeley Lab, Visiting Researcher at National ICT Australia Research Highlights: Contributions to distributed systems (PlanetLab), declarative networking (P2), and secure microkernels (seL4 integration). Current projects address challenges in disaggregated memory systems, coherent interconnects, and trustworthy embedded systems. Awards: ACM Fellow (2014), numerous grants and industry collaborations. Labs/Teams: Systems Group at ETH Zurich, focusing on OS design, hardware architectures, and formal methods.

• Programming Language Theory
• Semantics of Programming Languages
• Domain Theory
• +۷ مورد دیگر

Gordon Plotkin is a Professor at the School of Informatics, University of Edinburgh, where he is affiliated with the Laboratory for Foundations of Computer Science (LFCS). His research lies at the intersection of theoretical computer science and programming language semantics, with a profound influence on the formal understanding of computation. His research interests include Programming Language Theory, Semantics of Programming Languages, Domain Theory, Operational Semantics, Lambda Calculus, Type Theory, Concurrency Theory, and Algebraic Effects. His seminal work on structural operational semantics and domain theory has laid the foundation for modern semantics of programming languages. His publications span over five decades, showing a sustained and evolving research trajectory from foundational work in lambda calculus and domain theory to recent contributions in algebraic effects, probabilistic computation, and biochemical systems modeling. The articles demonstrate a consistent focus on formal methods, mathematical rigor, and the algebraic structure of computational effects. He has collaborated with leading researchers including Martín Abadi, John Power, Glynn Winskel, and John Reynolds. His work continues to influence both theoretical and practical developments in programming languages and systems. Gordon Plotkin has made foundational contributions to computer science, particularly through his development of structural operational semantics and domain-theoretic models of computation. He has advised numerous researchers and supervised many influential PhD theses, though specific student names are not listed in the provided text. His work has been supported by long-standing affiliations with the Laboratory for Foundations of Computer Science and the University of Edinburgh, and he has contributed to major collaborative projects in programming language design and verification. He is associated with several research groups and labs, most notably the Laboratory for Foundations of Computer Science (LFCS), which serves as a hub for theoretical research in programming languages, semantics, and logic at the University of Edinburgh.

• Formalized Mathematics
• Proof Assistants
• Homotopy Type Theory
• +۳ مورد دیگر

Floris van Doorn is a Professor at the Mathematical Institute of the University of Bonn where he leads the Formalized Mathematics group. His research focuses on making it viable to formalize research mathematics in proof assistants that can check the correctness of such proofs. He primarily works with the Lean Theorem Prover and is a maintainer of its mathematical library (mathlib). University of Bonn: Professor (2023-present) University of Paris-Saclay: Postdoc with Patrick Massot (2021-2023) University of Pittsburgh: Postdoc with Tom Hales (2018-2021) Carnegie Mellon University: PhD under Jeremy Avigad and Steve Awodey (2013-2018) Van Doorn's research interests center on formalized mathematics, tools and automation for formalization, and homotopy type theory. He has made significant contributions to several major formalization projects including the Carleson project (proving Carleson's theorem), the sphere eversion project (formalizing Gromov's h-principle), the Flypitch project (formalizing the independence of the continuum hypothesis), and the Spectral sequences project. His work demonstrates that proof assistants can handle complex areas of mathematics beyond algebra, including differential topology and analysis. His recent publications show a consistent focus on advancing formalized mathematics, with his most recent work formalizing the Gagliardo-Nirenberg-Sobolev inequality and continuing the Carleson project. His publications span theoretical foundations of type theory, practical applications of formalization, and educational resources for learning proof assistants. Skolem award (2025) for the paper 'The Lean Theorem Prover (System Description)' Van Doorn actively mentors students and collaborators, with Maria, Michael, and Arend recently joining his formalization group in Bonn. He has taught various courses on formalized mathematics and proof assistants at the University of Bonn, University of Pittsburgh, and Carnegie Mellon University. His educational efforts include developing learning resources such as the Natural Number Game and the online book 'Mathematics in Lean.' He also maintains an active presence in the Lean community through the Formalized Mathematics group and collaborative projects like the Carleson project, which invites participation from those familiar with Lean.

Jeremy Gibbonsمشاهده پروفایل

استاد

• Functional Programming
• Programming Languages
• Software Engineering
• +۳ مورد دیگر

Jeremy Gibbons is a Professor of Computing at the University of Oxford, affiliated with the Department of Computer Science within the Faculty of Computer Science. He serves as Director of the Professional Programmes, overseeing part-time postgraduate degrees in Software Engineering. His roles include Chair of the Faculty of Computer Science (2012–2016), Director of the Software Engineering Programme, and Fellow of Kellogg College. Gibbons' research focuses on programming methodologies, particularly functional and object-oriented languages, with an emphasis on program calculation, design patterns, and bidirectional transformations. He leads the Algebra of Programming research group and is Editor-in-Chief of the Journal of Functional Programming and The Art, Science, and Engineering of Programming . Education includes a D.Phil. from Oxford University. His work spans formal methods, domain-specific modeling for clinical trials (e.g., CancerGrid project), and semantic frameworks for software systems. He has advised numerous students and contributed to open-access initiatives in publishing. Key collaborations include roles in ACM SIGPLAN and IFIP Working Groups 2.1 and 2.11. Research interests emphasize foundational aspects like profunctor optics, categorical programming, and algorithm design. Notable projects include datatype-generic programming and metadata-driven engineering for clinical trials. His work bridges theoretical computer science with practical applications in software architecture and system design.

Todd Millsteinمشاهده پروفایل

استاد

• Software Reliability
• Network Verification
• Programming Languages
• +۵ مورد دیگر

Todd Millstein is a Professor in the Computer Science Department at the University of California, Los Angeles (UCLA), and served as Department Chair from 2022–2025. He is also an Amazon Scholar and a co-founder and former Chief Scientist of Intentionet (now at AWS). His research focuses on making software systems more reliable, particularly through network verification and programming language techniques. He pioneered the Batfish network configuration analyzer, which is used by AWS, Oracle Cloud, and dozens of companies, and received the ACM SIGCOMM Networking Systems Award (2025) for this work. His recent publications span probabilistic programming, network reliability, and interactive program verification, including papers at PLDI 2024 (on bit blasting probabilistic programs), NSDI 2024 (on behavioral testing of BGP), and HotNets 2024 (on network layering). Todd has received prestigious awards such as an NSF CAREER Award , a Microsoft Research Outstanding Collaborator Award , and multiple best paper awards at PLDI, OOPSLA, and SIGCOMM. He has advised Ph.D. students like Ana Brendel and Poorva Garg , and teaches courses such as CS30 (Principles of Computing), CS231 (Types and Programming Languages), and CS239 (Current Topics in PL and Systems). His professional roles include Program Chair for OOPSLA 2014 and ECOOP 2018, and committee member for numerous conferences including PLDI , SPLASH , and LAFI .

• Programming Language Theory
• Dependent and Refinement Types
• Computational Effects
• +۶ مورد دیگر

Danel Ahman is an Associate Professor at the Institute of Computer Science , University of Tartu , Estonia, specializing in programming language theory . His research focuses on dependent/refinement types , computational effects , and verified software . Education PhD in Theoretical Computer Science (University of Edinburgh, 2017) MPhil in Advanced Computer Science (University of Cambridge, 2012) BSc in Informatics (Tallinn University of Technology, 2010) Research Interests : Danel investigates programming languages with algebraic effects and effect handlers for verified software, exploring denotational/operational semantics and fibrational approaches to effects. His work bridges theoretical computer science with practical formal verification. Scientific Awards : Estonian Research Council grant (2025) Marie Skłodowska-Curie Fellowship (2019) PhD dissertation prize (2018) Google/Citrix dissertation awards (2012) Teaching & Supervision : He teaches courses like Logic in Computer Science and Functional Programming at the University of Tartu, and supervised BSc/MSc theses on topics including asynchronous effects and formal verification. Danel also organizes research seminars and guest lectures on F*.

• Programming Language Design
• Program Verification
• Type Theory
• +۳ مورد دیگر

Neelakantan R. Krishnaswami is a Professor of Computer Science at the University of Cambridge's Computer Laboratory , and a Fellow of Trinity College . His research focuses on the intersection of program verification, programming language design, and foundational topics like type theory and semantics. His work spans areas such as refinement types, parser design, separation logic for systems software, and the semantics of reactive programming. Notable contributions include the Datafun language for higher-order Datalog and the λert type theory for explicit refinement types. He has also developed foundational frameworks for verifying imperative programs using advanced type systems and logical relations. Key publications include 'Explicit Refinement Types' (ICFP 2023), 'flap: A Deterministic Parser with Fused Lexing' (PLDI 2023), and 'CN: Verifying Systems C Code' (POPL 2023). His work frequently addresses challenges in efficiency, correctness, and modularity for both functional and imperative systems. His awards include Distinguished Paper Awards at PLDI 2019 and POPL 2020. His research integrates theoretical rigor with practical tooling, exemplified by contributions to languages like Coq, Lean, and Haskell.

Marcelo Fioreمشاهده پروفایل

استاد

• Category Theory
• Lambda Calculus
• Equational Logic
• +۵ مورد دیگر

Marcelo Fiore is a Professor in Mathematical Foundations of Computer Science at the Department of Computer Science and Technology, University of Cambridge, and a Fellow of Christ's College. His research spans category theory, lambda calculus, equational logic, type theory, and mathematical structures in computer science. University: University of Cambridge Department: Department of Computer Science and Technology Academic Rank: Professor College Affiliation: Christ's College Fiore's work focuses on the intersection of category theory and computer science, particularly in abstract syntax, denotational semantics, and algebraic structures. Recent publications explore combinatorial models, normalization by evaluation, and homotopy type theory applications. 2025: Creation/annihilation operators in mathematical structures 2024: Lawvere theories in toposes and differential linear logic 2023: Homotopy type theory and normalization frameworks 2022: Second-order abstract syntax formalization and quotient types Fiore has advised PhD students including N. Arkor (2022) and O.M. Elsayed (2011), who researched monadic structures and second-order algebraic theories respectively. He contributes to departmental initiatives such as the Accelerate Programme for Scientific Discovery and Data Trusts Initiative at Cambridge.

Dominique Devrieseمشاهده پروفایل

استاد

• Functional Programming
• Object Capabilities
• Secure Compilation
• +۵ مورد دیگر

Dominique Devriese is a professor at the Department of Computer Science, KU Leuven, and a member of the DistriNet research group. His work bridges computer security, programming languages, and formal verification. Research interests: Functional Programming, Object Capabilities, Secure Compilation, Dependently-typed Programming, Modal Type Theory Teaching: Formal Systems, Object-Oriented Programming, CyberSecurity, Secure Software His research focuses on rigorous software systems security through capability machines and secure compilation techniques. He actively contributes to formal verification using Agda and Haskell, with recent work on multimode type theory and effect parametricity. Key publication trends include: multimode/presheaf type theory, capability-based security models, formal verification of hardware/software abstractions, and parametricity applications in programming languages. Contact: Email: dominique.devriese@kuleuven.be ORCID: 0000-0002-3862-6856

Dmitriy Traytelمشاهده پروفایل

دانشیار

• Logic
• Automata Theory
• Runtime Verification
• +۷ مورد دیگر

Dmitriy Traytel is an Associate Professor at the University of Copenhagen's Department of Computer Science since August 2020, where he currently heads the Software, Data, People & Society (SDPS) section. Prior to this position, he worked as a senior researcher (Oberassistent) in the Information Security Group led by David Basin at ETH Zürich. He completed his PhD at TU München under Tobias Nipkow's supervision in 2015. His research focuses on formal methods, particularly logic, automata theory, runtime verification and monitoring, decision procedures, (co)induction and (co)recursion, and interactive theorem proving. Traytel develops formally verified tools for runtime monitoring including VeriMon, TimelyMon, and WhyMon, emphasizing correctness and efficiency in monitoring complex temporal properties. His recent publications (2021-2025) demonstrate a strong focus on first-order temporal logic monitoring, with particular attention to explainable verdicts, scalable parallel implementations, and formal verification of monitoring algorithms. The work spans theoretical foundations in logic and category theory while maintaining practical applications in runtime verification systems. Distinguished Paper Award at POPL 2025 for 'Barendregt Convenes with Knaster and Tarski' Best Student Paper Award at FSCD 2016 Distinguished Paper Award at ATVA 2018 Traytel has supervised numerous PhD, Master's, and Bachelor's students in areas spanning formal verification, runtime monitoring, and theorem proving. His research has been supported through collaborations with major institutions including ETH Zürich and TU München. He actively contributes to the academic community by serving on program committees for major conferences including ITP 2025 and RV 2025. He leads the Software, Data, People & Society section at the University of Copenhagen, focusing on developing formally verified tools for runtime verification that bridge theoretical computer science with practical applications in security and system monitoring.

• Type Theory
• Dependent Types
• Functional Programming
• +۱۱ مورد دیگر

Andreas Abel is a Senior Lecturer in the Division of Computing Science at the Department of Computer Science and Engineering, Chalmers University of Technology and the University of Gothenburg. He has previously served as an Assistant Professor at Ludwig-Maximilians-Universität (LMU) Munich and has been a visiting researcher at INRIA in Paris. His primary affiliations are with Chalmers and the University of Gothenburg, where he conducts research and teaches in programming languages and type theory. Chalmers University of Technology, Department of Computer Science and Engineering, Senior Lecturer University of Gothenburg, Division of Computing Science LMU Munich, Assistant Professor (former) INRIA Paris, Visiting Researcher Abel’s research lies at the intersection of type theory, functional programming, and formal verification. He is particularly known for his work on dependent types, normalization by evaluation, and the development of the Agda proof assistant. His interests include constructive logic, logical frameworks, modal and linear typing, program verification, and compiler construction. He leads the Modal Dependent Type Theory project funded by the Swedish Research Council (Vetenskapsrådet) and has contributed to several other major research initiatives in programming language theory. His recent publications reflect a strong focus on foundational aspects of type systems, including cubical type theory, decidability of conversion, and formalization of algebraic completeness. These works appear in top-tier venues such as ICFP, LICS, POPL, and TYPES, showcasing both theoretical depth and practical implementation in Agda. Distinguished Paper Award, ICFP 2019 Editor, Theoretical Pearls column, Journal of Functional Programming Member, IFIP WG 1.3 on Foundations of System Specification Abel actively supervises students and contributes to the research community through program committee memberships for major conferences including LICS, ICFP, and CPP. He is a senior developer of Agda and the maintainer of the BNFC (Backus-Naur Form Compiler) tool. His work bridges theoretical computer science with practical software development for formal methods. He is involved in several research groups and projects, including the Programming Logic Group at Chalmers and the international EUTYPES network. His role as principal investigator and core contributor in multiple funded projects highlights his leadership in the field of programming language foundations.

Steve Zdancewicمشاهده پروفایل

استاد

• Programming Languages
• Type Theory
• Logic
• +۷ مورد دیگر

Steve Zdancewic is the Schlein Family President's Distinguished Professor and Associate Chair in the Department of Computer and Information Science at the University of Pennsylvania's School of Engineering and Applied Science. He is a leading researcher in programming languages, formal methods, and computer security with over two decades of impactful contributions to the field. His research interests span programming languages, type theory, logic, computer security, quantum programming, and formal verification. Zdancewic has made significant contributions to information-flow security, memory safety, program synthesis, and the verification of low-level systems. His work often bridges theoretical foundations with practical applications, particularly through the development of verified systems using Coq and other proof assistants. Analysis of his recent publications reveals a strong focus on formal verification techniques, particularly using Interaction Trees and the Coq proof assistant. His research trajectory shows consistent evolution from foundational work on information-flow security toward increasingly sophisticated verification of complex systems including LLVM, quantum computing, and distributed systems. His work demonstrates a commitment to building practically useful verification tools while maintaining rigorous theoretical foundations. Distinguished Paper Award for Semantics for Noninterference with Interaction Trees (ECOOP 2023) Schlein Family President's Distinguished Professor (2021) Distinguished Paper Award for Interaction Trees (POPL 2020) Christian R. and Mary F. Lindback Foundation Award for Distinguished Teaching (2018) IEEE MICRO top picks (2013) Alfred P. Sloan Fellow (2009-2010) NSF CAREER award (2004) Zdancewic has advised numerous PhD students who have gone on to successful careers in academia and industry. His research has been supported by significant grants from NSF, including the NSF Expedition on the Science of Deep Specification. He is actively involved in multiple major research projects including Vellvm (verified LLVM), DeepSpec, and quantum programming verification. Zdancewic also co-organizes Penn's PL Club programming languages research group with Benjamin Pierce and Stephanie Weirich.

Martin Henzمشاهده پروفایل

دانشیار

• Programming Languages
• Software Engineering
• Artificial Intelligence
• +۸ مورد دیگر

Martin Henz is an Associate Professor at the National University of Singapore , affiliated with the School of Computing and its Department of Computer Science . His academic journey includes an M.Sc. in Computer Science from Stony Brook University (1993) and a Dr.rer.nat. in Computer Science from Saarland University (1997). He has also worked as a Research Scientist at the German Research Centre for Artificial Intelligence. Research Focus : Scalable Experiential Learning, Systems for Teaching/Learning, AI in Education, Programming Languages, Algorithms, and Constraint Programming. Key Projects : Source Academy (immersive programming environment), Deep Teaching (LMS enhancements), and NUS Seafarers (maritime experiential learning). Publications span education technology, programming languages, and sustainable engineering, with recent works focusing on JavaScript-based pedagogy, automated question generation, and electric vehicle conversions. He supervised Rahul Singhal 's PhD, leading to the educational startup Cerebry, and co-founded Workforce Optimizer Pte Ltd with Alan Sevugan. Awards : NUS Annual Digital Education Award (2021) NUS Annual Teaching Excellence Award (2016/17) Fulbright Scholarship (1990) Startup @ Singapore Champion (2001)

Wilfried Siegمشاهده پروفایل

استاد

• Foundations of Mathematics
• Proof Theory
• History of Logic
• +۳ مورد دیگر

Wilfried Sieg serves as the Patrick Suppes Professor of Philosophy at Carnegie Mellon University within the Dietrich College of Humanities and Social Sciences, where he has been a core faculty member since 1985. He previously held appointments at Columbia University (1977-1985) and co-founded CMU's interdisciplinary Pure and Applied Logic program. His educational background includes: Ph.D. in Philosophy, Mathematical Logic, and Foundations of Mathematics from Stanford University (1977) M.S. in Mathematics and Logic from Westfälische-Wilhelms-Universität, Münster (1971) B.S. in Mathematics and Physics from Freie Universität, Berlin (1969) Sieg's research fundamentally explores the Foundations of Mathematics through proof theory, with significant contributions to the History of Modern Logic and Philosophy of Mathematics. His work critically examines Hilbert's Program, Gödel's incompleteness theorems, and the historical development of computability concepts. He emphasizes the dialectic between mathematical practice and philosophical reflection, revealing how foundational positions shape and are shaped by mathematical developments. Analysis of his recent publications shows a sustained trajectory from historical-philosophical investigations toward computational implementations, particularly through the AProS project. This evolution reflects growing integration of proof-theoretic insights with automated reasoning systems, focusing on heuristic search algorithms and cognitive modeling of mathematical reasoning. Sieg directs the Laboratory for Symbolic & Educational Computing (LSEC), which develops pedagogical tools like the AProS proof tutor. His grant-funded projects include editorial work on Hilbert, Gödel, and Bernays supported by the German National Science Foundation, Sloan Foundation, and National Endowment for the Humanities, alongside NSF-funded development of web-based logic education. He has advised numerous graduate students through research seminars while maintaining active collaboration with computer science and mathematics departments.

Philip Wadlerمشاهده پروفایل

استاد

• Theoretical Computer Science
• Functional Programming
• Programming Language Foundations
• +۶ مورد دیگر

Philip Wadler is Professor of Theoretical Computer Science at the University of Edinburgh and Senior Research Fellow at IOHK. He is an ACM Fellow, Fellow of the Royal Society, and Fellow of the Royal Society of Edinburgh. His work spans programming language design, type systems, and formal verification, with significant contributions to Haskell, Java, and XQuery. He has held leadership roles in ACM SIGPLAN and served on editorial boards for major journals. Research Interests: Wadler's research focuses on the foundations of programming languages , including Gradual and session typing Language-integrated query Functional and logic programming XML data models Parametricity and free theorems Verification of smart contracts Publication Trends: Recent articles emphasize type safety, formal verification, and blockchain applications. Key themes include gradual typing (blame calculus), session types for concurrency, and logical foundations of programming. His 2015–2025 papers show sustained focus on type theory and language design . Awards & Recognition: POPL Most Influential Paper (2003 for 1993 work) SIGPLAN Distinguished Service Award Best Paper SBMF 2018 Royal Society-Wolfson Fellowship (2004–2009) ACM Fellow (2007) Fellow of Royal Society of Edinburgh (2005) Advising & Grants: He has supervised numerous PhD students in programs like the Centre for Doctoral Training in Pervasive Parallelism. His EPSRC Programme Grant "From Data Types to Session Types" (2013–2020) funded major advances in concurrency theory. Current work with IOHK explores blockchain verification using Haskell-based Plutus.