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

• Social Pedagogy
• Social Education
• Youth Empowerment
• +۴ مورد دیگر

Carme Trull Oliva is a Lecturer at the Department of Pedagogy, University of Girona, specializing in Social Pedagogy and Social Education. Her work focuses on youth empowerment, community development, and socio-educational policy evaluation, with particular emphasis on vulnerable populations and restorative justice approaches. Doctorate in Education (University of Girona, 2021) Postdoctoral researcher at University of Barcelona (2022-present) Member of multiple research groups including Liberis Research Group on Childhood, Youth and Community Her research explores theoretical frameworks for youth empowerment through community-based interventions, leisure activities, and restorative approaches. She has developed evaluation rubrics for empowerment projects and analyzed pandemic impacts on youth services. Recent publications examine digitalization challenges in social pedagogy, community resilience models, and policy implications. Key research directions include: Socio-educational policy implementation Restorative justice in youth work Community-based empowerment strategies Post-pandemic educational adaptation Positive youth development frameworks Methodological innovation in social research Major awards include: Margarita Salas Grant for university requalification (2022) Extraordinary Doctoral Award in Education (2022) 1st International Educational Research Award (2021) Cum Laude doctoral recognition (2021) Extraordinary award for Bachelor's Degree (2016) AGAUR research staff recruitment aid (2018) She has extensive practical experience in youth leisure programs, residential educational centers, and summer camps. Current teaching includes Social Education Degree and Interuniversity Master's in Youth and Society programs at University of Girona, while conducting postdoctoral work at University of Barcelona.

Neil Julien Rossمشاهده پروفایل

دانشیار

• Quantum Computing
• Quantum Programming Languages
• Quantum Circuit Design
• +۳ مورد دیگر

Neil Julien Ross is an Associate Professor in the Department of Mathematics at Dalhousie University. His research primarily focuses on quantum computing and quantum programming languages, with extensive contributions to quantum circuit design, optimization, and formal verification methods. He maintains an active research profile with numerous publications in top-tier quantum computing conferences and journals. His research interests span: Quantum circuit synthesis and optimization techniques Formal methods for quantum programming languages (e.g., Proto-Quipper) Algebraic structures in quantum computation Quantum gate universality and resource theory Category theory applications in quantum information Ross's recent publications demonstrate a consistent focus on advancing quantum circuit design methodologies, particularly through symbolic synthesis techniques and formal verification approaches. His work frequently bridges theoretical computer science, algebraic structures, and practical quantum implementation challenges.

Soham Chakrabortyمشاهده پروفایل

استادیار

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

Soham Chakraborty is an Assistant Professor at the Programming Languages Group, TU Delft since 2021. He previously served as an Assistant Professor at the CSE Department, IIT Delhi before joining TU Delft. His academic journey includes a PhD from Max Planck Institute for Software Systems (MPI-SWS) in 2019 and a Master's degree from CSE Department, IIT Kharagpur in 2008. Affiliation: TU Delft, IIT Delhi, MPI-SWS Research Interests: Programming Languages, Compilers, Architecture, Verification, Concurrency His research focuses on formal semantics, compiler correctness, architecture-to-architecture translation, and verification of weak memory models. He has contributed to major conferences including POPL, PLDI, CGO, and ASPLOS. His work addresses challenges in heterogeneous concurrency, relaxed memory concurrency, and binary translation for weak memory architectures. Recent works include How Hard is Weak-Memory Testing? (POPL'24) and Toast: A Heterogeneous Memory Management System (PACT'24). He also received the Distinguished Paper Award at DATE'25 and Distinguished Artifact Award at PODC'22 . Teaching: Courses like Concepts of Programming Languages (CS2120), Parallel and Concurrent Programming (CS4555), Compiler Construction (CS4555), Analysis of Concurrent and Distributed Programs (CS4405), Software Fundamentals (Rust), and Seminar Programming Languages (COL 380) Students: PhD student Dennis Sprokholt, MSc students Michal Raczkiewicz, Alexandru Dumitriu, Huixuan Wu, and alumni including Pieter van den Ham, Mingyu Gao, Jeroen Kloppenburg, and others. Service: Served on program committees for POPL, PLDI, CGO, VMCAI, APLAS, and Eurosys workshops.

Stefan K. Mullerمشاهده پروفایل

استادیار

• Type Systems
• Parallel Computing
• Resource Analysis
• +۳ مورد دیگر

Stefan K. Muller is an Assistant Professor in the Computer Science Department at Illinois Institute of Technology. His research focuses on applying programming language techniques to improve correctness and efficiency in parallel computing, with applications spanning AI, computer science education, and systems design. He earned his PhD at Carnegie Mellon University (2018) under Umut A. Acar, following a postdoc there (2018–20), and holds an AB in Computer Science from Harvard University (2012). PhD, Carnegie Mellon University (2018) Postdoc, Carnegie Mellon University (2018–20) AB, Harvard University (2012) Stefan’s work integrates type systems, static resource analysis, and concurrency to address challenges in parallelism. His recent projects include Graph Types for language-agnostic parallel computation analysis, Responsive Parallelism models for interactive systems, and Resource-aware GPU Programming tools. He has contributed to conferences like POPL, PLDI, ICFP, and SPLASH, often focusing on deadlock detection, futures-based parallelism, and efficient compiler optimizations. His publications (2012–2024) emphasize formal methods for parallel systems. Key trends include type-driven concurrency, static analysis of GPU programs, and responsive scheduling for interactive applications. He mentors students in programming language theory and parallel computing, with former advisees now at institutions like Apple, Amazon, and UPenn. Stefan’s teaching includes courses on Types and Programming Languages (CS534), Science of Programming (CS536), and Compiler Construction (CS443). Outside academia, he is a homebrewer, runner, and singer, with a Bacon number of 2 and Erdős number of 4 .

Thomas W. Repsمشاهده پروفایل

استاد

• Program Analysis
• Abstract Interpretation
• Model Checking
• +۴ مورد دیگر

Thomas W. Reps is the J. Barkley Rosser Professor & Rajiv and Ritu Batra Chair Emeritus at the University of Wisconsin-Madison , where he has been a faculty member since 1985. He is also President of GrammaTech, Inc., and a co-founder of the company. Education: Ph.D. in Computer Science from Cornell University (1982), winner of the 1983 ACM Doctoral Dissertation Award. Reps’s research spans program analysis , abstract interpretation , model checking , and computer security . His recent work focuses on quantum computing verification , probabilistic program analysis , and symbolic methods for static analysis . His publications (over 225) include foundational contributions to program slicing (1988 paper with Horwitz and Binkley, cited >1,780 times), machine-code analysis (ETAPS Best-Paper Awards in 2004 and 2008), and programming environments (co-author of The Synthesizer Generator ). Key awards include the ACM SIGPLAN Programming Languages Achievement Award (2017) , Guggenheim and Packard Fellowships , and ACM Fellow (2005) . Students: Mentored award-winning graduates like Akash Lal (SIGPLAN Outstanding Dissertation) and Venkatesh Srinivasan (Outstanding Graduate Student Research Award).

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

استادیار

• Programming Languages
• Probabilistic Programming
• Compiler Design
• +۴ مورد دیگر

Yizhou Zhang is an Assistant Professor at the Cheriton School of Computer Science, University of Waterloo. He specializes in programming language design and implementation, focusing on balancing expressive power with strong guarantees through language abstractions and compiler verification. Designing modular, type-safe language systems Probabilistic programming and inference optimization Algebraic effects and control flow management His recent publications explore lexical effect handlers, certified compiler frameworks, and nested polymorphism models. Awards include the ACM SIGPLAN Distinguished Paper Award (2023) for his work on probabilistic program compilation. Current advisees include PhD candidates Cong Ma, Zhaoyi Ge, Jianlin Li, and Ende Jin. He has served on program committees for POPL, PLDI, and OOPSLA conferences.

William J. Bowmanمشاهده پروفایل

استادیار

• Secure and Verified Compilation
• Dependently Typed Programming
• Verification
• +۴ مورد دیگر

William J. Bowman is an Assistant Professor in the Department of Computer Science at the University of British Columbia. He focuses on secure and verified compilation, dependently typed programming, and meta-programming systems. His work bridges high-level language design with low-level code generation to maintain correctness and security invariants throughout compilation. Education: PhD in Computer Science from Northeastern University Research spans type-preserving compilation, including: Typed closure conversion for dependently typed languages Allocation-aware type universes Hybrid embedding techniques Secure interoperability via multi-language semantics Recent publications examine: Heap allocation modeling through type universes Flat closure representations WebAssembly extensions with indexed types Control-effect semantics

Andrew Myersمشاهده پروفایل

استاد

• Programming Languages
• Computer Security
• Distributed Systems
• +۳ مورد دیگر

Andrew Myers is a Professor in the Department of Computer Science at Cornell University , focusing on Programming Languages , Computer Security , and Distributed Systems . He is an ACM Fellow and currently serves as Editor-in-Chief for ACM Transactions on Programming Languages and Systems (TOPLAS). His professional roles include program chair or co-chair for conferences such as ACM POPL 2018 , ACM CCS 2016 , and POST 2014 . His research bridges formal methods with practical language design , as evidenced by projects like the Condorcet Internet Voting System and the Viaduct compiler . Contributions span security protocols , concurrent programming , and hardware design languages . 2023 : Universally Composable Security for Program Partitioning 2022 : A Flexible Type System for Fearless Concurrency, PDL: A High-Level Hardware Design Language 2021 : Viaduct compiler for secure distributed programs 2020 : Handling Bidirectional Control Flow 2018 : MixT consistency language, Covert Channel-Free Hardware Scientific recognition includes Best Paper Awards at POPL 1999 , SOSP 2001 , SOSP 2007 , CIDR 2013 , PLDI 2013 , and PLDI 2015 . Professional service includes conference organization (e.g., ACM POPL 2018 Program Chair , Steering Committee roles in PriSC and PLDI). Myers maintains active open-source projects like civs (Condorcet Internet Voting System) and Viaduct , reflecting his commitment to secure, verifiable systems and language-driven solutions .

Thomas P. Jensenمشاهده پروفایل

پژوهشگر

• Program Analysis
• Software Security
• Abstract Interpretation
• +۷ مورد دیگر

Thomas P. Jensen is a Researcher at INRIA Rennes , France, specializing in program analysis , software security , and abstract interpretation . With a Cand. scient. in Computing and Mathematics from the University of Copenhagen (1990) and a PhD from Imperial College, University of London (1992), he has led research teams at INRIA, including the Celtique project-team (2010-2022) and currently the Epicure project-team (since 2022). He holds a Habilitation à diriger des recherches from Université Rennes 1 (1999). Research Focus Program analysis with type-based and big-step semantics approaches Certification of static analysis tools for embedded systems Software fault isolation and language-based security Information flow control through hybrid static-dynamic analysis His work spans Java security (including Java Card and mobile telephony) and formal verification of compilers and sandboxes. Notable projects include JavaSec , AJACS , and the CominLabs cybersecurity network. He received a Best Paper Award at GPCE 2018. Publications & Editorial Recent publications focus on algebraic data types , automata-based verification , and control-flow analysis with applications in cybersecurity . He has contributed to the Strategic research and innovation roadmap for SPARTA (2022) as editor. His work appears in top venues like POPL , PLDI , ICFP , and ESOP . Leadership Director of Laboratoire d'Excellence CominLabs (since 2022) Co-chair of VMCAI 2026 and member of PriSC 2024 Program Committee

Hiroshi Unnoمشاهده پروفایل

استاد

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

Hiroshi Unno is a Professor at Tohoku University 's Research Institute of Electrical Communication and a Visiting Professor at the National Institute of Informatics. He has served on program committees for major conferences like POPL , PLDI , ICFP , and CAV . Dr. Unno's research focuses on Programming Languages Software Verification Artificial Intelligence Higher-Order Model Checking Refinement Type Systems Temporal Logic His recent work (2023-2025) includes advancements in algebraic effects , probabilistic program verification , and prophecy-based type systems . Key contributions appear in POPL , PLDI , and ICFP journals. Scientific awards include Distinguished Paper Award at POPL 2024 Distinguished Paper Award at POPL 2023 PPL 2014 Best Paper Award He leads development of tools like RCaml , Thrust , and EffCaml for refinement type checking. Current projects involve Kakenhi grants 20H04162 and 25H00446 . Dr. Unno actively contributes to academic communities through Program Committee roles at AAAI, CAV, and SAS Editorial work for IPSJ Transactions Organizing PPL Summer School (2022)

Jeremy G. Siekمشاهده پروفایل

استاد

• Programming Language Design
• Type Systems
• Mechanized Theorem Proving
• +۵ مورد دیگر

Jeremy G. Siek is a Professor at Indiana University Bloomington in the School of Informatics and Computing. His research spans programming language design, type systems, gradual typing, mechanized theorem proving, and optimizing compilers. Gradual typing integration in functional languages Co-inventor of the Boost Graph Library Former NSF CAREER award recipient Active in programming language foundations research Jeremy's research focuses on reconciling static and dynamic type checking through gradual typing, with current work on parametricity in polymorphic blame calculus, combining gradual typing with dependent types, and formal criteria for gradual type systems. He investigates high-performance implementations of gradual typing and its application to security enforcement. His recent publications examine verified nanopass compilers, gradual security guarantees, and parameterized cast calculi. He has received multiple distinguished visiting fellowships and maintains the Deduce proof assistant for educational use. NSF CAREER Award (2009) Distinguished Visiting Fellowships (2010, 2015) Jeremy leads the Center for Programming Systems at IU and advises Ph.D. students Tianyu Chen (gradual security) and Darshal Shetty (gradual dependent types). He teaches courses in compilers, data structures, and programming language foundations.

Limin Jiaمشاهده پروفایل

استاد پژوهشی

• Security
• Programming Languages
• Formal Methods

Limin Jia is a Research Professor in the Department of Electrical and Computer Engineering at Carnegie Mellon University, with a courtesy appointment in the Computer Science Department. She is affiliated with CyLab, CMU's security and privacy research institute. She received her PhD in Computer Science from Princeton University and a BE from the University of Science and Technology in China. Her research applies formal techniques to enhance software security, focusing on programming languages and distributed systems. Key interests include: Language-based security mechanisms Formal verification of distributed systems Secure compilation techniques Intermittent computing foundations Her publications demonstrate strong emphasis on security guarantees in programming languages (Rust/WebAssembly), formal methods for intermittent systems, and software supply chain security. Recent works frequently address type systems, compiler verification, and energy-constrained computing. Dr. Jia maintains an extensive advising portfolio with current and former students spanning PhD and Master's programs. She teaches foundational security courses including Browser Security and Introduction to Information Security .

Philippa Gardnerمشاهده پروفایل

استاد

• Program Verification
• Concurrent Programming
• Web Programming
• +۴ مورد دیگر

Philippa Gardner is a Professor in the Department of Computing at Imperial College London, where she has been on faculty since 2001 and became a professor in 2009. She holds a UKRI Established Fellowship (2018–2023) and directs the EPSRC-funded Research Institute on Verified Trustworthy Software Systems (VeTSS) from 2017 to 2022. Previously, she held an EPSRC Advanced Fellowship at the University of Cambridge (hosted by Robin Milner) and a Microsoft Research Cambridge/Royal Academy of Engineering Senior Fellowship (2005–2010). She completed her PhD in 1992 at the University of Edinburgh under Professor Gordon Plotkin, followed by five years of postdoctoral fellowships at Edinburgh. Her research focuses on program verification , with specialized interests in web programming (JavaScript/DOM), concurrent systems, and formal methods. She developed the Gillian platform for multi-language symbolic execution and has made significant contributions to separation logic, WebAssembly verification, and compositional reasoning techniques. Her recent publications demonstrate a strong emphasis on unified formal methods, scalable verification techniques, and practical tools for real-world languages like JavaScript and WebAssembly. Key themes include symbolic execution, correctness/incorrectness reasoning, and mechanized semantics. Awards and Fellowships: UKRI Established Fellowship (2018–2023) Microsoft Research Cambridge/Royal Academy of Engineering Senior Fellowship (2005–2010) Leadership and Service: Directs the VeTSS research institute focusing on trustworthy systems. Chaired the BCS awards committee (2013–2018), overseeing the Lovelace Medal and Roger Needham Award.

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

مدرس ارشد

• concurrency semantics
• FPGAs
• GPUs
• +۵ مورد دیگر

John Wickerson is a Senior Lecturer in the Department of Electrical and Electronic Engineering at Imperial College London. His research spans formal methods, concurrency, and hardware/software synthesis. Academic Rank: Senior Lecturer Affiliation: Imperial College London His research interests include concurrency semantics, weak memory models, transactional memory, GPU and FPGA programming, and high-level synthesis for hardware accelerators. These areas intersect formal verification, programming language design, and hardware-software interface optimization. The publications of John Wickerson reflect trends in formalizing memory models, improving hardware synthesis reliability, and testing concurrency frameworks. His work addresses challenges in quantum compiler validation, GPU workgroup progress, and weak memory persistency across Intel, ARM, and C++ architectures. He actively contributes to academic communities as a Publicity Co-Chair and Session Chair in conferences like POPL and as a Committee Member in SPLASH and PLDI. His GitHub repository activity and X (Twitter) presence further demonstrate his engagement in technical dissemination.

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. His research spans programming languages, computer security, formal verification, and type theory, with significant contributions to LLVM verification, program synthesis, and quantum programming. He co-leads Penn's Programming Languages Research Group with Benjamin Pierce and Stephanie Weirich. His research focuses on: Programming language foundations (type theory, linear logic, semantics) Formal verification (Coq, LLVM, interaction trees) Security (information-flow control, memory safety) Emerging paradigms (quantum programming, secure distributed systems) Publication trends reveal deep engagement with formal methods (67%), programming language design (20%), and systems security (13%), primarily using Coq for mechanized verification. Recent works demonstrate increased focus on parallel/streaming computation and synthesis techniques. Awards Distinguished Paper Awards (ECOOP 2023, POPL 2020) Schlein Family President's Distinguished Professor (2021) Lindback Distinguished Teaching Award (2018) IEEE MICRO Top Picks (2013) Sloan Fellowship (2009-2010) NSF CAREER Award (2004) Best Paper Awards (SOSP 2001, ICFP 1999) Research Leadership Directs multiple NSF-funded projects including DeepSpec (verified systems infrastructure), Vellvm (LLVM semantics), and ExCAPE (program synthesis). Advises 5 PhD students and 31 former advisees/postdocs. Served as General Chair for POPL 2025 and associate chair for PLDI/ICFP/POPL. Infrastructure Leads the Vellvm project developing Coq-based LLVM semantics, the Interaction Trees framework for recursive/impure programs, and Qwire for quantum circuit verification. Maintains active collaborations with Galois Inc. and INRIA.