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

Eijiro Sumiiمشاهده پروفایل

استاد

• Programming Languages
• Type Systems
• Process Calculi
• +۳ مورد دیگر

Eijiro Sumii is a Professor at the Graduate School of Information Sciences, Tohoku University, where he has been employed since May 2014. Previously, he served as an Associate Professor at the same institution from May 2005 to March 2014, and as an Assistant Professor in the Department of Computer Science at the University of Tokyo from April 2001 to March 2003. He has also held research positions at the University of Pennsylvania under Professor Benjamin C. Pierce. Dr. Sumii's research focuses on the theoretical foundations and practical applications of programming languages and type systems. His work spans multiple domains including process calculi, partial evaluation, security foundations, and functional programming. He has made significant contributions to the field through his development of MinCaml, an educational compiler, and his Japanese translation of the seminal work "Types and Programming Languages" by Benjamin Pierce. His recent publications demonstrate a consistent focus on programming language theory, with particular emphasis on type systems for security applications, partial evaluation techniques, and functional programming paradigms. The publications reveal a trajectory moving from foundational theoretical work toward more applied security and distributed systems research. Dr. Sumii is highly active in the academic community, having served on program committees for major conferences including ICFP, POPL, PLAS, and ESOP. He has organized numerous workshops and conferences, including serving as program chair for ICFP 2016 and FLOPS 2014. He is the organizer of the PEPT (Partial Evaluation and Program Transformation) mailing list, which serves as an important forum for researchers in this specialized area. His leadership extends to membership in the Global Young Academy since May 2015 and the Young Academy of Japan since November 2010, where he served as Secretary from February 2015.

Jonathan Aldrichمشاهده پروفایل

استاد

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

Jonathan Aldrich is a Professor at Carnegie Mellon University's School of Computer Science, with joint appointments in the Software and Societal Systems Department and Computer Science Department. He directs the Master of Software Engineering program (as of July 2025) and previously led the Software Engineering Ph.D. program. Aldrich teaches courses in programming languages, software engineering, and program analysis. Education: Ph.D. in Computer Science and Engineering, University of Washington (2003) M.S. in Computer Science and Engineering, University of Washington (1999) B.S. in Engineering and Applied Science (Computer Science), Caltech (1997) Research Focus: Aldrich's work bridges programming languages and software engineering to improve software quality and productivity. His research explores how structural and behavioral design aspects can be expressed in source code, enabling better tooling and error reduction. Key innovations include gradual verification systems, typestate-oriented programming, and ownership models for security. His projects span blockchain safety (Obsidian), concurrency (AEminium), and visualization (Penrose). Publication Trends: Aldrich's 15 most recent articles reflect a strong emphasis on language-based security, formal verification (especially gradual verification techniques), and human-centered language design. His work increasingly integrates empirical studies to evaluate usability in advanced type systems. Awards: NSF CAREER Award (2006) Dahl-Nygaard Junior Prize (2007) ICSE Most Influential Paper Award (2012) DARPA Computer Science Study Group (2007) William Chan Memorial Dissertation Award (2003) Leadership & Service: Aldrich directs graduate programs, co-authored the textbook 'Programming Language Pragmatics,' and serves on the ACM Publications Board. As CTO of Noteful, he develops educational music technology. He has chaired program committees for OOPSLA, ECOOP, and SPLASH conferences.

Jonathan Aldrichمشاهده پروفایل

استاد

• Programming Languages
• Software Engineering
• Verification
• +۷ مورد دیگر

Jonathan Aldrich is a Professor of Computer Science at Carnegie Mellon University in the School of Computer Science , jointly appointed in the Software and Societal Systems Department and the Computer Science Department . He is an internationally recognized expert in programming languages, software engineering, and verification, with a strong emphasis on human factors and usability in language design. Education: Ph.D. in Computer Science and Engineering, University of Washington (2003) B.S. in Computer Science, Caltech Research Interests: Prof. Aldrich's research lies at the intersection of programming languages and software engineering , focusing on how language design affects software quality and developer productivity. His work spans: Gradual verification and type systems Ownership and typestate checking Security and information flow control Usability of advanced type systems Domain-specific languages for blockchain and IoT Recent Work Trends: His recent publications emphasize gradual verification techniques, which allow developers to incrementally verify software correctness. He has also explored liquid types , information flow control , and usability barriers in advanced type systems. His work often combines formal methods with empirical studies to ensure practical impact. Awards & Recognition: NSF CAREER Award (2006) Dahl-Nygaard Junior Prize (2007) ICSE Most Influential Paper Award (2012) DARPA Computer Science Study Group Leadership & Service: Prof. Aldrich has held numerous leadership roles in the academic community, including: Director, CMU Software Engineering Ph.D. Program (2013–2019) General Chair, SPLASH 2015 Program Chair, OOPSLA 2017 Steering Committee Chair, SPLASH (2017–2019) Member, ACM Publications Board Industry Engagement: He is the Chief Technology Officer of Noteful , a startup he co-founded during his 2022 sabbatical, focused on music education through interactive apps.

Simon J Gayمشاهده پروفایل

استاد

• Programming Languages
• Quantum Computing
• Formal Verification
• +۳ مورد دیگر

Simon J. Gay is a Professor and Head of the School of Computing Science at the University of Glasgow. His primary roles include leading the school and advancing research in programming languages and quantum computing. He holds a PhD from Imperial College London and has held academic positions at Royal Holloway, University of London, and Imperial College London. Education: MA in Pure and Applied Mathematics (University of Cambridge), PhD in Computing (Imperial College London). Research interests focus on programming languages (especially communication-centric software design) and quantum computing, including verification techniques for quantum systems. He leads the EPSRC-funded STARDUST project on session types and participates in the EU RISE BehAPI project on behavioral APIs. Key contributions include tools like Mungo/StMungo for session type analysis, work on quantum protocol verification (e.g., QMC model checker), and foundational research in session types for distributed systems. His recent work addresses asynchronous communication, quantum concurrency, and runtime adaptation in actor-based systems. Grants: Session Types for Reliable Distributed Systems (EPSRC), BehAPI (EU H2020), and others. Supervised students include Arwa Hameed Alsubhi (interoperability of typestate tools) and Jacob Trevor (quantum computation memory management).

Eran Yahavمشاهده پروفایل

استاد

• Programming Languages
• Software Engineering
• Program Analysis
• +۱۲ مورد دیگر

Eran Yahav is a Professor in the Computer Science Department at the Technion, Israel Institute of Technology, and serves as CTO at Tabnine. His research bridges programming languages, software engineering, program analysis, and machine learning, focusing on program synthesis, verification, and code intelligence. Research Interests: His work spans program synthesis , abstract interpretation , verification of concurrent systems , binary analysis , and AI for code . He leads the PRIME project, which uses machine learning and static analysis to enable programming with millions of examples, improving code completion, search, and prediction. The recent publications reflect a strong trend toward integrating neural models with program analysis—using structured representations of code (e.g., AST paths) for property prediction, generating sequences from code (code2seq), learning distributed representations (code2vec), and interpreting neural networks via automata extraction. His work consistently appears in top-tier venues such as POPL, PLDI, ICSE, OOPSLA, and ICLR. Scientific Awards: Best paper award at ISSTA'07 Best paper award at ISSTA'06 Advising and Grants: He has advised numerous PhD and Master’s students, many of whom have published in premier conferences and now hold academic or industry positions. While specific grants are not mentioned, his sustained high-impact research and leadership in major projects (e.g., PRIME, Fender, SAFE) imply significant funding support. He has served on program committees for PLDI, POPL, CAV, OOPSLA, and VMCAI, reflecting his standing in the programming languages and verification communities. Labs and Teams: He leads a research group focused on program analysis and synthesis, with strong collaborations, particularly with Martin Vechev and others, on concurrency, synthesis, and machine learning for code. The group has developed influential tools such as PRIME, code2seq, code2vec, TRACY, and SAFE.

Sergio Moverمشاهده پروفایل

استاد

• Formal Methods
• Model Checking
• Satisfiability Modulo Theories (SMT)
• +۳ مورد دیگر

Sergio Mover is a Professor at the Department of Computer Science , Polytechnic Institute of Paris , affiliated with the Cosynus team and the LIX - Computer Science Laboratory . His research focuses on formal methods , particularly model checking using SMT for hybrid systems, embedded software, and program analysis. He has contributed to tools like HyCOMP , nuXmv , and SABBATH . Research interests include: Formal verification of infinite-state systems Symbolic model checking Hybrid system stability Callback protocol analysis Relational abstraction techniques In 2024, he published a book on abstraction techniques for symbolic model checking. His work has been featured at top conferences like CAV , FMCAD , and ICLR . Awards include the IEEE TCSE Distinguished Paper Award (2018) and Best Paper at FMCAD 2012 . He collaborates with researchers such as Alessandro Cimatti , Stefano Tonetta , and Bor-Yuh Evan Chang , focusing on hybrid systems, Android callback protocols, and SMT-based verification.

• Informatics
• Computer Science
• Process Calculi
• +۴ مورد دیگر

Mario Bravetti is a Full Professor at the Department of Computer Science and Engineering, University of Bologna. His academic discipline is Informatics (INFO-01/A). He specializes in formal methods, process calculi, and distributed systems, with a focus on session types, microservices architecture, and formal verification of software systems. His research bridges theoretical foundations with practical applications in cloud computing, edge computing, and industry 4.0. Research interests include: Session types and behavioral contracts Formal semantics of concurrent systems Microservices deployment and orchestration Low-latency anomaly detection in industrial IoT Formal verification tools for programming languages His recent work emphasizes proactive-reactive scaling strategies for microservices and the integration of formal methods into cloud-native architectures. He has contributed to projects like SEAWALL and the BETTY COST Action, advancing software reliability in large-scale systems. His articles highlight advancements in session subtyping algorithms, typestate systems for Java, and edge-cloud continuum optimizations. He has served as a guest editor for journals on service-oriented architectures and formal methods.

• Theoretical Computer Science
• Programming Languages
• Formal Methods
• +۵ مورد دیگر

Nikos Tzevelekos is a Senior Lecturer at Queen Mary University of London's School of Electronic Engineering and Computer Science, affiliated with the Theory Group and the Centre for Fundamental Computer Science. He holds a PhD from the University of Oxford's Department of Computer Science and previously worked as a postdoctoral researcher there. His primary research interests include theoretical computer science, mathematical models of computation, programming languages, and formal methods. He explores game semantics and category theory to develop tools for program analysis and verification. Education: PhD in Computer Science, University of Oxford Research Interests: Dr. Tzevelekos focuses on foundational aspects of computation, including program semantics, automata over infinite alphabets, and the application of formal methods to software verification. His work bridges abstract theoretical models (e.g., game semantics) with practical tools for analyzing and verifying software systems. Awards: 2023: Distinguished Paper Award at LICS Grants & Advising: Lead researcher on the Innovate UK-funded grant Mokapot/Millr: Next Generation Cloud Computing Infrastructure (2019–2020). Labs/Teams: Member of the Theory Group at Queen Mary, contributing to the Centre for Fundamental Computer Science. Collaborates on projects involving automata theory, program equivalence, and formal verification techniques.

• Theoretical Computer Science
• Program Analysis
• Game Semantics
• +۳ مورد دیگر

Nikos Tzevelekos is a Senior Lecturer in the School of Electronic Engineering and Computer Science at Queen Mary University of London (QMUL), and a member of the Theory Group and Centre for Fundamental Computer Science. His research focuses on theoretical computer science, particularly the mathematical foundations of computation. He develops formal models of programming languages using game semantics and category theory, with applications to program analysis and verification. Tzevelekos holds a PhD from the University of Oxford and previously served as a postdoctoral researcher there within the Quantum Group. His research interests include program equivalence, automata theory over infinite alphabets, and formal verification techniques. He has organized workshops such as the Workshop on Program Equivalence (2016) and contributed to conferences like LICS, POPL, and FOSSACS. Tzevelekos has received funding, including a £44,502 grant from Innovate UK for the Mokapot/Millr project on cloud computing infrastructure. He teaches computer science courses at QMUL and maintains an active presence in the academic community, participating in events like LICS 2025 and POPL 2024. His work bridges foundational theory with practical tools for software analysis, emphasizing the mathematical rigor of computational systems.

• Formal Methods
• Programming Languages
• Concurrency Theory
• +۳ مورد دیگر

Marco Giunti is a Researcher at the University of Oxford's Department of Computer Science. His work focuses on formal methods, programming languages, and distributed systems, with a particular emphasis on session types, concurrency theory, and blockchain technology. He explores topics such as typestate systems, formal verification, and secure channel abstractions. Recent research highlights include advancements in iso-recursive multiparty sessions, blockchain consensus mechanisms (e.g., Lupin), and data-centric synchronization frameworks like AtomiS. His contributions bridge theoretical foundations with practical applications, addressing challenges in distributed systems and static analysis. Giunti's publications span technical reports and peer-reviewed articles, showcasing innovations in automated verification, type systems, and concurrency control. His work often emphasizes the intersection of formal methods and real-world distributed computing scenarios.

Ronald Garciaمشاهده پروفایل

دانشیار

• Programming Languages
• Gradual Typing
• Type Systems
• +۶ مورد دیگر

Ronald Garcia is an Associate Professor in the Department of Computer Science at the University of British Columbia, affiliated with the Faculty of Science and the Software Practices Lab. His research focuses on programming language theory, emphasizing gradual typing, type systems, and end-user programming. He teaches courses such as Programming Language Principles (CPSC 509) and Compiler Construction (CPSC 411). Education details are not explicitly stated in the provided texts, but his extensive academic contributions span over two decades. Research interests include formal semantics of programming languages, typestate systems, dependent types, and improving software practices for end-users. He has advised numerous Ph.D. and Master's students, contributing to over 30 academic publications. Recent work explores hybrid programming environments for end-users, runtime type slicing for debugging, and foundational frameworks for gradual dependent types. Garcia actively participates in academic conferences as a PC member and keynote speaker, notably in PLDI, POPL, and ICFP. His lab and collaborations focus on advancing theoretical foundations while addressing practical challenges in software development and education.