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

Toby Murrayمشاهده پروفایل

استاد

• Security
• Program Verification
• Formal Methods
• +۴ مورد دیگر

Professor Toby Murray is a faculty member at the University of Melbourne's School of Computing and Information Systems, where he serves as Director of the Defence Science Institute and Co-Lead of the Computer Science Research Group. He holds a D.Phil. in Computer Science from the University of Oxford (2011) and previously worked at NICTA/Data61 and UNSW. His research focuses on security verification , neural network robustness , and software security , with projects including Verisimilar (verified secure ML), EDEFuzz (API vulnerability detection), and COVERN (concurrent program security). His work bridges formal methods with practical cybersecurity challenges, particularly in adversarial environments. Publication trends show consistent contributions in formal verification (35% of recent papers), security testing (30%), concurrency models (20%), and neural network security (15%), with evolving focus toward AI safety and web API vulnerabilities. Distinguished Paper Award at ICSE 2024 He leads a research group with 7+ PhD students and postdocs, focusing on cybersecurity assurance and collaborative fuzzing techniques. His team develops tools like Legion (test case generation) and Underflow (vulnerability detection).

André Platzerمشاهده پروفایل

استاد

• Logic in Computer Science
• Cyber-Physical Systems
• Programming Languages
• +۴ مورد دیگر

André Platzer is a Professor at Karlsruhe Institute of Technology (KIT), holding the Alexander von Humboldt Professorship for Logic of Autonomous Dynamical Systems. He previously served as an Associate Professor and later as a full professor at Carnegie Mellon University (CMU), where he founded the Logical Systems Lab. His research focuses on the logical foundations of cyber-physical systems (CPS), aiming to ensure safety-critical computer control of physical processes through formal verification and programming language design. Education Ph.D. in Computer Science, University of Oldenburg, Germany Platzer's research interests center on logic-based verification of cyber-physical systems, hybrid systems, and programming languages. His work develops differential dynamic logic and tools like KeYmaera X to mathematically prove safety in autonomous systems, impacting areas such as transportation and medical robotics. Publication Trends : His recent work emphasizes invariant generation, formal verification of reinforcement learning, and quantifier elimination in Isabelle/HOL, aligning with his focus on mathematical guarantees for CPS safety. Awards ACM Doctoral Dissertation Honorable Mention NSF CAREER Award Popular Science Brilliant 10 Young Scientist IEEE Intelligent Systems AI's 10 to Watch Students : His advisees include award-winning researchers like Yong Kiam Tan (CMU Distinguished Dissertation Award), Katherine Kosaian (Bill McCune PhD Award), and Sarah Loos (CMU Honorable Mention). Labs : Founded the Logical Systems Lab at CMU and leads reliability research at KIT's Institute for the Reliability of Autonomous Dynamical Systems.

Enrico Tassiمشاهده پروفایل

پژوهشگر

• Interactive Theorem Proving
• Formal Verification
• Type Theory
• +۵ مورد دیگر

Enrico Tassi is a researcher at Inria, France, affiliated with the STAMP team. His work focuses on the technology of formal proofs, particularly type theory, interactive theorem proving, and its application to formalizing mathematics. He is a key contributor to the development of tools like Coq-Elpi , Hierarchy-Builder , and the small scale reflection Coq extension. His research spans proof assistant architecture, software design, and formal verification, with a strong emphasis on free software principles. Enrico completed his Ph.D. at the University of Bologna in 2008, where he designed the Matita interactive theorem prover. He contributed to the formalization of the Odd Order Theorem and the Paral-ITP project, aiming to scale Coq for large mathematical libraries. His software projects include Elpi , a meta-language for proof assistants, and past contributions to Debian as a developer (2006–2016), focusing on integrating the Lua language into Debian systems. His publications highlight innovations in unification algorithms, tactical design, and proof structuring techniques. Articles address challenges in bi-directional type inference, pattern-based proof command focusing, and nonuniform coercion implementations. His work on small-scale reflection and Hierarchy-Builder demonstrates expertise in algebraic hierarchies and formal library management. Current efforts target enhancing OCaml-based systems through Elpi's high-level programming capabilities. Key Collaborations : Mathematical Components team (INRIA), D.A.M.A. Project Major Tools : Coq-Elpi, Hierarchy-Builder, Matita Formalization Efforts : Ordered Uniformities, Odd Order Theorem, Finite Group Theory

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

Bow-Yaw Wang is a Professor in the Department of Computer Science and Information Engineering at National Taiwan University's College of Electrical Engineering and Computer Science, where he conducts foundational research in programming languages and formal verification methodologies. He received his Ph.D. from Yale University, establishing the theoretical framework for his expertise in software correctness and security analysis. His educational background enables rigorous approaches to complex computational problems. Wang's research centers on Programming Languages and Formal Methods , with significant contributions to Software Verification , Security , Cryptography , and Privacy . He develops static analysis techniques to eliminate vulnerabilities in cryptographic implementations and privacy-preserving systems, focusing on mathematical rigor to ensure software reliability in security-critical applications. Analysis of his publication trajectory reveals consistent innovation in verification frameworks, evolving from arithmetic overflow detection in cryptographic C programs (2019) to LLVM-based verification tools (2023) and probabilistic privacy models (2022). His work demonstrates increasing sophistication in bridging theoretical formal methods with practical security challenges. No major scientific awards are documented in available sources, though his sustained contributions to premier conferences like POPL, ASE, and VMCAI indicate significant peer recognition within the programming languages community. As an academic advisor, Wang mentors graduate students in programming languages and security research at National Taiwan University, though specific advisee names aren't enumerated in current datasets. Information regarding research grants remains undisclosed in publicly accessible materials. He maintains active research collaborations within National Taiwan University's programming languages group, focusing on advancing verification techniques for next-generation security-critical software systems.

Işıl Dilligمشاهده پروفایل

دانشیار

• Programming Languages
• Static Analysis
• Program Verification
• +۴ مورد دیگر

Işıl Dillig is an Associate Professor in the Department of Computer Science at the University of Texas at Austin, leading the UToPiA research group. She focuses on programming languages, with emphasis on static analysis, verification, and synthesis to enhance software reliability and security. Education: BS, MS, PhD in Computer Science from Stanford University Her research addresses critical challenges in: Program analysis for security and correctness Automated program synthesis for complex tasks Verification of concurrent and database-driven systems Recent publications span neurosymbolic synthesis, database integration, and smart contract optimization. Trends include hybrid AI-formal methods approaches and domain-specific language design. Scientific recognition includes: Sloan Fellowship NSF CAREER award She actively contributes to academic leadership as committee member, program chair, and keynote speaker in top conferences like PLDI, OOPSLA, and POPL.

Elsa L Gunterمشاهده پروفایل

استاد پژوهشی

• Formal Methods
• Programming Languages
• Software Engineering
• +۷ مورد دیگر

Elsa L Gunter is a Research Professor and Senior Lecturer at the University of Illinois at Urbana-Champaign's Department of Computer Science. Her academic background includes a Ph.D. in Mathematics from the University of Wisconsin, Madison. She leads research in formal methods, programming languages, and human-computer systems. Research Interests: Her work spans formal verification, programming language semantics, automated theorem proving, and security. She develops tools for compiler optimization verification, human-automation system safety, and concurrent program analysis. Key projects include the VeriF-OPT framework for parallel program transformations and Tutela for human-computer system protection analysis. Publications Focus: Her recent research emphasizes compiler verification, concurrency models, and human-system interaction. Work includes symbolic analysis for CSP, dependently-typed session systems, and robustness verification for safety-critical interfaces. Awards: Most Influential 10 Year Paper award at Requirements Engineering (RE 2010) EASST Best Software Science Paper at ETAPS 2001 Best Paper award at Fourth International Conference on Requirements Engineering (2000) Funding and Labs: Secured NSF grants for projects on parallel program verification ($450K) and human task analysis ($500K). Leads the Formal Methods and Verification Lab, collaborating with NASA on NextGen aviation systems. Student Advising: Mentored 7 PhD graduates and 12+ Master's students. Current PhD candidates work on secure distributed programming (Dennis Griffith) and formal methods for concurrent systems (Liyi Li, Susannah Johnson).

Nikita Kovalمشاهده پروفایل

پژوهشگر

• Concurrent Programming
• Kotlin Coroutines
• Concurrent Data Structures
• +۶ مورد دیگر

Nikita Koval is a Researcher at JetBrains , specializing in concurrent programming, Kotlin coroutines, and testing frameworks. His work bridges academic research with industrial application, focusing on synchronization primitives, lock-free data structures, and JVM-based concurrency tools. Academic rank: Researcher Affiliation: JetBrains Research interests include: Concurrent algorithm design and optimization Formal verification of synchronization mechanisms Testing frameworks for JVM-based languages Memory-efficient lock-free data structures Scalability in coroutine communication Distributed systems debugging Publication trends show a focus on Kotlin coroutines, JVM concurrency, and testing frameworks like Lincheck. His work spans algorithm design (union-find, queues), formal verification (CQS), and practical tools for concurrency testing (Lincheck) across conferences like PPoPP, PLDI, and ECOOP. Scientific recognition: Nikita received the Best Paper Award at OPODIS 2019 for his work on concurrent union-find algorithms. His contributions to Lincheck and CQS have been adopted into Kotlin's core libraries. Workshop leadership: He offers a 4-day corporate workshop on concurrent algorithms, covering testing, debugging, and implementation of lock-free data structures, now booked for Q3/Q4 2025. The curriculum includes hands-on Java/Kotlin coding with topics like segment queues, fetch-and-add queues, flat combining, and concurrent hash tables.

• Interactive Theorem Proving
• Formalization of Mathematics
• Proof by Reflection
• +۳ مورد دیگر

Kazuhiko Sakaguchi is a Researcher affiliated with CNRS (French National Centre for Scientific Research), École Normale Supérieure de Lyon (ENS Lyon) , and Université Claude Bernard Lyon 1 , working at the Laboratoire de l'Informatique du Parallélisme (LIP, UMR 5668) . His primary research focuses on foundational aspects of programming languages and formal verification. Research Interests: Sakaguchi specializes in interactive theorem proving (particularly using Coq), formalization of mathematics , and proof by reflection . His work bridges theoretical computer science and practical tool development, with applications in algorithm verification, algebraic hierarchies, and dependent type systems. Publication Trends: His recent articles emphasize formal verification of algorithms (e.g., mergesort correctness), design patterns for mathematical structures in proof assistants, and program extraction techniques. A consistent theme is enhancing productivity in theorem proving through reusable abstractions and automated tactics.

Kristóf Marussyمشاهده پروفایل

استادیار

• Model-Driven Engineering
• Dependability Analysis
• Logic Solvers
• +۶ مورد دیگر

Kristóf Marussy is an Assistant Professor at the Department of Artificial Intelligence and Systems Engineering , Budapest University of Technology and Economics , Hungary. His work bridges model-driven engineering with dependability analysis and logic solvers , focusing on critical cyber-physical systems in railway, automotive, and aerospace domains. Assistant Professor (2025–) Research Fellow (2023–2024), Assistant Research Fellow (2020–2023) Contributor to Refinery (graph solver for model generation) and Ferdium (open-source messaging suite) Research Interests center on: Formal Verification of critical system designs Automated Reasoning via logic/numerical solvers Graph Generation for testing data-driven systems AI Integration in system modeling Recent Publications demonstrate expertise in: Graph solver infrastructure (Refinery framework) Cyber-physical system architecture synthesis Formal methods for API key security (PKCE workflow) Constraint optimization in model generation Probabilistic analysis for system reliability Awards & Scholarships : 2024 EKÖP Postdoc Fellowship 2023 ÚNKP Researcher Prize 2023 Josef Heim Award for innovation 2021 OOPSLA Artifact Reviewer Recognition Academic Service includes committee roles at OOPSLA 2025, LLM4MDE 2024, ECOOP 2023, and FASE 2025. He actively mentors 7 BSc and 5 MSc students while contributing to European Space Agency's VAMPIR project on AI-enhanced positioning systems.

Oded Padonمشاهده پروفایل

استادیار

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

Oded Padon is a Senior Scientist (≈Assistant Professor) at the Weizmann Institute of Science , affiliated with the Faculty of Mathematics and Computer Science . He joined Weizmann in September 2024 after prior roles as a researcher at VMware Research Group , a postdoc in Alex Aiken's group at Stanford University , and a PhD student at Tel Aviv University under Mooly Sagiv . Research Interests : Oded's work focuses on developing principled algorithms for automated verification of complex systems, particularly distributed protocols, storage systems, and cluster management. He emphasizes decidable logics, primal-dual methods, and decomposition techniques. His recent interests include verification of deep neural networks , quantum computing , and leveraging large language models for verification tasks. Key projects: Ivy (safety/liveness verification), mypyvy (invariant inference), Verus (Rust verification), TASO (deep learning optimization), Quartz (quantum circuit superoptimizer). Scientific Awards : Azrieli Early Career Faculty Fellowship 2020 ETAPS Doctoral Dissertation Award 2017 Google PhD Fellowship in Programming Languages Radhia Cousot Young Researcher Best Paper Award (SAS 2017) Publications span decidable verification, invariant inference, quantum optimization, and machine learning for verification. His work has received Jay Lepreau Best Paper Award at SOSP 2024 (Anvil) and Distinguished Paper Awards at POPL 2024 (An Infinite Needle) and OOPSLA 2023 (Leaf).

Jonathan Sterlingمشاهده پروفایل

دانشیار

• semantics
• type theory
• category theory
• +۴ مورد دیگر

Jonathan Sterling is an Associate Professor in Logical Foundations and Formal Methods at the University of Cambridge , and a Fellow of Clare College . His research focuses on programming languages and formal methods , integrating type theory , category theory , domain theory , and topos theory to explore semantics of computation. His recent contributions include papers at POPL 2024 ( The Essence of Generalized Algebraic Data Types , Decalf: A Directed, Effectful Cost-Aware Logical Framework ), POPL 2022, and ICFP 2019. These works span logical frameworks , cost-aware programming , and modal dependent type theory , reflecting his interest in bridging theoretical insights with practical programming language design. Jonathan maintains active involvement in academic service, serving on program committees for OOPSLA, ICFP, POPL, TyDe, and WITS. He advocates for sustainable intellectual infrastructure, emphasizing the need for long-term funding models for tools like proof assistants and formal verification systems. His personal website and GitHub repositories ( @jonsterling ) host projects such as Agda-CAFe and RedTT , which explore formal methods and type theory.

Bernardo Toninhoمشاهده پروفایل

استادیار

• Type Theory
• Programming Languages
• Linear Logic
• +۵ مورد دیگر

Bernardo Toninho is an Assistant Professor at the School of Science and Technology, NOVA University of Lisbon, with a research focus on type theory and its applications to concurrent and distributed systems. He is affiliated with NOVA-LINCS and actively works on session types, linear logic, and program verification in languages like Go, Rust, and Haskell. Research interests include Type Theory, Programming Languages, Linear Logic, and Meta-programming Current teaching: Concurrent Programming Languages, Introduction to Programming (Fall 2022) Organizer of Programming Languages Mentoring Workshop (PLMW) at POPL 2019 Judge for Student Research Competition at SPLASH 2019 His work on Refinement Kinds (with Luís Caires) explores type-safe meta-programming by extending refinement types to the kind level. Articles highlight his contributions to session type theory, type systems for concurrency, and formal verification of channel-based communication. Scientific Awards Distinguished Reviewer Award (ESOP 2022) He has served on program committees for OOPSLA, ICFP, ESOP, and CONCUR, and contributed to foundational work in session types and linear logic. Projects include GOLEM (funded research) and Featherweight Go (formalization of Go's concurrency model).

Peisen Yaoمشاهده پروفایل

پژوهشگر

• Program Analysis and Verification
• Program Synthesis and Optimizations
• Logic and Automated Reasoning
• +۲ مورد دیگر

Peisen Yao is an academic researcher affiliated with Zhejiang University in China. His work spans programming languages, software engineering, and cybersecurity, with a focus on developing techniques to enhance software security, usability, and performance. He actively contributes to premier conferences as a committee member (e.g., PLDI, ICSE, ASE, ISSTA, OOPSLA, SAS). Research Focus: Yao's research integrates program analysis, verification, synthesis, and optimization. Key areas include: Advanced static analysis for security vulnerabilities (e.g., buffer overflows, divide-by-zero errors) Efficient symbolic abstraction and SMT solver testing Context-sensitive program analysis using formal language theory Automated invariant generation and code synthesis Publication Trends: His 15 most recent articles (2021–2025) emphasize scalable program analysis techniques, security validation, and practical tools for industry applications. Common themes include static analysis optimizations, formal verification, and novel testing methodologies for complex systems.

Julia Belyakovaمشاهده پروفایل

پژوهشگر

• Type Theory
• Programming Languages
• Theorem Proving
• +۳ مورد دیگر

Julia Belyakova is a Postdoctoral Researcher at Purdue University since 2023, focusing on type theory and programming languages. She earned her Ph.D. in Computer Science from Northeastern University (2023) and an M.S. from Southern Federal University (2014). Current Position: Postdoc, Purdue University Ph.D. Institution: Northeastern University Education: M.S. in Computer Science from Southern Federal University Her research spans type theory, programming languages, theorem proving, generic programming, compiler construction, and software testing . Recent work includes formalizing subtyping in Julia, analyzing type stability for JIT compilation, and type-theoretic approaches to program incorrectness. Trends in her publications emphasize empirical validation of type systems and compiler optimizations for dynamic languages. She has served on program committees for OOPSLA Review Committee (2025), TyDe Program Committee (2024), and ARRAY Committee (2024). No formal scientific awards are documented in the provided text.

Alvin Cheungمشاهده پروفایل

دانشیار

• Data Management
• Programming Languages
• Software Systems
• +۳ مورد دیگر

Alvin Cheung is an Associate Professor at the University of California at Berkeley, affiliated with the Department of Electrical Engineering and Computer Sciences (EECS). He leads the Data Systems and Foundations group, Programming Systems group, Sky Lab, and SLICE Lab, while also serving as a faculty affiliate at the Berkeley Institute for Data Science. His research focuses on integrating data management, programming languages, and software systems to develop tools for scalable data processing pipelines and improved data programming experiences. PhD students advised: Sahil Bhatia, Mick Kittivorawong, Jongseok Park Research keywords include Data Management , Programming Languages , Program Synthesis , Formal Verification , and Machine Learning . His recent work explores Verified Lifting techniques for database applications, stencil computations, and cloud systems, alongside novel programming paradigms for geospatial video analytics and speculative decoding. His publications from 2023-2025 demonstrate trends in LLM-driven code optimization , automated SQL equivalence , and neural code generation across domains like tensor operations and geospatial video systems. Notable scientific achievements include the Dahl-Nygaard Prize (2024) , VLDB Early Career Award (2023) , and CHI Best Paper Award (2021) .