Boston Computation Club

Max von Hippel
  • 0.0（0）
  • 数学
  • アップデート：毎月

The Boston Computation Club is a small seminar group focused on mathematical computer science, and computational mathematics. Its name is plagiarized from the London Computation Club. Boston Computation Club meetings occur roughly every other week, on weekends, around 5pm EDT (modulo speaker availability). The usual format is a 20m presentation followed by 40m of discussion. Some, but not all, meetings are posted on YouTube and in podcast form.

  1. 2日前

    2/17/26: Approximately Aligned Decoding with Daniel Melcer

    Daniel Melcer is a PhD student at Northeastern University, where he researches formal methods, reinforcement learning, and large language models, among other things. Daniel also has the most colorful hair in the business (bright red for this talk, other colors for other occasions). Today he joined us to talk about some really exciting work he completed at Amazon, and to expand on his general vision of where constrained inference problems are heading in the future.

    49分

  2. 2月7日

    02/06/26: Early experiments in FMxAI at Galois with Max von Hippel

    Max von Hippel is ... me, the organizer and founder of the Boston Computation Club. Today I hosted an extremely informal event to chat about some of the early experiments in FMxAI I was involved with at Galois, two years ago.

    54分

  3. 1月17日

    VeriExploit: Automatic Bug Reproduction in Smart Contracts via LLMs and Formal Methods, Chenfeng Wei

    Chenfeng Wei is a PhD student at the University of Manchester, where he researches formal guarantees for large language models. Today he joined us to talk about his latest work exploring bugs in smart-contracts. This is a really interesting project at the intersection of explainable AI, smart contract debugging/security, and cybersecurity/symbolic analysis, and I hope you enjoy it as much as we did!

    42分

  4. 1月5日

    Breaking the Sorting Barrier for Directed Single-Source Shortest Paths - Xiao Mao

    Today Xiao Mao joined us to discuss his groundbreaking work, Breaking the Sorting Barrier for Directed Single-Source Shortest Paths. It's not every day you beat Djikstra at something. This was a good one. Thank you for talking to us, Xiao!

    58分

  5. 2025/09/15

    Infecting Generative AI with Viruses - David A. Noever and Forrest McKee

    David A. Noever and Forrest McKee are researchers at PeopleTec, where they work on problems at the intersection of security, defense, and AI/ML. Today David joined us to present their joint work Infecting Generative AI with Viruses. This was a really great presentation that took a rigorous approach to defining the security boundaries and limitations of AI tools, and it fostered one of the better discussions we've hosted in a while. We hope you enjoy it as much as we did!

    1時間

  6. 2025/08/15

    08/15/25: An LLM Agent for Functional Bug Detection in Network Protocols with Mingwei Zheng

    Mingwei Zhenga Ph.D. candidate in the Department of Computer Science at Purdue University, advised by Prof. Xiangyu Zhang since 2021. Before that, she received her Bachelor’s degree in Computer Science and Technology from Huazhong University of Science and Technology in 2020. Mingwei's research lies at the intersection of Large Language Models (LLMs) and Software Engineering. She builds LLM agents that combine program analysis with LLMs for deep codebase understanding that improve software correctness, robustness, and trustworthiness. Today Mingwei joined us to discuss some ongoing work which she previously presented at IEEE Security and Privacy LangSec, applying language models to bug detection in protocols with IETF RFCs. This was a great talk with deep, technical content and a good conversation. We hope you enjoy!

    57分

  7. 2025/08/02

    08/01/25: Formal Reasoning Meets LLMs: Toward AI for Mathematics and Verification with Kaiyu Yang

    Today Kaiyu Yang from Meta joined us to discuss formal reasoning using LLMs, particularly in the context of interactive theorem provers.  This is a really fast-moving and exciting field in which reinforcement learning and theorem proving combine to provide a new frontier for fully automated reasoning, and Kaiyu is at the bleeding edge of it.  We were really lucky to get an hour of Kaiyu's time and we hope you enjoy the talk as much as we did!

    1時間14分

  8. 2025/07/25

    07/25/25: RefinedC: Automating the Foundational Verification of C Code with Refined Ownership Types with Michael Sammler

    Michael Sammler n assistant professor leading the Programming Languages and Verification Group at the Institute of Science and Technology Austria (ISTA). Today he joined us to talk about his three primary projects: RefinedC, which uses a refinement and ownership type system to verify C code, Islaris, which shows how to scale verification of assembly code to realistic models of real-world architectures, and DimSum, which provides a decentralized approach for reasoning about multi-language programs (with a particular focus on RefinedC). We had a small but really dedicated crowd which facilitated an excellent discussion. This was a really fun one and we hope you enjoy it as much as we did!

    52分
すべて見る（82）

番組について

The Boston Computation Club is a small seminar group focused on mathematical computer science, and computational mathematics. Its name is plagiarized from the London Computation Club. Boston Computation Club meetings occur roughly every other week, on weekends, around 5pm EDT (modulo speaker availability). The usual format is a 20m presentation followed by 40m of discussion. Some, but not all, meetings are posted on YouTube and in podcast form.

情報

  • クリエイター
    Max von Hippel
  • 配信期間
    21年 - 26年
  • エピソード
    82
  • 制限指定
    不適切な内容を含む
  • Copyright
    © Max von Hippel
  • 番組のWebサイト
    Boston Computation Club