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

James Brotherston is Professor of Logic and Computation in the Programming Principles, Logic and Verification Group (PPLV) at University College London's Department of Computer Science. His research spans logic, computation, and verification, with a focus on separation logic, cyclic proofs, and automated reasoning for program correctness. Research interests include: Foundations of program verification using separation logic Automated reasoning via cyclic proof systems Concurrency and deadlock detection Formal methods for security and resource management Applications of substructural logics in computer science His publications demonstrate consistent focus on logical foundations of verification, with recent work expanding into concurrency testing and atomic operations compatibility. Trends include theoretical advances in proof systems alongside practical verification tools. Scientific awards and grants: Facebook Testing and Verification Research Award (2019) £6M EPSRC Programme Grant for IRIS project (2018-2024) Facebook Faculty Grant (2015) Multiple EPSRC fellowships and grants totaling over £1.2M (2008-2017) He has supervised 12+ PhD students and research fellows, with current students working on verification of concurrent systems. Leads research in the PPLV group and collaborates internationally on logical frameworks.

• Logic
• Computation
• Separation Logic
• +۵ مورد دیگر

Bengt Jonsson is a Professor at the Division of Computer Systems, Department of Information Technology, Uppsala University. His research focuses on formal methods, real-time and distributed systems, semantics and verification of concurrent systems, and IoT security. Current Projects: UPMARC (Software Technology for Multicore Programming), aSSIsT (Secure Software for IoT), and Designed for UPDATE (Safe Embedded Software Updates) Past Projects: CoDeR-MP (Multicore Real-Time Applications), ProFun (Wireless Sensor Networks), CONNECT (Networked Component Synthesis) His work includes automated verification, model checking, and symbolic execution for concurrent systems. Recent publications address dynamic partial order reduction, IoT protocol testing, and lock-free data structures. Scientific Awards : CAV Award 2017 He advises PhD students and teaches courses like Model-Based Development of Embedded Systems and graduate-level symbolic execution. Personal interests include piano playing and orienteering.

• Formal Methods
• Real-Time Systems
• Distributed Systems
• +۶ مورد دیگر

Zachary Kincaid is an Associate Professor in the Department of Computer Science at Princeton University. His research focuses on program analysis , logic , and programming languages , with emphasis on making analysis compositional and robust . PhD, University of Toronto (2016) BSc, Western University Research Interests Dr. Kincaid develops algebraic program analysis frameworks combining symbolic methods with abstract interpretation. His work addresses challenges in: Compositional analysis of concurrent and recursive programs Termination analysis for loops with complex control flow Non-linear numerical invariant generation Strategy synthesis for logical games Parameterized program verification Publication Trends His research output spans program analysis (2024-2010), formal verification (2018-2010), concurrency (2016-2010), and automated synthesis (2013-2012). Recent work (2024) explores polynomial ideals and nonlinear ranking functions , while foundational contributions include vector addition systems and recurrence-based invariants . Scientific Engagement Dr. Kincaid contributes to the academic community through: Program Committee service (PLDI, POPL, CAV, IJCAI, LICS, FMCAD, ESOP, etc.) Co-developing the Duet analyzer for unbounded concurrency Collaborative work with leading researchers (Tom Reps, Azadeh Farzan, Jason Breck) Advising & Grants He advises PhD students and leads research funded by the ONR grant N00014-19-1-2318 . Current advisees include Jake Silverman and Shaowei Zhu, while former student Charlie Murphy (PhD 2023) now holds a postdoctoral position at University of Wisconsin-Madison. Labs & Teams Dr. Kincaid co-developed the Duet program analyzer and contributes to tools like Srk and SimSat . His work integrates SMT solvers (MathSAT, Z3) and mathematical frameworks (rational vector addition systems, recurrence relations) for robust program analysis.

• Program Analysis
• Logic
• Programming Languages
• +۷ مورد دیگر

Xavier Allamigeon is a researcher at INRIA and CMAP (Centre de Mathématiques Appliquées) at École Polytechnique, where he also serves as a part-time associate professor in the Applied Mathematics Department. His research focuses on optimization, combinatorics, tropical geometry, game theory, and formalization of mathematics in proof assistants, with a particular emphasis on computational aspects of these fields. He earned his Ph.D. in 2009 from École Polytechnique with a thesis on static analysis of memory manipulations and tropical polyhedra. His work bridges theoretical mathematics and practical applications, including contributions to emergency call center modeling and epidemic monitoring during the COVID-19 pandemic. Key awards include the 2022 Prix Inria–Académie des sciences, the 2021 SIAM SIGEST award, and the 2010 Gilles Kahn Prize for Best Dissertation in Computer Science. His research has led to the development of tools like the Tropical Polyhedra Library (TPLib) and formal proofs in proof assistants such as Coq. He has supervised multiple Ph.D. students and contributed to funded projects such as URGE (2023–2026) and CAPPS (2018–2021). His interdisciplinary work spans optimization, formal methods, and applied mathematics, with applications in healthcare systems and computational geometry.

• Optimization
• Combinatorics
• Tropical Geometry
• +۳ مورد دیگر

Kevin Batz is a researcher in computer science at RWTH Aachen University, currently affiliated with University College London. He completed his PhD in December 2024 under Professor Joost-Pieter Katoen, focusing on probabilistic program semantics and verification. His work includes co-developing Weighted Programming, a paradigm for mathematical modeling, and advancing deductive verification techniques for probabilistic systems. Education: PhD in Computer Science (RWTH Aachen University, 2024, summa cum laude). Supervised by Prof. J.-P. Katoen. Research Interests: Probabilistic programming semantics, automated verification, formal methods for heap-manipulating systems, and quantitative separation logic. He has pioneered tools like the deductive verification infrastructure for probabilistic programs and contributed to foundational work on expectation analysis. Awards: ETAPS Doctoral Dissertation Award 2025 Best Paper Award at LOPSTR 2020 Springorum Medal 2019 Teaching & Supervision: Taught courses on probabilistic programming, static analysis, and compiler construction. Supervised multiple thesis projects, including award-winning works on quantitative separation logic and invariant-based strategy synthesis. Labs/Teams: Member of the Software Modeling and Verification Group at RWTH Aachen, contributing to the LuFG i2 research unit.

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

Hila Peleg is an Assistant Professor in the Department of Computer Science at the Technion – Israel Institute of Technology, where she co-leads the TecSE lab with Prof. Shachar Itzhaky. Her research lies at the intersection of Programming Languages, Software Engineering, and Human-Computer Interaction, focusing on program synthesis and interactive developer tools. Her research interests center on creating intelligent, theory-driven tools that enhance programmer productivity and correctness. She explores interaction models that integrate formal methods like separation logic into practical synthesis systems, enabling more versatile and reliable code generation. Her work spans both foundational models and real-world applications, from web layout synthesis to computational crafting. The trend in her recent publications shows a strong focus on interactive and practical program synthesis, blending formal verification with user-centered design. She investigates how synthesis can be made more usable through live programming, best-effort results, co-design of tools and languages, and integration with developer workflows. Her work increasingly emphasizes the human aspect of programming tools. Distinguished Paper Award, PLDI 2021 Distinguished Artifact Award, SPLASH 2020 Hila Peleg advises multiple graduate students, including PhD and MSc candidates, and leads the ERC-funded EXPLOSYN project, which supports advanced research in program synthesis. She has taught advanced courses such as User-Centered Programming Tools and seminars in programming languages, and is actively involved in the academic community through conference service and organization. She is a core member of the TecSE lab, which focuses on advancing software engineering through programming language theory and interactive systems. The lab fosters interdisciplinary research at the boundary of formal methods and human-centered tool design.

• Programming Languages
• Software Engineering
• Human-Computer Interaction
• +۷ مورد دیگر

Engin Kirda is a researcher at the Department of Distributed Systems , Vienna University of Technology . His work focuses on Network Security , Malware Detection , and Web Security , with a particular emphasis on Malware Analysis , XSS Prevention , and Botnet Detection . He has led and contributed to projects such as WOMBAT , SECoverer , and SysSec , funded by entities like the Austrian Research Promotion Agency (FFG) and the European Commission . Research Areas : Network Security, Malware Analysis, Web Application Vulnerabilities Key Projects : WOMBAT (2008–2011), SECoverer (2008–2011), SysSec (2010–2014) His publications highlight advancements in automated malware analysis , phishing detection , and web spam mitigation . He has mentored students in topics including Android security , CSV Attack Prevention , and Malware Threat Landscapes .

• Computer Science
• Network Security
• Malware Detection
• +۴ مورد دیگر

Peter O'Hearn is a Professor of Computer Science at University College London and Research Scientist at Meta AI (FAIR), renowned for co-developing separation logic which bridges theoretical computer science and industrial-scale program analysis. His dual affiliation exemplifies the synergy between academic research and practical tool development that characterizes his career. His research interests focus on program verification , separation logic , static analysis , and his recent groundbreaking work on incorrectness logic as a complementary approach to traditional verification. O'Hearn pioneered the concept of local reasoning which enables modular verification of large codebases by focusing only on relevant memory regions, forming the theoretical foundation for Facebook Infer. His publications reveal a consistent trajectory from foundational theory to industrial application, with recent work emphasizing Scalable verification for million-line codebases Compositional reasoning for concurrent systems Practical deployment of formal methods in developer workflows Bug-oriented reasoning through incorrectness logic His research consistently addresses the tension between theoretical soundness and practical applicability in program analysis. Notable scientific awards include: 2021 IEEE Cybersecurity Award for Practice 2016 Gödel Prize for separation logic 2016 CAV Award for outstanding contributions POPL 2019 Most Influential Paper Award Fellow of the Royal Society (FRS) Fellow of the Royal Academy of Engineering (FREng) O'Hearn has made substantial contributions to industrial practice through Facebook Infer, which analyzes millions of lines of code daily across Meta's codebase. His work on continuous reasoning integrates formal verification into developer workflows, while his recent focus on incorrectness logic addresses the critical need for effective bug detection in large systems. He maintains active leadership in the programming languages community through conference organization and keynotes.

• Separation Logic
• Program Verification
• Static Analysis
• +۵ مورد دیگر

Gopalan Nadathur is a Professor in the Department of Computer Science and Engineering at the University of Minnesota , where he works in the Teyjus Project developing an efficient implementation of λProlog. His research focuses on higher-order logic programming , lambda calculus representations , and explicit substitution mechanisms with applications in formal verification and meta-programming . Key projects: Abella theorem prover, Bedwyr model checker Editorial roles: Theory and Practice of Logic Programming , Journal of Functional and Logic Programming Conference involvement: IEEE Symposium on Logic in Computer Science (2009), International Workshop on Logical Frameworks (2009) He has developed specialized techniques for: Higher-order pattern unification Modular logic programming Intensional lambda term reduction Binding structure representation

• Programming Languages
• Logic Programming
• Higher-Order Logic
• +۵ مورد دیگر

Christoph Matheja is a Professor at the University of Oldenburg, Germany, leading the Theory of Correct Systems group , and an Associate Professor at the Technical University of Denmark (DTU) in the Software Systems Engineering section. His work focuses on formal methods and verification, particularly for probabilistic and heap-manipulating systems. He develops rigorous mathematical techniques to enhance software correctness and trustworthiness, with contributions to quantitative verification, probabilistic program analysis, separation logic, Rust verification, and static analyses using graph grammars. Before his current roles, he was a postdoctoral researcher at ETH Zürich (Programming Methodology Group) and earned his Ph.D. at RWTH Aachen University under Joost-Pieter Katoen. His research bridges theoretical foundations and practical tool development, as seen in works like LogPPL for probabilistic process mining and the Prusti project for Rust verification. Recent publications emphasize probabilistic systems, POMDPs, and formal verification frameworks. He actively contributes to academic communities, serving on PCs for ESOP 2026, LICS 2026, and CAV 2025. His current focus includes recruiting a PhD student (see UOL openings ) and advancing verification methodologies for probabilistic and concurrent systems.

• Formal Methods
• Software Verification
• Probabilistic Programming
• +۶ مورد دیگر

Cezara Drăgoi serves as a Researcher (Chargé de Recherche) at INRIA with dual affiliation at École Normale Supérieure's Department of Computer Science and CNRS. She maintains active roles in major programming language conferences including PLDI, POPL, and SPLASH where she contributes to program committees and steering groups, demonstrating her standing in the formal methods community. Her research program focuses on automated formal verification through abstraction techniques, specifically targeting data structures across the spectrum from sequential implementations to distributed systems. Drăgoi develops logic-based frameworks that enable Hoare-style reasoning about content and consistency properties, with particular expertise in identifying suitable fragments of first-order and separation logic for static analysis. Her work bridges theoretical foundations with practical verification challenges in both single-threaded and concurrent environments. Publication trends reveal a clear evolution from foundational work on shape analysis for sequential data structures toward increasingly complex distributed systems verification. This progression culminated in her development of PSync - a domain-specific language for fault-tolerant distributed algorithms with integrated verification capabilities - demonstrating her ability to create practical abstractions that make verification tractable for real-world systems. Steering Committee Member, Static Analysis Symposium (SAS 2025) Program Committee Co-Chair, VMCAI 2023 Multiple program committee roles at PLDI (2017, 2020), POPL (2016-2023), ECOOP (2019), and SPLASH (2020-2024) Session chair for SAS 2021 and VMCAI 2019 Drăgoi actively mentors emerging researchers through internship and PhD opportunities in specialized areas including Byzantine consensus verification (SABC project) and refinement techniques for fault-tolerant asynchronous code (RFTA project). She has developed two influential verification tools: CELIA (a Frama-C plugin for C program verification handling both data and structural properties) and PSync (a language with verification engine for distributed algorithms). Her teaching includes graduate-level courses on abstract interpretation at Université Paris Diderot. She leads verification research within the INRIA/ENS collaboration, focusing on making static analysis tractable for complex distributed systems through innovative synchronous programming abstractions. Current work targets verification challenges in consensus algorithms and communication-closed protocols, with emphasis on bridging theoretical soundness with practical applicability.

• Static Analysis
• Formal Verification
• Distributed Systems
• +۳ مورد دیگر

Hila Peleg is an Assistant Professor at the Technion - Israel Institute of Technology , working at the intersection of Programming Languages , Software Engineering , and Human-Computer Interaction . She co-leads the TecSE lab with Prof. Shachar Itzhaky, focusing on programmer tooling inspired by programming language theory.

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

Stefan Rieger is an academic affiliated with the Department of Computer Science II at RWTH Aachen University. His primary research focuses on formal verification of pointer programs, graph grammars for heap abstraction, and concurrent programming analysis. He holds a PhD from RWTH Aachen University (2009) and a Diplom (Master's equivalent) in Computer Science from the same institution (2005). His work emphasizes automated analysis techniques for complex data structures and dynamic memory management in software systems, with notable contributions to model checking and program verification methodologies. Key areas include thread safety in pointer-manipulating programs and optimization of linear code through transformation composition. Rieger's publications span venues such as the International Conference on Graph Transformations (ICGT) and the International Symposium on Formal Methods (FM). His research has addressed challenges in verifying unbounded heap structures and developing formal methods for multi-threaded systems. Contact: rieger@informatik.rwth-aachen.de | Office: Room 4206, Ahornstr. 55, Aachen

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

Christoph Matheja is a Professor at the University of Oldenburg , where he leads the Theory of Correct Systems group. Additionally, he holds an Associate Professor position in the Software Systems Engineering section at the Technical University of Denmark . His research focuses on formal methods and verification, particularly for probabilistic and heap-manipulating systems. His work spans quantitative verification , probabilistic programs , separation logic , and static analysis using graph grammars . Recent research includes the development of the LogPPL tool for probabilistic process mining and a game-based semantics for the HeyVL verification language. Matheja has also contributed to PC committees for conferences like ESOP 2026, LICS 2026, and CAV 2025. He previously held a postdoctoral position at ETH Zürich under Peter Müller and completed his PhD at RWTH Aachen under Joost-Pieter Katoen.

• Formal Methods
• Verification
• Probabilistic Systems
• +۷ مورد دیگر

Professor Mooly Sagiv is a Chair of Software Systems at the School of Computer Science, Tel Aviv University , focusing on static program analysis and formal verification. His work bridges automated theorem proving with abstract interpretation to develop practical techniques for verifying software systems. Key Research Areas : Static analysis, formal verification, abstract interpretation, and automated reasoning about distributed systems and smart contracts. Notable Contributions : Development of the IVY tool for distributed protocol verification and frameworks for dynamic information flow control in cloud applications. Scientific Recognition : Fellow of the ACM Best Paper Award at PLDI'12 Recent Publications focus on binarized neural networks, stateful network verification, and liveness properties in infinite-state systems using decidable logic fragments.

• Static Program Analysis
• Automated Theorem Proving
• Abstract Interpretation
• +۶ مورد دیگر