<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Formal Verification on Arthur P. Feeney</title><link>https://arthurfeeney.github.io/tags/formal-verification/</link><description>Recent content in Formal Verification on Arthur P. Feeney</description><generator>Hugo -- 0.156.0</generator><language>en</language><lastBuildDate>Wed, 06 Nov 2024 00:00:00 +0000</lastBuildDate><atom:link href="https://arthurfeeney.github.io/tags/formal-verification/index.xml" rel="self" type="application/rss+xml"/><item><title>BERN-NN-IBF: Enhancing Neural Network Bound Propagation Through Implicit Bernstein Form and Optimized Tensor Operations</title><link>https://arthurfeeney.github.io/papers/bern-nn/</link><pubDate>Wed, 06 Nov 2024 00:00:00 +0000</pubDate><guid>https://arthurfeeney.github.io/papers/bern-nn/</guid><description>This paper explores methods to perform efficient bounds-propagation on neural networks. Published in IEEE Transactions on Computer-Aided Design.</description></item></channel></rss>