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

Alastair F. Donaldsonمشاهده پروفایل

استاد

• Programming Languages
• Compilers
• Verification
• +۲ مورد دیگر

Alastair F. Donaldson is a Professor in the Department of Computing at Imperial College London's Faculty of Engineering, where he leads the Multicore Programming Group. He also works as a Software Engineer at Google in the Android Graphics Team. Previously, he served as Director of GraphicsFuzz, an Imperial College spinout company acquired by Google in 2018. His research spans programming languages, compilers, verification, and testing, with a particular focus on randomized and fuzz testing techniques for compilers and program analyzers. Donaldson has developed several influential testing frameworks including GraphicsFuzz, RustSmith, and GrayC, which have significantly advanced compiler testing methodologies. Analysis of his recent publications reveals a strong trend toward practical applications of compiler testing techniques across diverse domains including GPU programming, verification-aware languages, and memory models. His work increasingly incorporates continuous integration practices and focuses on addressing real-world challenges in compiler development and verification. Donaldson maintains active involvement in the programming languages research community, serving on program committees for major conferences including PLDI, POPL, ASPLOS, and SPLASH. He has contributed significantly to advancing compiler testing methodologies and has mentored numerous researchers through PLMW (Programming Languages Mentoring Workshop). He leads the Multicore Programming Group at Imperial College London, which focuses on challenges in parallel and concurrent programming. His work bridges theoretical computer science with practical software engineering challenges, particularly in the areas of compiler correctness and verification.

Michael H. Borkowskiمشاهده پروفایل

استاد آموزشی

• Software Verification
• Type Theory
• Interactive Theorem Provers
• +۳ مورد دیگر

Michael H. Borkowski is an Assistant Teaching Professor in the Department of Computer Science at Purdue University. He earned his Ph.D. from the University of California, San Diego (UCSD), specializing in software verification, type theory, and interactive theorem provers. His research focuses on developing techniques to ensure software correctness and performance through formal methods. Ph.D., UCSD Computer Science (2024) M.S., UCSD Computer Science (2019) B.A., Amherst College Computer Science (2016) His research interests include refinement types, functional programming, and mechanizing proofs. Recent work emphasizes software verification tools (e.g., the 2024 POPL publication on refinement types). Earlier contributions span plant biology and applied mathematics, including studies on auxin gradients and wood grain modeling. Notable awards include the Computer Science Prize and Phi Beta Kappa from Amherst College. Teaching roles include courses at UCSD (e.g., CSE 20 Discrete Mathematics) and Purdue. He was affiliated with UCSD’s ProgSys Group during his Ph.D.

Hongjin Liangمشاهده پروفایل

دانشیار

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

Hongjin Liang is an Associate Professor at the School of Computer Science , Nanjing University , China. He is an active researcher and educator in the fields of programming languages and formal verification, with a strong focus on concurrency theory, mechanized proofs, and memory models. Education: PhD in Computer Science (May 2014), dissertation titled Refinement Verification of Concurrent Programs and Its Applications . Research Interests: His research spans formal verification , concurrent programming , memory models , and mechanized reasoning . He is particularly known for his work on verifying concurrent data structures, program logics for concurrency, and certified compilation. He is a member of the PLaX research group . Publications and Impact: Liang has published extensively in top-tier venues such as POPL, PLDI, ESOP, TOPLAS, and CSL-LICS. His work often involves formalizing and verifying complex concurrent systems using interactive theorem provers like Rocq/Coq. Notable contributions include verifying compiler optimizations under weak memory models and developing program logics for randomized concurrent programs. Scientific Awards: Distinguished Paper Award , PLDI 2019 for "Towards Certified Separate Compilation for Concurrent Programs" Teaching and Advising: He teaches undergraduate and graduate courses including Formal Semantics of Programming Languages , Concurrency: Algorithms and Theories , and Compiler Design . He has supervised graduate students and served on numerous program committees for international conferences. Affiliations: He is affiliated with the PLaX research group at Nanjing University and has collaborated with researchers such as Xinyu Feng, Zhong Shao, and Jan Hoffmann.

Albert Qiaochu Jiangمشاهده پروفایل

پژوهشگر ارشد

• Machine Learning
• Theorem Proving
• Artificial Intelligence
• +۳ مورد دیگر

Albert Qiaochu Jiang serves as a Visiting Research Fellow at the Department of Computer Science and Technology, University of Cambridge. His research integrates machine learning with formal theorem proving, focusing on neural theorem provers and mathematical reasoning systems. He leads the reasoning team at Mistral AI while maintaining academic supervision at Cambridge. His research interests center on machine learning for theorem proving , with specific expertise in neural-symbolic integration, autoformalization, and large language models for mathematical reasoning. His work bridges artificial intelligence with formal verification, developing systems that enhance automated reasoning capabilities through neural networks. Current projects involve improving premise selection for theorem provers, multilingual mathematical formalization, and creating efficient architectures for mathematical language models. Analysis of his recent publications reveals a strong focus on advancing neural theorem proving through innovative architectures like Target-Based Automated Conjecturing and Magistral. His research trajectory shows increasing sophistication in integrating language models with formal verification systems, with significant contributions to datasets like Numinamath and frameworks like Llemma. Key trends include optimizing compute efficiency in proof generation, enhancing multilingual mathematical reasoning, and developing interactive human-AI collaboration systems for formal mathematics. While no scientific awards are currently documented in available sources, his research output demonstrates significant impact in the intersection of AI and formal methods. As leader of Mistral AI's reasoning team, Jiang directs research on neural theorem proving systems while contributing to academic supervision at Cambridge. His work involves substantial industrial-academic collaboration, leveraging resources from both institutional contexts to advance mathematical AI. Current projects focus on creating practical systems for mathematical automation with real-world verification applications. His research operates at the intersection of academia and industry through Mistral AI's reasoning team, where he develops neural theorem proving systems with practical applications in formal verification. This dual affiliation enables rapid translation of theoretical advances into deployable tools for mathematical automation.

Delphine Demangeمشاهده پروفایل

دانشیار

• Programming languages implementation
• Compiler verification
• Formal semantics
• +۳ مورد دیگر

Delphine Demange is an Associate Professor in Computer Science at the University of Rennes, affiliated with Inria, CNRS, and IRISA. She works in the Epicure research group (formerly Celtique) and focuses on formal semantics, compiler verification, program transformations, static analysis, computer-aided verification, and language-based security. Her career spans roles at the University of Pennsylvania as a postdoctoral researcher and a PhD at ENS Cachan-Brittany Extension under Thomas Jensen and David Pichardie. Her research interests center on formal methods for programming languages , particularly through compiler verification , static analysis , and language-based security . She has mechanized semantics for dataflow circuits and SSA-based optimizations, bridging theoretical rigor with practical compiler correctness. Her work often leverages interactive theorem provers like Coq to ensure robustness. Delphine’s recent publications (2025–2010) highlight her expertise in formal verification of compilers, dataflow analysis , and concurrent systems . Notable trends include mechanized semantics for gated SSA and dataflow circuits , verified intermittent computing models, and concurrent garbage collectors using rely-guarantee methodologies. Scientific Awards: EAPLS Best PhD Dissertation Award (2012) Gilles Kahn PhD Thesis Award (2013) Teaching: She has taught undergraduate and master’s courses including Java programming, algorithmics, deductive verification with Why3, compilation, and software security. Her pedagogical contributions span functional programming, semantics, and logic. Professional Service: Delphine has served on steering committees for CC (2021–2024), co-chaired JFLA 2024 and 2023, and participated in program committees for conferences like CGO, OOPSLA, and POPL.

• Blockchain
• Cybersecurity
• Distributed Systems
• +۵ مورد دیگر

Roberto Zunino is an Associate Professor in the Department of Mathematics at the University of Trento, specializing in blockchain technologies, formal methods, and distributed systems. His research bridges theoretical computer science with practical cryptographic applications, particularly in Bitcoin and smart contract ecosystems. His research interests focus on blockchain security , smart contract formalization , and probabilistic verification . Key areas include MEV (Maximal Extractable Value) theory, UTXO-based smart contracts, and computationally sound tokenization. His work combines rigorous mathematical modeling with real-world protocol analysis, emphasizing security guarantees through formal methods. Recent publications demonstrate a strong trend toward theoretical foundations of blockchain economics and security. His 15 most recent papers (2020-2025) analyze MEV formalization, Bitcoin contract liquidity, UTXO scalability, and smart contract language design, revealing deep integration of type theory, game theory, and cryptographic primitives. Zunino actively teaches courses including Informatics , Interactive Theorem Proving (using Lean 4), and Computer Tools for Mathematics . His educational focus emphasizes formal verification, imperative programming foundations, and mathematical logic applications in computer science.

Jasmin Blanchetteمشاهده پروفایل

استاد

• Theorem Proving
• Formal Verification
• Automated Reasoning
• +۴ مورد دیگر

Prof. Dr. Jasmin Blanchette is a faculty member at the Ludwig Maximilian University of Munich, holding the chair in Theoretical Computer Science and Theorem Proving . She serves as Dean of Studies for Computer Science and collaborates with the VeriDis group at Loria, Nancy. Her research focuses on combining automatic and interactive theorem proving to enhance proof automation for critical systems and mathematical research. Key Research Areas: Higher-order logic, formal verification, superposition calculus, proof assistants (Isabelle/HOL, Lean), definitional mechanisms for (co)datatypes. Recent Articles address advanced topics in higher-order reasoning, SMT integration, and algorithm verification. Scientific Recognition: Co-awarded best papers at FroCoS 2023 and CADE 2023. Supervises a team of postdocs and PhD students working on projects like Matryoshka and Nekoka. Her tools (Sledgehammer, Nitpick) are widely used in formal methods.

• Security Protocols
• Protocol Analysis
• Formal Verification
• +۵ مورد دیگر

Alessandro Bruni is a Lecturer in Theoretical Computer Science at the IT University of Copenhagen, specializing in Programming Logic and Semantics within the Department of Computer Science. He is affiliated with the Center for Information Security and Trust and maintains an active research profile with numerous publications and projects spanning from 2016 to the present, including ongoing work through 2025. His research interests focus on Security Protocols, Protocol Analysis, Formal Verification, Ethical Hacking, Electronic Voting, and Internet of Things Security . Bruni's work bridges theoretical computer science with practical security applications, particularly in constrained environments like IoT devices. He has made significant contributions to the formal analysis of security protocols such as EDHOC (Ephemeral Diffie-Hellman Over COSE) using tools like Tamarin and ProVerif. Analysis of his recent publications (2023-2025) reveals a growing interest in differentiable logics and their formalization in proof assistants like Coq, alongside continued work on security protocols for constrained environments. His research increasingly intersects with machine learning verification and robust statistical methods for security applications. Bruni serves as Principal Investigator for multiple research projects including VeriFunAI: Verified Functional Analysis for Safe AI (funded by Carlsbergfondet, 2025), GAMESS: GAMification and Education for Secure Software (Danish Agency for Research and Education, 2023-2024), and the De Danske Cybermesterskaber (Danish Cyber Championships) funded by Industriens Fond. His projects consistently focus on formal verification, security education, and practical cybersecurity applications. As an active contributor to public discourse, Bruni has participated in media discussions about ethical hacking frameworks, EU cybersecurity directives, and security improvements for platforms like WhatsApp. His work demonstrates a commitment to both theoretical rigor and practical impact in the cybersecurity field.

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

دانشیار

• Automated Theorem Proving
• Higher-Order Logic
• Formal Verification
• +۳ مورد دیگر

Jasmin Christian Blanchette is an Associate Professor in the Theoretical Computer Science section at Vrije Universiteit Amsterdam, Netherlands. He holds visiting researcher positions at Loria (VeriDis group, Nancy, France) and the Max-Planck-Institut für Informatik (Automation of Logic group, Saarbrücken, Germany). Previously, he was a postdoc and PhD student at Technische Universität München (Germany) and worked as a software engineer and documentation manager for Trolltech (now The Qt Company) in Oslo, Norway. Education & Career : PhD in Computer Science, Technische Universität München (2008–2012) Postdoc at TU München (2012–2016) Software Engineering Experience: Trolltech (2000–2008) Research Focus : His work centers on automated theorem proving in higher-order logic, including tools like Sledgehammer, Nitpick, and Nunchaku. He develops definitional mechanisms for (co)datatypes and formalizes results in automated reasoning (IsaFoL) and number theory (Lean Forward). Key areas include superposition calculus, formal verification, and foundational logic frameworks. Grants : NWO Vidi 2017: "Lean Forward: Usable Computer-Checked Proofs for Number Theorists" ERC Starting Grant 2016: "Matryoshka: Fast Interactive Verification through Strong Higher-Order Automation" Advising & Collaborations : Supervised 3 PhD theses (names not listed). Collaborates with international groups and contributes to open-source theorem proving tools. Active in projects like Matryoshka and Lean Forward. Labs/Teams : Member of VeriDis (Loria) and Automation of Logic (MPI-INF) groups, focusing on interdisciplinary automated reasoning and formal methods.

Nicolas Magaudمشاهده پروفایل

استاد

• Formal Proofs
• Computer-Aided Formal Verification
• Discrete Geometry
• +۴ مورد دیگر

Nicolas Magaud is a Professor at the Université de Strasbourg, affiliated with the Département d'Informatique within the UFR Mathématique-Informatique. He leads research in formal proofs, type theory, and discrete geometry, focusing on applications in Coq proof assistant development. His work includes formalizing geometric theorems, automated proof techniques, and discrete models of real numbers like the Harthong-Reeb line. He has organized national conferences such as the GDR GPL 2024 and co-chaired the EuroProofNet COST action. Magaud has supervised multiple PhD students, including Alexandre Jean and David Braun, and contributed to projects like Galapagos (geometric algorithms and proofs). Research Interests: His primary areas are formal methods, proof engineering, and computational geometry. He develops tools for proof automation in geometry and explores certified combinatorial approaches. Recent work includes formalizing spreads/packings in projective spaces and integrating automated provers into Coq. Publications: Over 20 peer-reviewed articles, emphasizing formal proof development in geometry and type theory. Notable contributions include mechanizing projective geometry in Coq, formalizing Thales' theorem, and verifying GMP's square root algorithm. Recent focus areas include matroid-based provers and discrete real number representations. Grants & Administration: Co-leads the ICube Lab's research projects and serves on committees for the GDR GPL and HCERES. He was elected to the CNU27 (National University Council) and chairs the Master's program in Software Engineering. Magaud also coordinates interdisciplinary seminars and teaches advanced courses on proof systems and formal verification.

Emilio Jesús Gallego Ariasمشاهده پروفایل

پژوهشگر ارشد

• Theorem Proving
• Functional Programming
• Computer Music
• +۷ مورد دیگر

Emilio Jesús Gallego Arias is a non-tenured Research Fellow at the French National Center for Scientific Research (CNRS), hosted at the Institute of Fundamental Computer Research (IRIF) of CNRS and University of Paris Cité. He is also a member of the PiCube Inria team. Previously, he held postdoctoral positions at the University of Pennsylvania (2012–2014) and MINES ParisTech (2014–2019). His research spans mechanically-verified functional and logic programming , with a focus on the Coq proof assistant and the Mathematical Components Library . He develops tools like coq-lsp (language-server for Coq IDEs) and jsCoq (web interface), replacing earlier projects like SerAPI . His work bridges programming language theory , digital signal processing , and formal verification , particularly in the ANR FEEVER project for verifying Faust programs. His 15 most recent works (2014–2024) address type systems , differential privacy , and formal verification in domains like audio processing and mechanism design . Publications span journals (e.g., Journal of Privacy and Confidentiality), conferences (ICML, POPL, FARM), and workshops (CoqPL, UITP). He contributes to open-source projects (GitHub), including DFuzz (linear dependent types), DualQuery (privacy algorithms), and RAM (relational machine). He uses formal methods in collaborative development platforms (Gitter, GitLab) and advocates for free software and accessible audio technology .

David Pereiraمشاهده پروفایل

مدرس

• Formal Verification
• Real-Time Systems
• Programming Languages
• +۳ مورد دیگر

David Pereira is a Lecturer and Integrated PhD Researcher at the University of Porto, affiliated with CISTER Research Centre (ISEP). He holds a PhD in Computer Science from the MAP-i program (Universities of Minho, Porto, and Aveiro). His research focuses on formal verification techniques using the Coq theorem prover, mechanization of Kleene algebra, and application to real-time systems. He is actively involved in projects like MARS and IBEX, addressing challenges in cyber-physical systems and runtime verification. Education: BSc in Computer Science (2003, University of Porto) MSc in Computer Science (2007, University of Porto, specializing in formal logics for intelligent agents) PhD in Computer Science (MAP-i Program) Research Interests: Mechanized formal verification using Coq Formal methods for real-time and parallel programs IEC 61499 standard semantics and tool development Runtime monitoring in safety-critical systems Programming languages for real-time applications (e.g., Ada) Advising & Grants: Active contributor to projects like MARS (toolset for distributed systems), IBEX (cyber-physical programming), and RTFM-core (certified compilation). Has organized conferences like VERDI 2023 and participated in international events. Labs/Teams: Core member of CISTER Research Centre, involved in tool development (e.g., RTFM-4FUN) and formal verification frameworks.

• Formal Verification
• Theorem Proving
• Approximate Computing
• +۵ مورد دیگر

Sofiène Tahar is a Professor at Concordia University's Department of Electrical and Computer Engineering, affiliated with the Faculty of Engineering and Computer Science. His research focuses on formal verification, theorem proving, and their applications in cyber-physical systems, circuit design, and reliability engineering. He has authored over 300 publications in top-tier conferences and journals, including DATE, ICFEM, and FMCAD. Key research areas include formal methods for analog/digital circuits, approximate computing, stochastic systems, and safety-critical systems. His work bridges theoretical foundations (e.g., theorem proving in HOL) with practical engineering problems like circuit reliability and autonomous systems verification. Recent projects involve formal analysis of vehicular systems, energy-efficient approximators, and machine learning integration with formal verification frameworks. Tahar collaborates extensively with industry partners and holds leadership roles in international conferences, including co-chairing ICFEM 2023.

Zachary Tatlockمشاهده پروفایل

دانشیار

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

Zachary Tatlock is an Associate Professor at the Paul G. Allen School of Computer Science & Engineering , University of Washington , with a focus on Programming Languages . His research spans formal verification , compiler design , floating-point accuracy , and machine learning frameworks , unified by themes of making tricky code easier to write and ensuring correctness through rigorous proofs and empirical systems. His recent work includes unifying Datalog and equality saturation (PLDI 2023), exploring LLM-driven document markup (Programming with AI 2024), and advancing floating-point error analysis via interactive tools like Odyssey (UIST 2023). He leads the UW PLSE research group and co-organizes events like EGRAPHS and FPTalks . Key collaborations include verifying distributed systems in CakeML (ECOOP 2022) and developing egglog , an e-graph library with relational extensions (PLDI 2023). His teaching includes Solver-Aided Programming (CSE 507) and Grad PL (CSE 505), emphasizing both Greek (formalism) and graphs (empiricism) .

• Formal Methods
• Functional Programming
• Unifying Theories of Programming (UTP)
• +۷ مورد دیگر

Dr. Andrew Butterfield is a faculty member at the School of Computer Science and Statistics, Trinity College Dublin. He serves as Head of the Foundations and Methods Group and actively contributes to Lero: the Irish Software Research Centre. His research focuses on Formal Methods and Functional Programming, particularly the Unifying Theories of Programming (UTP) paradigm, with applications in clinical pathways, medical device software, and spacecraft operating systems. Current research includes developing UTP theories for shared-variable concurrency, rely/guarantee reasoning, and separation logic in collaboration with Jim Woodcock. He also explores Process Modelling Language (PML) semantics with John Noll and Anila Mjeda. His contributions feature proof-assistance tools like UTP2 Theorem Prover, UTP Calculator, and ReasonEq implemented in Haskell. Andrew leads funded projects such as ESA's RTEMS-SMP (2019) and SFI's FMHIDA (2016-2020). Past projects encompass formal verification of separation kernels, Handel-C language semantics, and NAND flash memory models. He has taught courses in Formal Methods, Functional Programming, and Concurrency, while serving on editorial and program committees including Formal Aspects of Computing.