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

Éric Tanterمشاهده پروفایل

استاد

• Programming Languages
• Gradual Typing
• Software Engineering
• +۹ مورد دیگر

Éric Tanter is a Full Professor in the Computer Science Department (DCC) at the University of Chile, where he also leads the PLEIAD Lab. He holds an Inria International Chair (2025–2029) and is an Associate Researcher at the Millenium Institute for Foundational Research on Data (IMFD). His academic leadership includes prior roles as Director and Deputy Director of the DCC, and Coordinator of the PhD Program in Computer Science. His research centers on programming languages and software engineering, with a strong focus on gradual typing, type systems, program verification, and secure programming. He explores both theoretical foundations and empirical practices, aiming to bridge the gap between static and dynamic language paradigms. His recent work emphasizes gradual verification, refinement types, and applications in proof assistants and security. The trends in his recent publications show a deep engagement with foundational aspects of gradual and dependent typing, often aiming to enhance the reliability and security of software systems. These works frequently involve formalization in proof assistants like Coq and explore applications in differential privacy, secure interoperability, and symbolic execution. Inria International Chair (2025–2030) Best Paper Awards at POPL 2019, OOPSLA 2018, ICFP 2018, MSR 2011, AOSD 2010, SBLP 2008, DAIS 2006 Most Influential/Most Notable Paper Awards at DLS, Programming, DLS Facebook Research Testing and Verification Award (2018) Google Faculty Research Awards (2015, 2016) Best Professor Award, University of Chile (2011) Éric Tanter has advised numerous PhD and Master’s students, many of whom have gone on to publish influential work in top venues. He has led multiple research projects funded by FONDECYT, ANID, INRIA, and other national and international agencies. His service includes editorial roles in journals such as the Journal of Functional Programming and Science of Computer Programming, and extensive participation in program committees of major conferences like POPL, ICFP, and OOPSLA. He leads the PLEIAD Lab at the University of Chile, a research group focused on programming languages, software engineering, and formal methods. The lab fosters collaboration with international institutions and emphasizes both theoretical rigor and practical impact.

Sarah E. Chasinsمشاهده پروفایل

استادیار

• Programming Languages
• Human-Computer Interaction
• Program Synthesis
• +۳ مورد دیگر

Sarah E. Chasins is an Assistant Professor in the Electrical Engineering and Computer Sciences (EECS) department at the University of California, Berkeley, with research spanning programming languages and human-computer interaction. She leads the PLAIT Lab (Programming Languages for Approachable and Inclusive Tools) and serves as a faculty affiliate at the Berkeley Institute for Data Science (BIDS). Her work bridges computer science with social sciences, climate reporting, legal systems, and biological research through extensive collaborations. Dr. Chasins' research focuses on democratizing programming for non-traditional programmers including scientists, social scientists, journalists, and data scientists. Her work emphasizes creating approachable programming tools that help practitioners reach correct programs while understanding, extending, and trusting those programs. She specifically investigates program synthesis, programming tools for scientific domains, and human-centered programming language design. Her research mission aims to make programming a path to a more informed and evidence-driven society rather than just a way to get wrong answers faster. Her recent publications demonstrate a clear trajectory toward making programming more accessible and understandable. The work spans code search techniques, program synthesis approaches, refactoring tools, and studies of how domain experts interact with programming languages. A consistent theme across her research is placing human needs at the center of programming language design and implementation. Dr. Chasins actively mentors PhD students including Justin Lubin, Eric Rawn, Parker Ziegler, Sarah "Slim" Lim, Hellina Hailu Nigatu, David Minh-Duy Cao, and Marlena Preigh. She has previously advised numerous master's and undergraduate students who have gone on to work in both academia and industry. Her teaching includes core courses like CS164 (Programming Languages and Compilers) and specialized courses like CS294-184 (Building User-Centered Programming Tools) and CS39-001 (Technology, Society, and Power). She maintains an active service record in the programming languages community, having served on program committees for major conferences including PLDI, POPL, OOPSLA, and SPLASH. Notably, she co-chaired the Student Research Competition at PLDI 2020 and 2021 and has been involved in organizing workshops focused on programming languages and human-computer interaction.

Haiyang Aiمشاهده پروفایل

دانشیار

• Corpus Linguistics
• Natural Language Processing
• Second Language Acquisition
• +۳ مورد دیگر

Haiyang Ai is an Associate Professor in the Literacy and Second Language Studies program at the University of Cincinnati's School of Education. His research applies corpus linguistics and natural language processing to investigate second language acquisition, writing complexity, and bilingual language processing. His educational background includes a Ph.D. in Applied Linguistics from The Pennsylvania State University (2015), an M.A. in Linguistics & Applied Linguistics from the University of Chinese Academy of Sciences (2006), and a B.A. in English from Shaanxi Normal University (2003). Dr. Ai's research spans corpus linguistics, natural language processing, second language acquisition, and computer-assisted language learning. He specializes in compiling and analyzing native and learner corpora to develop intelligent language learning systems and investigate lexical/syntactic complexity in L2 writing. His methodological approach integrates computational tools with theoretical linguistics to address practical language teaching challenges. His recent publications (2019-2023) demonstrate consistent focus on lexical bundles in professional communication, automating complexity measurement in Chinese, speech perception mechanisms in bilinguals, and grammatical puzzles in English learning. These works bridge corpus-based analysis with psycholinguistic experimentation across diverse subfields including morphosyntax, pragmatic competence, and cognitive processing in L2 acquisition. Dr. Ai has secured multiple University of Cincinnati grants including three CECH Faculty Development Grants ($2500 in 2017-2018 for verb-noun collocation research, $2000 in 2016-2017 for corrective feedback tools) and the NCFDD Faculty Success Program ($3250 in 2017), all supporting his development of computational language learning resources.

Jonathan Ragan-Kelleyمشاهده پروفایل

استادیار

• High-Efficiency Visual Computing
• Compilers
• Computer Architecture
• +۳ مورد دیگر

Jonathan Ragan-Kelley is the Esther and Harold E. Edgerton Assistant Professor of Electrical Engineering & Computer Science at MIT and an Assistant Professor of EECS at UC Berkeley. He leads the Visual Computing group at CSAIL, focusing on high-efficiency visual computing, compilers, and architectures for image processing, machine learning, and 3D rendering. His research bridges systems, compilers, and hardware design, emphasizing scalable solutions for computational challenges. Education: PhD in Computer Science from MIT (2014), postdoc at Stanford University, and visiting researcher at Google. He co-created the Halide language and has developed multiple domain-specific languages (DSLs) and compiler systems. Research interests include compiler optimization, scheduling languages (e.g., Exo), and efficient computing frameworks. He has received awards such as the NSF CAREER Award and ACM SIGGRAPH’s Significant New Researcher Award. Awards: ACM SIGGRAPH Award, NSF CAREER, Intel Outstanding Researcher Award Key Contributions: Halide compiler framework, Exo scheduling language, machine learning acceleration techniques Labs/Teams: Visual Computing at MIT CSAIL

• Old Norse Literature
• Philology
• Old Germanic Literature
• +۳ مورد دیگر

Per Daniel Sävborg is a Professor of Scandinavian Studies at the University of Tartu's Faculty of Arts and Humanities, affiliated with the Institute of Foreign Languages and Cultures. He holds a Doctor's Degree from the University of Stockholm (1997), specializing in Old Norse literature and philology. His career includes roles as Head of Office and Programme Director in Tartu's foreign languages departments, alongside research positions at Uppsala University and the University of Iceland. Sävborg's research focuses on Old Norse literature, medieval Scandinavian folklore, Icelandic sagas, and Eddic poetry. He has led major projects such as 'Formulae in Icelandic Saga Literature' (2019-2022) and 'Viking Dynasties: Royal Families of Lejre and Uppsala' (2018-2019). His publications span book chapters, edited volumes, and articles in journals like Religionsvidenskabeligt Tidsskrift and Ethnologia Scandinavica . Notable works include analyses of Old Norse mythological themes, interdisciplinary Viking Age studies, and editorial contributions to sagas and epic poetry. Sävborg advises numerous doctoral and master’s students on topics ranging from medieval Nordic narratives to folklore. His work bridges literary, historical, and archaeological perspectives, emphasizing cultural memory and textual evolution.

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

Manuel Rigger is an Assistant Professor at the National University of Singapore (NUS), leading the TEST Lab (Trustworthy Engineering of Software Technologies) within the PL/SE group at the School of Computing. His research focuses on improving the reliability of data-centric systems through automated testing frameworks and formal methods. Education : PhD from Johannes Kepler University Linz (supervised by Hanspeter Mössenböck), postdoctoral work at ETH Zurich (Advanced Software Technologies Lab under Zhendong Su). Research Interests : Automated testing of database systems Programming language design and verification Incremental build systems Formal methods for software reliability Key Contributions : Developed tools like SQLancer (for finding bugs in databases) and CERT (performance issue detection). His work has uncovered over 800 bugs in real-world systems. Awards : Recipient of the ERC Consolidator Grant (2025) for groundbreaking research in software security and testing. Service Roles : Organizer of ICFP/SPLASH 2025 Outdoor Activities, committee member for OOPSLA Review, PLDI Artifact Evaluation, and ICSE Program Committee. Also actively involved in organizing workshops (e.g., Fuzzing & Software Security Summer School 2025).

Kurtis R. Schaefferمشاهده پروفایل

استاد

• Buddhist literature
• Tibetan Studies
• Tibetan History
• +۷ مورد دیگر

Kurtis R. Schaeffer serves as the Frances Myers Ball Professor in the Department of Religious Studies at the University of Virginia. With over twenty-five years of specialized research experience, he has established himself as a leading scholar in Tibetan Buddhist literature and religious culture, with particular expertise in narrative and poetic traditions across Tibet, India, and Bhutan. BA, Department of Religious Studies, Lewis & Clark College BA, The Evergreen State College, Area of Emphasis: Buddhist Studies MA, Department of Asian Languages and Literatures, The University of Washington PhD, Department of Sanskrit and Indian Studies, Harvard University Schaeffer's research centers on the narrative and poetic literature of Buddhism across the Himalayan region, with extensive work on stories of the Buddha, Buddhist saints, and famous Buddhist masters. His scholarship examines how religious narratives function within cultural contexts, particularly focusing on the creation and transmission of Buddhist literary traditions. He has published groundbreaking work on the lives of Tibetan religious figures who compiled the Tibetan Buddhist Canons, the biography of a Himalayan Buddhist nun, and the evolution of stories about the Indian yogi Saraha through Tibetan history. More recently, he has expanded his research to explore the rich visual narratives of the Buddha in Tibet and Bhutan, integrating art historical approaches with textual analysis. Schaeffer's scholarly output reveals a consistent trajectory from textual analysis toward interdisciplinary approaches that bridge traditional religious studies with digital humanities. His publications include major monographs, edited volumes, and academic papers that demonstrate deep engagement with primary Tibetan sources while addressing broader theoretical questions about religious narrative, cultural transmission, and the materiality of religious texts. The progression from works like Himalayan Hermitess (2004) to his collaborative Life of the Buddha project shows an evolution toward multimodal scholarship that combines textual, visual, and digital elements. Schaeffer has held significant leadership positions including President of the Buddhist Digital Resource Center, the world's largest digital repository of Buddhist texts, and previously served as Chair of the Department of Religious Studies from 2012 to 2020. His work extends beyond traditional academic boundaries through public-facing initiatives that connect religious scholarship with contemporary social issues. Currently, Schaeffer co-directs the Religion, Race, & Democracy Lab with Martien Halvorson-Taylor, which produces the "Sacred & Profane" podcast exploring religion's role in daily life. He also co-directs The Sanctuary Lab with Halvorson-Taylor and Willis Jenkins, bringing together artists, humanists, and scientists to examine how religious connections to special places impact environmental perceptions and climate change understanding. His collaborative Life of the Buddha project combines art, literature, and digital humanities to make the largest narrative mural of the Buddha's life in Tibet accessible to the public.

Tobias Nipkowمشاهده پروفایل

استاد

• Formal Methods
• Interactive Theorem Proving
• Program Verification
• +۹ مورد دیگر

Professor Tobias Nipkow is a leading researcher in formal methods and interactive theorem proving at the Technical University of Munich (TUM), affiliated with the School of Computation, Information and Technology and the Department of Computer Science. He is a core developer of the Isabelle proof assistant and leads the Theorem Proving Group. His work has profoundly influenced program verification, semantics, and formalized mathematics. University: Technical University of Munich School: School of Computation, Information and Technology Department: Department of Computer Science Research Group: Theorem Proving Group Key Projects: Isabelle, Archive of Formal Proofs, Concrete Semantics His research focuses on formal verification, higher-order logic, semantics of programming languages, and verified algorithms. He has pioneered the formalization of textbook algorithms, data structures like B+-trees and quadtrees, and logical systems. His work bridges theoretical foundations with practical tools for software correctness. The most recent publications show a strong trend in verifying classical algorithms (e.g., Gale-Shapley, Earley parser), data structures (B+-trees, deques), and decision procedures, primarily using Isabelle/HOL. His contributions span foundational logic, program analysis, and educational approaches to formal methods. Best Paper Award at CADE 28 (2021) Tobias Nipkow has made extensive contributions to advising and collaborative research, co-authoring with numerous researchers and students. He has secured support for large-scale formalization efforts and contributed to major projects like the Flyspeck proof of the Kepler conjecture. His work is supported by ongoing development of the Isabelle framework and the Archive of Formal Proofs. He leads the Theorem Proving Group at TUM, which is central to the development and application of Isabelle. The group fosters international collaboration, contributes to the Archive of Formal Proofs, and advances research in automated reasoning, semantics, and verified systems.

Bianca Bascianoمشاهده پروفایل

دانشیار

• Chinese Linguistics
• Mandarin Morphology
• Syntax-Semantics Interface
• +۵ مورد دیگر

Bianca Basciano is an Associate Professor at the Department of Asian and North African Studies , Ca' Foscari University of Venice, where she has held the Director's Delegate for Research role since 2023. Her work focuses on Chinese linguistics , particularly Mandarin morphology, syntax, and second language acquisition. Research Areas: Chinese compounding, reduplication, causative constructions, resultative compounds, and language teaching methodologies. Teaching: Offers BA/MA courses in Chinese language and linguistics at Ca' Foscari University. Editorial Roles: Member of the editorial boards for Sinica Venetiana and Lingue e Linguaggio . Research Projects: Principal investigator for the PRIN 2020 project on Italian learners' acquisition of Chinese resultative verbs, with extensive corpus-based analysis. Collaborates with Giorgio Arcodia and other international scholars. Key Themes: Event structure delimitation, Vendlerian verb classes, micro-parametric syntactic variation. Publications: Over 40 works including monographs with Oxford University Press and Bologna University Press. Her methodological approach combines theoretical linguistics with corpus analysis, contributing to the understanding of Chinese as both a linguistic system and a second language acquisition challenge. She has also organized international conferences like the 31st IACL Annual Meeting.

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.

• Machine Learning
• Optimization
• Federated Learning
• +۸ مورد دیگر

Peter Richtarik is a Professor at the King Abdullah University of Science and Technology (KAUST), specializing in Machine Learning, Optimization, and Federated Learning. He actively teaches courses such as Stochastic Gradient Descent Methods and mentors PhD and MS students like Konstantin Burlachenko, Kai Yi, and Lukang Sun. His research spans distributed optimization, parameter-efficient fine-tuning, and theoretical frameworks for non-convex and non-smooth problems. Recent work includes 2025 contributions to Bernoulli-LoRA (theoretical PEFT) and Gluon (LMO-based optimizers). He co-developed Thanos (block-wise pruning) and BurTorch (CPU-optimized training framework). His publications focus on communication efficiency ( ATA , LoCoDL ), differential privacy ( DP-RBCD ), and stochastic proximal methods. Richtarik received the Charles Broyden Prize for his work on quasi-Newton methods. He frequently presents at workshops like MLSS in Senegal and FLOW seminars.

Pedro Fonsecaمشاهده پروفایل

استادیار

• Computer Security
• Operating Systems
• Distributed Systems
• +۴ مورد دیگر

Pedro Fonseca is an Assistant Professor at the Department of Computer Science, Purdue University. He leads the Reliable and Secure Systems Lab, focusing on building reliable and secure core software systems such as operating systems, hypervisors, and distributed systems. His research has been recognized with awards including the NSF CAREER Award and Google Faculty Research Awards. Before Purdue, he completed a postdoc at the University of Washington, working with Arvind Krishnamurthy, Hank Levy, and Xi Wang. He earned his PhD from MPI-SWS and the University of Saarland under Rodrigo Rodrigues. His academic contributions span over 30 peer-reviewed publications in top-tier conferences like SOSP, OSDI, EuroSys, and ASPLOS. He teaches courses including CS503 (Operating Systems), CS592 (Reliable and Secure Systems), and CS408 (Software Testing). He actively serves on program committees for major systems conferences including SOSP, OSDI, EuroSys, and ASPLOS.

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

استادیار

• Programming Languages
• Compilers
• Wireless Communications
• +۵ مورد دیگر

He Zhu is an Assistant Professor at Rutgers, The State University of New Jersey, affiliated with the Department of Computer Science. His research focuses on programming languages, compilers, wireless communications, IoT systems, and 5G network protocols. He received the PLDI 2019 Distinguished Paper Award for his contributions to formal methods in programming systems. His work addresses challenges in vehicle-to-everything (V2X) communication, resource allocation in sidelink networks, network security, and dynamic authorization frameworks for IoT devices. Key research interests include optimizing 5G NR (New Radio) protocols for vehicular environments, developing efficient data aggregation techniques for user equipment, and enhancing service layer mechanisms for IoT systems. He leads projects funded by the NSF, such as 'Formal Symbolic Reasoning of Deep Reinforcement Learning Systems,' and has contributed to advancements in beam management, RACH protocols, and energy-efficient DRX configurations in wireless networks. His office is located in Core 315. Notable Awards: PLDI 2019 Distinguished Paper Award Grants: NSF Grant: Formal Symbolic Reasoning of Deep Reinforcement Learning Systems His research group explores intersections between compiler design, distributed systems, and network architecture, with applications in smart mobility, edge computing, and secure IoT communication. He actively contributes to standards development for 5G and future generations of wireless networks.

Théo Winterhalterمشاهده پروفایل

پژوهشگر

• Type Theory
• Proof Assistants
• Formal Verification
• +۳ مورد دیگر

Théo Winterhalter is a researcher at INRIA Saclay and a member of the Laboratory of Mathematics and Computer Science (LMF) at ENS Paris-Saclay . He previously held a postdoctoral position at the Max Planck Institute for Security and Privacy (MPI-SP) and completed his PhD at the Gallinette research team in Nantes, supervised by Nicolas Tabareau and Matthieu Sozeau. Education PhD in Computer Science, 2017–2020, University of Nantes (Gallinette/Inria) MSc in Computer Science, École Normale Supérieure de Rennes Research interests include type theory , proof assistants , formal verification , and dependent types . He actively works on improving the safety and usability of proof assistants like Rocq (formerly Coq), focusing on rewrite rules, erasure, and cryptographic verification. His work often involves formalizing results within proof assistants and developing tools for verified programming. Contributions span conferences like POPL, ICFP, CPP, and TYPES. Recent projects include foundational verification of high-speed cryptography ( The Last Yard ), type-preserving rewrite rules ( The Rewster ), and modular cryptographic proofs ( SSProve ). His publications emphasize formal methods and computational assumptions in type theory. Teaching includes the Proof Assistants course at MPRI , a joint master’s program. He co-supervises PhD students like Yann Leray and has mentored interns on topics such as erased data implementation and Autosubst tooling. Labs and Teams : Deducteam (INRIA Saclay) – Developing deduction tools and formal verification LMF (ENS Paris-Saclay) – Laboratory for Mathematics and Computer Science Gallinette (former) – Team at INRIA Nantes MetaCoq Project – Collaborative effort on Coq verification

• Program Verification
• Program Synthesis
• Concurrency
• +۳ مورد دیگر

Roopsha Samanta serves as an Assistant Professor in the Department of Computer Science at Purdue University, where she leads the Purdue Formal Methods (PurForM) research group and participates in the Purdue Programming Languages (PurPL) initiative. Her academic foundation includes a PhD from the University of Texas, Austin (2013) and postdoctoral research at the Institute of Science and Technology Austria prior to joining Purdue in 2016. Education: PhD in Computer Science, University of Texas, Austin (2013) Postdoctoral Researcher, Institute of Science and Technology Austria Professor Samanta's research centers on bridging formal methods with programming languages to enhance software reliability, with core expertise in program verification, program synthesis, and concurrency. Her work uniquely targets both professional developers and non-programmers, developing techniques to ensure programs align with user intent through automated reasoning and synthesis. Recent efforts focus on distributed systems verification where traditional methods face scalability challenges. Analysis of her 2020-2024 publications reveals a dominant trajectory in distributed agreement systems, particularly advancing parameterized verification for unbounded process networks. Key innovations include bounded verification techniques for doubly-unbounded systems, explainable synthesis through specification localization, and secure multi-party computation frameworks like HACCLE. Her work consistently integrates theoretical formal methods with practical system implementation. Scientific Awards: NSF CAREER Award (2019) for “Robustness of Inductive Reasoning Engines” Amazon Research Award (2021) supporting secure computation research Her research is primarily funded through competitive grants including the NSF CAREER award and Amazon Research Award, enabling exploration of verification robustness and secure multi-party computation. While specific advising details aren't publicly documented, her leadership of the PurForM group indicates active mentorship of graduate researchers in formal methods. Current projects suggest expanding applications to privacy-preserving technologies and explainable AI-assisted programming. The PurForM research group, under her direction, develops foundational tools for program verification and synthesis with emphasis on distributed and concurrent systems. Collaborations within PurPL and industry partners like Amazon drive translational research from theoretical models to practical verification frameworks applicable to real-world distributed infrastructure.