<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom" ><generator uri="https://jekyllrb.com/" version="3.10.0">Jekyll</generator><link href="https://pranavp2005.github.io/feed.xml" rel="self" type="application/atom+xml" /><link href="https://pranavp2005.github.io/" rel="alternate" type="text/html" /><updated>2026-02-12T22:31:39+00:00</updated><id>https://pranavp2005.github.io/feed.xml</id><title type="html">Pranav Pateriya</title><subtitle>Portfolio: distributed systems, fault tolerance, and systems engineering</subtitle><author><name>Pranav Pateriya</name><email>pranav.pateriya@stonybrook.edu</email></author><entry><title type="html">Verification of Distributed System using Verus</title><link href="https://pranavp2005.github.io/posts/2026/02/verus1/" rel="alternate" type="text/html" title="Verification of Distributed System using Verus" /><published>2026-02-10T00:00:00+00:00</published><updated>2026-02-10T00:00:00+00:00</updated><id>https://pranavp2005.github.io/posts/2026/02/blog-post-1</id><content type="html" xml:base="https://pranavp2005.github.io/posts/2026/02/verus1/"><![CDATA[<p>Verus is an open-source tool for formally verifying Rust programs. You write your executable Rust code alongside specifications (preconditions, postconditions, invariants) and optional proof code, and Verus uses automated SMT solvers to prove that the code satisfies those specs for all executions, without adding runtime checks.</p>

<p>It is aimed at verifying low-level systems code, leveraging Rust’s ownership and borrowing model to make reasoning about memory safety and aliasing more tractable.</p>]]></content><author><name>Pranav Pateriya</name><email>pranav.pateriya@stonybrook.edu</email></author><category term="rust" /><category term="formal verification" /><summary type="html"><![CDATA[Verus is an open-source tool for formally verifying Rust programs. You write your executable Rust code alongside specifications (preconditions, postconditions, invariants) and optional proof code, and Verus uses automated SMT solvers to prove that the code satisfies those specs for all executions, without adding runtime checks.]]></summary></entry></feed>