جست‌وجوی استاد و پژوهشگر

Yanhui Liمشاهده پروفایل

استادیار

• AI Testing and Debugging
• Mutation Testing
• Empirical software engineering
• +۵ مورد دیگر

Yanhui Li is an Assistant Professor at the Software Institute of Nanjing University, specializing in AI software testing and empirical software engineering. Holding a PhD from Southeast University, he actively contributes to both research and teaching in software engineering for AI systems. Institution: Nanjing University, Software Institute Academic Rank: Assistant Professor Teaching: Discrete Mathematics (2023-2025), Data Structure and Financial Algorithm (2016-2024), Advanced Algorithm (2024-2025) His research focuses on AI Testing and Debugging , Mutation Testing , and Empirical Software Engineering with applications in deep learning systems. Key areas include developing testing methodologies for machine learning fairness, word sense disambiguation models, and natural language inference systems. His work bridges theoretical formal methods with practical software analysis techniques to improve AI system reliability. Analysis of recent publications (2023-2025) reveals strong emphasis on testing deep learning components (40% of works), mutation testing adaptations (25%), and empirical studies of software engineering practices (20%). His research increasingly integrates causal analysis with traditional testing techniques, particularly for fairness evaluation in ML systems. 2019 Nanjing University 'Most Loved Teacher' Award (top 9 university-wide) 2020 Nanjing University 'Most Loved Teacher' Award (top 7 university-wide) 2022 & 2024 'Best Course' recognition for Data Structure and Financial Algorithm Dr. Li actively advises students and leads multiple research projects including National Natural Science Foundation funding for 'Semantic based testing data efficacy measurement for deep learning models'. His group recruits PhD and master's students specializing in AI software engineering, with emphasis on testing/debugging AI systems and empirical studies of AI development practices. Current projects include model-based code generation with Nanjing University of Aeronautics and Astronautics and Huawei-funded research on mixed-language programming environments.

Vincent St-Amourمشاهده پروفایل

دانشیار

• Programming Languages
• Compilers
• Performance Optimization
• +۳ مورد دیگر

Vincent St-Amour is an Associate Professor of Instruction in the Department of Computer Science at Northwestern University's McCormick School of Engineering. His research focuses on programming languages, compilers, and performance tools, particularly within the Racket ecosystem. He has contributed to projects like the Racket compiler and optimization tools, and is a core developer of the Racket language. Education: Ph.D. in Computer Science, Northeastern University (2015) B.Sc. in Computer Science, Université de Montréal (2009) Research Interests: Vincent's work emphasizes tools for non-experts, compilers, and language design. He actively contributes to open-source projects and has developed tools like the Performance Report DrRacket tool and optimization coaching systems for JavaScript. His research bridges theoretical language concepts and practical software engineering challenges. Key Contributions: Core developer of Racket, focusing on performance tools and the Typed Racket dialect Co-developer of optimization coaching frameworks Recipient of the 2018 SIGPLAN Software Award for Racket Awards: Faculty Service Award (2024) Peter J. Landin Award (2009) Multiple teaching awards including Associated Student Government Faculty Honor Roll Teaching & Service: Vincent teaches courses in programming languages, software engineering, and data structures. He chairs the Computer Science Curriculum Committee and advises student groups like Emerging Coders.

John Boylandمشاهده پروفایل

استاد

• Programming Languages
• Compilers
• Concurrency
• +۳ مورد دیگر

John Boyland is a Professor in the Department of Computer Science at the University of Wisconsin-Milwaukee (UWM), within the College of Engineering & Applied Science. He focuses on enabling programmers to enhance software efficiency and safety through research in programming languages, compilers, concurrency, and logic. His work includes static analysis techniques for detecting complex programming errors and formal methods for concurrency control. Education: PhD in Computer Science, University of California, Berkeley (1996) MS in Computer Science, University of California, Berkeley (1989) BS in Computer Science, University of California, Davis (1987) Research Interests: Boyland’s research emphasizes fractional permissions for resource management, static checking of concurrency, and compiler design. He has contributed to frameworks like SASyLF and tools for formal verification of programming languages. His work bridges theory and practice, addressing challenges in software correctness and efficiency. Publications: His recent work spans formal methods, concurrency control, and type systems. Notable themes include fractional permissions for concurrency safety, gradual typing, and compiler optimizations. Awards: NSF CAREER Award (2000) Phi Beta Kappa (1987) Herbert A. Young Medal (1987) Putnam Math Competition Honorable Mention (1986) Advising & Grants: Boyland has advised six student groups and received a prestigious NSF Career grant. He has also contributed to projects like Molhado, an architectural software configuration management system.

• Programming Languages
• Formal Methods
• POSIX Shell Semantics
• +۳ مورد دیگر

Michael Greenberg is an Assistant Professor in the Department of Computer Science at Stevens Institute of Technology's Schaefer School of Engineering. His research develops formal methods for practical systems, focusing on POSIX shell semantics, gradual typing, and network programming abstractions. He has received multiple awards including a Distinguished Paper Award at PLDI 2022 and Most Influential Paper for Flapjax (OOPSLA 2009). Dr. Greenberg's work spans programming language theory, executable semantics for shell scripting, and software-defined networking. His publications demonstrate strong integration of theoretical foundations with systems applications, particularly in improving shell script reliability and developing network verification frameworks. Recent work includes Kleene algebra extensions and parallelization techniques for shell scripts. He holds a PhD in Computer Science from the University of Pennsylvania (2013) and BA degrees in Computer Science and Egyptology from Brown University (2007). Dr. Greenberg actively contributes to program committees for PLDI, OOPSLA, and POPL, and serves on the POPL Steering Committee (2021-2024).

Kevin Heمشاهده پروفایل

استادیار

• Microeconomic Theory
• Behavioral Economics
• Social Learning
• +۵ مورد دیگر

Kevin He is an Assistant Professor of Economics at the University of Pennsylvania's School of Arts and Sciences. He holds a Ph.D. from Harvard University and was a postdoctoral fellow at Caltech. His research focuses on microeconomic theory, behavioral economics, and social learning dynamics, with applications to artificial intelligence, network economics, and experimental methods. He has received the Best Paper Award at ACM EC’21 for his work on Bayesian learning in networks. Research Interests: His primary areas include behavioral experiments analyzing AI alignment perceptions, the impact of network structures on information aggregation, and the evolution of learning mechanisms in strategic settings. He also explores topics like p-hacking mitigation, dynamic information preferences, and the design of incentive-compatible systems. Awards: Best Paper Award at ACM EC’21 (2021) Teaching: He has taught advanced courses such as Game Theory and Applications, Topics in Advanced Microeconomic Theory, and Behavioral Economics at both undergraduate and graduate levels. Labs/Teams: His research often involves interdisciplinary collaborations, particularly with computer scientists and statisticians, to address issues in algorithmic fairness, misinformation dynamics, and learning in complex systems.

Tijs van der Stormمشاهده پروفایل

استاد

• Computer Science
• Software Engineering
• Programming Languages
• +۴ مورد دیگر

Prof. Tijs van der Storm is a Full Professor in Software Engineering at the University of Groningen's Faculty of Science and Engineering. He holds a position as Senior Researcher at CWI. His expertise spans Computer Science and Software Engineering, focusing on programming languages, domain-specific languages, and language engineering. He is affiliated with the Bernoulli Institute and contributes to the Software Engineering department. Research Interests: Tijs van der Storm specializes in programming languages, software development methodologies, domain-specific languages, and model-driven engineering. His work emphasizes language design, tooling for software ecosystems, and interactive programming frameworks. He explores challenges in polyglot systems, schema evolution, and exploratory programming environments. Publications: His recent work includes frameworks for polyglot debugging (PolyDebug), studies on polyglot software development, and schema evolution techniques. Articles address both foundational and applied aspects of programming language design and software engineering practices. Awards: He has received prestigious awards such as the Distinguished Artifact Award (2021), SCAM Most Influential Paper Awards (2019), and Best Vision Paper Award (2018). These recognize his contributions to software engineering and language technologies. Advising and Collaborations: While specific student names are not listed, his research involves collaborations with institutions like CWI and international colleagues. Projects often involve tool development and empirical studies in software ecosystems. Labs and Teams: His work is part of the Bernoulli Institute's Software Engineering group, focusing on language engineering and software system design. He contributes to open-source tools like Rascal and frameworks for domain-specific language development.

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

استاد

• Theoretical Computer Science
• Functional Programming
• Programming Language Design
• +۱۱ مورد دیگر

Philip Wadler is a Professor of Theoretical Computer Science in the Laboratory for Foundations of Computer Science at the School of Informatics, University of Edinburgh, a position he has held since 2003. He is also a Senior Research Fellow and Area Leader in Programming Languages at IOHK. His career includes prior academic roles at the University of Glasgow and research positions at Bell Labs and Avaya Labs. He is a principal designer of the Haskell programming language and a leading figure in programming language theory. Education: B.S. Stanford University (1977), Ph.D. Carnegie-Mellon University (1982), Postdoc Oxford University (1983–1987) Wadler's research focuses on the intersection of logic, types, and programming languages. His work has profoundly influenced functional programming, type systems, concurrency, and formal methods. Key contributions include the design of Haskell, the development of the blame calculus for gradual typing, Featherweight Java as a formal model, and the Links language for web programming. He has also worked extensively on XML standards (XQuery, XSLT) and the Curry-Howard correspondence, most notably through his widely acclaimed article "Propositions as Types". His current research, supported by an EPSRC Programme Grant, explores session types and concurrency. His recent publications (2015–2025) reveal a consistent focus on type theory, particularly blame calculus, gradual typing, session types, and formal verification for blockchain and smart contracts. There is a strong emphasis on logical foundations, parametricity, and the application of theoretical concepts to practical systems, especially in the context of modern programming challenges like concurrency and distributed systems. SIGPLAN Distinguished Service Award, 2016 ACM Fellow, 2007 Fellow, Royal Society of Edinburgh, 2005 Wolfson-Royal Society Research Merit Award, 2004–2009 Most Influential POPL Paper Award 2003 (for 1993) Best Paper Award, SBMF 2018 Wadler has advised numerous PhD and Master's students and has been actively involved in the academic community through editorial roles (e.g., Journal of Functional Programming, Journal of Financial Technology), program committees for major conferences (POPL, ICFP, HOPL), and leadership in ACM SIGPLAN. He has led significant research projects such as the EPSRC Programme Grant 'From Data Types to Session Types' and has contributed to outreach and education through extensive lecturing, tutorials, and public talks. He is associated with key research groups including the Laboratory for Foundations of Computer Science at Edinburgh and the ABCD project, and collaborates with institutions and industry partners on topics ranging from programming language design to blockchain technology.

Meven Lennon-Bertrandمشاهده پروفایل

پژوهشگر

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

Meven Lennon-Bertrand is a post-doctoral researcher at the University of Cambridge, actively contributing to the fields of programming languages, type theory, and formal verification. His work centers on extending and analyzing proof assistants, particularly Coq, through metaprogramming and gradual typing. His research interests include: Gradual Typing and Mixed-Typed Systems Dependent Type Theory and the Calculus of Inductive Constructions Metaprogramming and Reflection in Coq Formalization of Logical Systems Algorithmic Type Checking and Conversion Case Analysis and Pattern Matching Semantics His recent publications reflect a strong trend toward integrating dynamic and static typing in dependently typed languages, improving the usability and correctness of proof assistants, and formalizing foundational aspects of type systems. Much of his work is associated with the MetaCoq project, aiming to provide a verified framework for Coq metaprogramming. Notable contributions include work on gradualizing dependent types, resolving issues with η-conversion in Coq, and equivalence of typed and untyped conversion algorithms. He has not listed any formal awards or scientific prizes in the provided texts. Meven advises no named students in the provided data. However, he actively collaborates on major research projects such as MetaCoq and participates in top-tier academic venues like POPL, CPP, and ICFP. He has not mentioned specific grants, but his research output suggests involvement in funded academic initiatives. His primary research activities are conducted within the MetaCoq team, a collaborative effort to build a fully verified metaprogramming framework for Coq. This involves formal verification of Coq’s kernel, reflection mechanisms, and code generation tools.

Matías Toro Ipinzaمشاهده پروفایل

استادیار

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

Matías Toro is an Assistant Professor at the University of Chile , affiliated with the Computer Science Department (DCC) and PLEIAD Lab . His work focuses on programming languages, particularly type systems and gradual typing. Research Interests: Programming Languages Type-and-effect Systems Gradual Typing Security Typing Substructural Type Systems Abstracting Gradual Typing Differential Privacy Recent Work Trends: His publications cover gradual typing extensions for parametricity, differential privacy, SQL engines, and information flow security. Keywords: type systems, programming languages, privacy-preserving computation, abstract interpretation, language design, parametricity. Scientific Awards: Distinguished Paper Award - superseded by JACM article "Gradual System F" (2022) Grants: Recipient of FONDECYT DE INICIACIÓN (2025), PROYECTO DE COLABORACIÓN INTERNACIONAL DFG-ANID (2024), FONDECYT (2020), and CONICYT scholarships (2015, 2013) for academic studies. Labs & Collaborations: Active in the PLEIAD Lab, contributing to programming language theory and type system design.

Matthias Felleisenمشاهده پروفایل

استاد

• Programming
• Programming Languages
• Type Systems
• +۵ مورد دیگر

Matthias Felleisen is a Professor in the College of Computer Science at Northeastern University. He is renowned for founding the PLT research group and pioneering the TeachScheme! educational initiative, which evolved into the Bootstrap project. His work spans programming languages, type systems, and educational tools. Affiliation: Northeastern University Academic Rank: Professor Research Interests: Programming Languages, Type Systems, Domain-Specific Languages, Concurrency Models His recent research includes type tailoring, effectful software contracts, and trace contracts. He has contributed extensively to programming language design and implementation, with a focus on gradual typing, language workbenches, and educational frameworks. Conference Contributions (2012-2025): ECOOP 2015-2025: Papers on gradual typing, contract systems ICFP 2016-2024: Research on Typed Racket, blame evaluation, concurrency SPLASH 2012-2023: OOPSLA papers on type migration, macros, visual syntax Mentoring Activities: Keynote speaker at PLMW 2016 ICFP 2020 mentoring sessions

• Programming Languages
• Formal Methods
• Computer Science Education
• +۴ مورد دیگر

Shriram Krishnamurthi is a Professor in the Computer Science Department at Brown University, Providence, RI. With a prolific research career spanning over three decades (from 1994 to present), he has made significant contributions across programming languages, formal methods, and computer science education. His work bridges theoretical foundations with practical educational applications, particularly in making complex concepts accessible to students. Dr. Krishnamurthi's research interests encompass programming languages, formal methods, type systems, and computer science education. His work often focuses on the intersection of these areas, particularly how to make formal methods and advanced programming concepts accessible to students through innovative language design and educational tools. He has developed several educational frameworks that have been adopted in both university and K-12 settings, demonstrating his commitment to improving computer science education at all levels. His recent publications reveal a strong focus on making formal methods more approachable through grounded language design, addressing student misconceptions in programming through innovative assessment techniques, and developing practical tools like Forge for teaching formal methods. His work on Rust's type system, privacy-aware static analysis, and document calculus demonstrates the breadth of his research interests while maintaining a consistent thread of improving programming language understanding and usability. As a dedicated educator and researcher, Krishnamurthi has mentored numerous PhD students who have become prominent researchers in their own right, including Ben Greenman, Tim Nelson, Kuang-Chen Lu, and Will Crichton. His collaborative approach is evident in his extensive publication record featuring collaborations with both established researchers and emerging scholars.

Cheng Zhangمشاهده پروفایل

پژوهشگر ارشد

• Programming Languages
• Formal Verification
• Computer Science Theory
• +۵ مورد دیگر

Cheng Zhang is a Research Fellow in the Programming Principles, Logic, and Verification Group at University College London (UCL). He holds a PhD in Computer Science from Boston University (2024), advised by Prof. Marco Gaboardi, and a BS in Mathematics from Wheaton College (2018). His research focuses on programming languages, formal verification, and algebraic methods, with contributions to Kleene Algebra extensions, dependently typed languages, and verification frameworks. He has published in top venues such as POPL, CSL, and ICALP. Key publications include work on CF-GKAT for control-flow validation (POPL 2025), undecidability in Kleene Algebra (CSL 2025), and corrected formal methods in TopKAT (ICALP 2024). His PhD thesis explored algebraic variants of Kleene Algebra with applications to program logics. Zhang has taught courses at BU, including Principles of Programming Languages and Algebraic Algorithms. He contributes to open-source projects like Unicode Math Input for VSCode , advancing tooling for mathematical symbol insertion.

Wietske Bijkerمشاهده پروفایل

استادیار

• Remote Sensing
• Environmental Monitoring
• Vegetation Analysis
• +۵ مورد دیگر

Wietske Bijker is an Assistant Professor at the University of Twente, affiliated with the Department of Earth Observation Science (Faculty of Geo-Information Science and Earth Observation) and the Digital Society Institute. Her research focuses on remote sensing applications for monitoring vegetated surfaces, including forestry, agriculture, and urban tree systems. She holds an MSc in Soil Science from Wageningen University (1990) and a PhD on radar-based rainforest monitoring (1997). Her expertise spans multi-temporal remote sensing, image classification, and monitoring of gradual environmental changes. She has led projects such as SMARTseeds (vegetable farming in Indonesia) and contributed to initiatives like the STARS program for smallholder agriculture monitoring. She teaches modules on change detection, vague object monitoring, and geoinformatics at the University of Twente. Her research emphasizes practical applications, such as using Sentinel-1 SAR data for forest moisture stress analysis and developing open-source tools for ecosystem restoration impact evaluation. She collaborates internationally on capacity-building projects, including audits of disaster-related aid and drought monitoring in Africa. Her 118+ publications span topics like shoreline change analysis, crop-type mapping, and urban land use classification. She actively contributes to UN Sustainable Development Goals, particularly in conservation and sustainable agriculture.

Joseph Eremondiمشاهده پروفایل

استادیار

• Dependent Types
• Programming Languages
• Formal Verification
• +۲ مورد دیگر

Joseph Eremondi is an Assistant Professor in the Department of Computer Science at the University of Regina, specializing in programming language theory and design. His research develops tools to enhance usability of dependently typed programming languages, which enable mathematical specification and verification of code behavior. Current projects include gradual dependent types, semantics for pattern matching, termination proof techniques, and compiler error diagnosis. Eremondi's publications advance formal foundations for programming language design while addressing practical usability concerns. Recent work establishes theoretical foundations for gradual dependent typing and develops ordinal notations for termination verification. He teaches courses in programming language concepts and formal verification, including courses on Agda-based program verification.

Gregor Richardsمشاهده پروفایل

دانشیار

• Programming Languages
• Compilers
• Gradual Typing
• +۳ مورد دیگر

Gregor Richards is an Associate Professor in the Teaching Stream at the University of Waterloo. He holds a Ph.D. from Purdue University (2014) and a B.Sc. from Portland State University (2008). His research focuses on gradual typing in programming languages and just-in-time compilation techniques. He teaches courses such as CS442 (Programming Languages) and CS241 (Foundations of Sequential Programming), emphasizing languages and systems education. His work bridges theoretical compiler design with practical language implementation challenges.