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

Andreas Lööwمشاهده پروفایل

مدرس

• Hardware Verification
• Software Verification
• Symbolic Execution
• +۵ مورد دیگر

Andreas Lööw is a Lecturer at Royal Holloway, University of London , focusing on hardware and software verification. Previously, he was a postdoctoral researcher at Imperial College London under Philippa Gardner , contributing to the Gillian Platform . He completed his PhD at Chalmers University of Technology under Magnus Myreen , specializing in interactive theorem proving and hardware verification. His research explores symbolic execution, separation logic, and formal verification of hardware/software systems. Key projects include Betterlog (Verilog semantics reformulation) and foundational work on the Gillian Platform . 2025 : Compositional Symbolic Execution for Memory Models 2025 : Simulation Semantics of Synthesisable Verilog 2024 : Compositional Symbolic Execution for Correctness/Incorrectness 2023 : Exact Separation Logic (Distinguished Paper at ECOOP'24) 2023 : Hardware Verification of Pipelined Processors 2022 : Verilog Concurrency Analysis 2021 : Verified Verilog Compiler (Lutsig) Scientific Awards : Distinguished Paper at ECOOP 2024 He maintains the vv Verilog visualization tool and collaborates on the Gillian Platform . Contact: andreas.loow@rhul.ac.uk

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

استاد

• Theoretical Chemistry
• Computational Biophysics
• Protein Dynamics
• +۳ مورد دیگر

John Straub is a Professor of Chemistry at Boston University, affiliated with the Chemistry Department. His research focuses on theoretical and computational studies of protein dynamics, thermodynamics, and phase transitions in molecular systems. He leads efforts to develop advanced algorithms for simulating phase changes in complex systems, including work supported by a National Science Foundation (NSF) grant (CH-1114676) to improve computational methods for phase transition modeling. His group has pioneered generalized simulated tempering and replica exchange algorithms, enabling more accurate simulations of phenomena like vapor-liquid phase changes and peptide aggregation. Dr. Straub also engages in science outreach through collaborations with the Pinhead Institute, supporting K-12 education programs and student internships. His research spans diverse topics such as cholesterol interactions in lipid membranes, amyloid fibril formation mechanisms, and the structural basis of protein aggregation in neurodegenerative diseases. His computational methods have been applied to study membrane proteins, lipid rafts, and the role of environmental factors in protein behavior. Key contributions include modeling amyloid-β aggregation pathways and investigating the impact of membrane composition on protein stability.

Yongshan Dingمشاهده پروفایل

استادیار

• Quantum Computing
• Computer Architecture
• Quantum Algorithms
• +۴ مورد دیگر

Yongshan Ding is an Assistant Professor of Computer Science and Applied Physics at Yale University. He leads the Quantum Systems Lab (QSL) and directs Yale's Quantum Science and Engineering Certificate program. Affiliated with the Yale Quantum Institute (YQI) and Computer Systems Lab (CSL), his research focuses on quantum computing systems spanning algorithms, architecture, and hardware/software co-design. Dr. Ding earned his Ph.D. from the University of Chicago and a B.Sc. from Carnegie Mellon University. He has received prestigious awards including the Siebel Scholarship (2020) and William Rainey Harper Dissertation Fellowship (2020). Research Interests: Quantum computing architectures, noise-resilient quantum algorithms, error correction methods, quantum compilation, hardware-software co-design, and NISQ system optimization. Editorial Roles: Editor at Quantum journal and Associate Editor at ACM Transactions on Quantum Computing . Labs: Founder of Yale's Quantum Systems Lab (QSL) and contributor to the Computer Systems Lab (CSL). Awards: Siebel Scholarship (2020) William Rainey Harper Dissertation Fellowship (2020) QCE Best Paper Award (2024) IEEE Micro Top Picks Honorable Mention (2023, 2020) IBM Q Best Paper Award, First Prize (2020) Mathematics Competition Runner Up (2016)

Mark Battyمشاهده پروفایل

استاد

• Concurrent Systems
• Formal Verification
• Programming Languages
• +۳ مورد دیگر

Mark Batty is a Professor in the School of Computing at the University of Kent, specializing in formal methods for concurrent systems. His work bridges hardware-software interfaces, focusing on memory models for C/C++, OpenCL, and architectures including x86, ARM, POWER, and GPUs. As a member of the Programming Languages and Systems Research Group, he develops mathematical specifications and verification tools for real-world concurrency challenges. His research centers on empirical testing of hardware/compiler behavior, formal modeling of system components, and verification of fine-grained concurrent algorithms. Key contributions address relaxed memory semantics, transactional memory, and compositional reasoning for concurrent data structures. His work combines theoretical rigor with practical tool development to ensure correctness in complex concurrent environments. Analysis of his 2015-2025 publications reveals consistent focus on memory consistency models, formal verification of weak memory concurrency, and compiler optimizations. Dominant themes include C/C++11 standards, GPU concurrency semantics, and mechanized verification techniques. His research demonstrates strong industry relevance through collaborations with hardware vendors and contributions to language standards. Mark Batty has received significant recognition: John C. Reynolds Doctoral Dissertation Award (2015) from ACM SIGPLAN CPHC and BCS Distinguished Dissertation Award (2015) Lloyds Register Foundation and Royal Academy of Engineering Research Fellowship (2016) He actively leads major research initiatives and mentors next-generation researchers: Current Funding: EPSRC Standard Grant 'Verifiably Correct transactional memory' (2018), VeTTS Grant 'Specification and verification of C++ data structure libraries' (2018), EPSRC First Grant 'Compositional, dependency-aware C++ concurrency' (2018) PhD Recruitment: Actively seeking candidates for UKRI-funded studentship in Verified Trustworthy Software Systems Batty drives community engagement through Kent Concurrency Workshop (2016) and South of England Programming Language Seminars, fostering national collaboration in programming languages research. His leadership in organizing Royal Society discussions underscores his influence in trustworthy systems verification.

Chris Peikertمشاهده پروفایل

استاد

• Cryptography
• Lattice-based Cryptography
• Coding Theory
• +۲ مورد دیگر

Chris Peikert is a Professor in the Department of Computer Science and Engineering at the University of Michigan's College of Engineering. He received his Ph.D. from MIT's Computer Science and Artificial Intelligence Laboratory in 2006 under the supervision of Silvio Micali. Peikert is a leading researcher in cryptography, particularly known for his foundational work in lattice-based cryptography. His research interests span cryptography, lattices, coding theory, algorithms, and computational complexity, with a particular focus on cryptographic schemes whose security can be based on the apparent intractability of lattice problems. Peikert has made significant contributions to the development and analysis of lattice-based cryptographic primitives, including ring-LWE, fully homomorphic encryption, and zero-knowledge proofs. Peikert's recent work demonstrates continued leadership in post-quantum cryptography, with publications in top venues like CRYPTO, EUROCRYPT, and STOC. His research spans theoretical foundations of lattice problems to practical implementations of lattice-based cryptographic systems, including hardware acceleration for fully homomorphic encryption. IACR Fellow (2024) Test-of-Time Award from Crypto 2008 (2023) TCC Test-of-Time Award (2017) Patrick C. Fischer Development Professor of Theoretical Computer Science (2017) Best Paper Award at Eurocrypt 2010 Best Paper Award at STOC 2009 Alfred P. Sloan Foundation Fellowship Google Research Award Peikert has been actively involved in the cryptographic research community, serving on program committees for major conferences including CRYPTO, EUROCRYPT, FOCS, and TCC (where he was program co-chair in 2021). He has also developed educational resources, including extensive lecture materials on lattice-based cryptography and teaching courses on cryptography and theoretical computer science at both the undergraduate and graduate levels.

Yingfei Xiongمشاهده پروفایل

دانشیار

• Software Engineering
• Programming Languages

Yingfei Xiong is an active Associate Professor at Peking University, China, specializing in software engineering and programming languages. With a consistent research trajectory from 2013 through 2026, Xiong has established themselves as a prominent figure in the software engineering research community, regularly contributing to top-tier conferences including SPLASH, ICSE, ASE, and PLDI. Dr. Xiong's research primarily focuses on program synthesis, automated program repair, and software analysis techniques. Their work bridges theoretical programming language concepts with practical software engineering applications, particularly in developing novel approaches for code generation, bug fixing, and program optimization. The research demonstrates strong interdisciplinary connections between traditional software engineering, programming languages theory, and emerging AI techniques. Analysis of Xiong's publication trends reveals a clear evolution in research focus, beginning with foundational work in API transformations and program adaptation around 2013-2016, shifting toward program repair techniques from 2017-2020, and most recently incorporating machine learning and neural approaches into program synthesis and repair (2021-2026). The work consistently addresses practical challenges in software development while maintaining theoretical rigor, with increasing integration of AI techniques in recent years. Dr. Xiong has served in various leadership roles across the software engineering conference ecosystem, including program committee membership and session chair positions at major conferences. Their extensive service demonstrates recognition by peers as a subject matter expert in software engineering and programming languages research. While specific grant information isn't detailed in the provided text, the sustained publication record suggests successful research funding.

Christian Plesslمشاهده پروفایل

استاد

• High-Performance Computing
• Reconfigurable Computing
• FPGA Acceleration
• +۳ مورد دیگر

Prof. Dr. Christian Plessl is a W3 Professor of High-Performance Computing at the Institute of Computer Science, University of Paderborn. He leads the Paderborn Center for Parallel Computing (PC²), a national HPC center within the NHR alliance. His roles include Director of PC², Board Member of the NHR association, and member of the Sonderforschungsbereich 901. Education: PhD (Dr. sc. ETH) in Computer Engineering, ETH Zürich (2006) MSc in Electrical Engineering, ETH Zürich (2001) Postdoc at ETH Zürich (2007–2011) Research Interests: Architecture and tools for high-performance parallel and reconfigurable computing, FPGA acceleration, quantum chemistry, scientific computing, adaptive systems, and energy-efficient HPC solutions. Key projects include EKI-App (FPGA-based neural networks), FPGA4XPCS (X-ray spectroscopy), and HighPerMeshes (unstructured grid frameworks). Publications: Over 100 peer-reviewed works, focusing on FPGA acceleration, HPC frameworks, and quantum computing. Recent trends emphasize energy-efficient neural networks, FPGA-based quantum computing, and scalable HPC algorithms. Awards: Best Paper Awards at HEART 2023, ReConFig 2012/2014 Paderborn University Research Awards (2018, 2009) SEW-EURODRIVE Student Award (2001) Grants & Projects: Principal investigator in DFG, BMBF, and EU-funded projects. Collaborates with AMD/Xilinx, Intel/Altera, and Fujitsu. Leads initiatives like PerficienCC (custom computing) and HighPerMeshes. Labs/Teams: Directs the High-Performance Computing group at PC², focusing on FPGA supercomputing and HPC infrastructure. Active in the NHR alliance for national HPC coordination.

Shuvendu K. Lahiriمشاهده پروفایل

پژوهشگر

• Formal Verification
• Smart Contracts
• Program Synthesis
• +۵ مورد دیگر

Shuvendu K. Lahiri is a researcher at Microsoft Research, focusing on formal verification, program synthesis, and software testing. His work bridges artificial intelligence with formal methods, particularly in blockchain security and automated code generation. 2025 : Published LLM-Vectorizer (verified loop vectorizer) and neural synthesis for SMT-assisted proof-oriented programming 2024 : Explored LLM-based test-driven code generation and natural precondition inference 2023 : Developed resource management specifications and contributed to test generation with pre-trained models 2022 : Advanced Solidity type systems and merge conflict resolution using language models His research combines large language models with formal verification tools to improve software correctness. He actively contributes to conferences like ICSE, PLDI, and ISSTA as author and committee member.

Pierre Marquisمشاهده پروفایل

استاد

• Artificial Intelligence
• Knowledge Representation
• Automated Reasoning
• +۶ مورد دیگر

Pierre Marquis is a distinguished Professor of Computer Science at Université d'Artois , affiliated with the Centre de Recherche en Informatique de Lens (CRIL-CNRS, UMR 8188) . Since December 2024, he has served as the vice-president for research and doctoral studies at Université d'Artois. His research focuses on Artificial Intelligence , particularly knowledge representation , automated reasoning , inconsistency handling , and knowledge compilation , with recent emphasis on Explainable AI (XAI) . Research Interests: Marquis's work spans foundational AI topics including abduction , induction , belief revision , and preference modeling . He has pioneered knowledge compilation techniques to optimize AI tasks and developed frameworks for reasoning under inconsistency through paraconsistent logics and argumentation. His EXPEKTATION chair (2020-2026) under France's national AI program drives his current focus on interpretable machine learning models. Scientific Awards: 2025: CNRS Silver Medal 2022: AAIA Fellow 2017: Senior Member of Institut Universitaire de France (IUF) 2009: EurAI (ECCAI) Fellow Doctoral Students: Mentoring Clément Lens (critical patient monitoring systems) and Mehdi Sabiri (data-knowledge integration for AI explanations). Collaborating with students like Louenas Bounia (formal XAI models) and Romain Wallon (pseudo-Boolean constraints). Grants & Projects: Leads the EXPEKTATION research chair (2020-2026) and participates in ANR PING/ACK (2019-2023), ANR THEMIS (2021-2025), CNRS IRP MAKC (2020-2024), and H2020 TAILOR (2020-2024). Previously led PIA4 MAIA (2023-2032) and Pint (2022-2023). Labs & Teams: Active in CRIL-CNRS, contributing to PyXAI (Python XAI library) and d4 (model counting), while mentoring teams on consensus belief merging and dynamic constraint processing .

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.

Ori Lahavمشاهده پروفایل

دانشیار

• Programming Languages
• Verification
• Concurrency
• +۴ مورد دیگر

Ori Lahav is a faculty member in the School of Computer Science at Tel Aviv University. His research is generously supported by an ERC Starting Grant and an ISF Grant. He actively supervises PhD and MSc students, and seeks highly motivated candidates for postdoc, PhD, and MSc positions in programming language theory, concurrency, and formal methods. Dr. Lahav completed his PhD at Tel Aviv University under the supervision of Arnon Avron. In 2014, he was a postdoctoral researcher at Tel Aviv University hosted by Mooly Sagiv. From 2014 to September 2017, he was a postdoctoral researcher at MPI-SWS in Germany hosted by Viktor Vafeiadis and Derek Dreyer. His primary research areas focus on programming languages and verification, with specialization in concurrency and relaxed memory models. He also has significant interests in proof-theory, semantics of non-classical logics, and automated reasoning. His work bridges theoretical foundations with practical applications in programming language design and implementation. Dr. Lahav's publication record shows a consistent trajectory of high-impact research in top-tier conferences including PLDI, POPL, OOPSLA, and ESOP. His recent work (2023-2025) demonstrates continued leadership in memory models, concurrency semantics, and verification techniques. His research spans both theoretical contributions in denotational semantics and practical tools for verification. Best Paper Award DISC 2024 Best Student Paper Award DISC 2024 Distinguished Artifact Award ESOP 2022 Distinguished Paper Award OOPSLA 2021 Kleene Award for Best Student Paper LICS 2013 Dr. Lahav actively advises students including Yoav Ben Shimon, Yotam Dvir, Amir Karniel, and Roy Margalit (PhD students), Yuval Katsman Ezra (MSc student), and has alumni including Ori Saporta (MSc) and Abhishek Kr Singh (postdoc, now Assistant Professor at IIIT Hyderabad). He has organized significant events including VMCAI 2024 and Dagstuhl Seminars on persistent programming. His teaching portfolio includes courses on Shared Memory Concurrency Semantics, Programming Language Foundations, and Software Foundations in Coq.

É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.

• Physics of Complex Systems
• Self-Assembly Processes
• DNA Nanotechnology
• +۱ مورد دیگر

Constantine Evans is a Research Fellow at the Hamilton Institute, Maynooth University, focusing on the physics of complex self-assembly processes. His work examines how simple particles organize into intricate structures through algorithmic self-assembly, with applications in DNA nanotechnology and computational modeling. Institution: Maynooth University Research Unit: Hamilton Institute Location: Eolas Building, 3rd Floor, Office 339 Research Interests: Evans investigates non-equilibrium self-assembly systems, particularly DNA tile crystal growth and kinetic control mechanisms. His research bridges physics, computational theory, and molecular engineering to uncover unexpected behaviors in basic physical processes. Publication Trends: His recent work (2018-2024) demonstrates interdisciplinary advancements in DNA computing, focusing on proofreading systems, tile compiler optimization, and kinetic modeling. These publications span peer-reviewed journals, conference proceedings, and algorithmic frameworks that connect theoretical computer science with experimental biophysics. Labs & Teams: He is affiliated with the Hamilton Institute, a research center specializing in systems biology, computational modeling, and interdisciplinary scientific investigations.

Ilia Polianمشاهده پروفایل

استاد

• Circuit Architecture
• System Design
• Hardware Reliability
• +۶ مورد دیگر

Prof. Ilia Polian serves as Head of the Institute of Computer Engineering and Chair of the Hardware-Oriented Computer Science (HOCOS) department at the University of Stuttgart. His leadership spans research, teaching, and institutional coordination across multiple high-impact projects. Prof. Polian's research focuses on developing circuit and system architectures based on both traditional and novel principles, including neuromorphic, stochastic, and approximate architectures. His second major research focus is systematic design methodology and design automation, with particular emphasis on safety and reliability properties of developed systems. Current research directions include quantum computing engineering, secure mixed-signal neural networks, and resource-efficient stochastic circuits for near-sensor computing applications. His recent publications demonstrate strong trends in quantum computing (particularly circuit partitioning and compilation for multi-QPU architectures), hardware security (including memristive cryptographic implementations), and AI-driven approaches to hardware testing and reliability. These works bridge fundamental computer architecture research with practical industrial applications. University of Stuttgart's Publication Prize for Paper on Partitioning of Quantum Circuits Prof. Polian actively supervises doctoral students including Devanshi Upadhyaya, and leads significant research grants such as the DFG Priority Program Nano Security which he coordinates. His department offers numerous thesis and research opportunities for students interested in cutting-edge hardware research. The Hardware-Oriented Computer Science department maintains strong collaborations with industry partners including IBM, Infineon Technologies, and Advantest, as well as academic institutions through the IQST Graduate School and QuantumBW initiatives.

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.