<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>MABFuzz: Multi-Armed Bandit Algorithms for Fuzzing Processors · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2311.14594/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2311.14594/feed.xml" rel="self" type="application/rss+xml" /><item><title>MABFuzz: Multi-Armed Bandit Algorithms for Fuzzing Processors — mentioned by bartlettD</title><link>https://news.ycombinator.com/item?id=38910690</link><guid isPermaLink="false">urn:hackerpapers:mention:2311.14594:38910690</guid><pubDate>Mon, 08 Jan 2024 11:45:34 GMT</pubDate><description>&lt;p&gt;The claim here is that &amp;quot;existing hardware fuzzers are inefficient in verifying processors because they make many static decisions disregarding the design complexity and the design space explored&amp;quot;. &amp;quot;To address this limitation of static strategies in fuzzers, we develop an approach to equip any hardware fuzzer with a dynamic decision-making technique, multi-armed bandit (MAB) algorithms.&amp;quot; (From their paper: https://arxiv.org/pdf/2311.14594.pdf) They&amp;#x27;re saying their fuzzer is faster and better at finding bugs than other fuzzing aproaches.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2311.14594/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CR</category></item></channel></rss>
