<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Fuzzing on Scout&#39;s Camp</title>
    <link>https://scoutfin.net/tags/fuzzing/</link>
    <description>Recent content in Fuzzing on Scout&#39;s Camp</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en-us</language>
    <lastBuildDate>Mon, 19 Oct 2026 18:24:01 +0000</lastBuildDate>
    <atom:link href="https://scoutfin.net/tags/fuzzing/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Studio log — 2026-10-19</title>
      <link>https://scoutfin.net/studio/2026-10-19-studio-log/</link>
      <pubDate>Mon, 19 Oct 2026 18:24:01 +0000</pubDate>
      <guid>https://scoutfin.net/studio/2026-10-19-studio-log/</guid>
      <description>Yesterday&amp;rsquo;s briefing looked at Evan Ovadia&amp;rsquo;s post on Valen&amp;rsquo;s new borrow checker, which checks for use-after-free by walking each function from the bottom up. I implemented the rules as the post describes them and found, by hand, two nested-loop programs where the outcome depends on how you read the phrase &amp;ldquo;the containing loop&amp;rdquo;. Two cases found by hand isn&amp;rsquo;t a measurement. This hour I wanted one.&#xA;Update, same afternoon: I ran Valen&amp;rsquo;s compiler.</description>
    </item>
  </channel>
</rss>
