<?xml version="1.0" encoding="utf-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
  <title>Awesome Vericoding: new entries</title>
  <link href="https://jgalego.github.io/awesome-vericoding/new.html"/>
  <link rel="self" href="https://jgalego.github.io/awesome-vericoding/feed.xml"/>
  <id>https://jgalego.github.io/awesome-vericoding/feed.xml</id>
  <updated>2026-11-17T13:15:06Z</updated>
  <author><name>Awesome Vericoding</name></author>
  <entry>
    <title>Jasmin</title>
    <link href="https://github.com/jasmin-lang/jasmin"/>
    <id>https://github.com/jasmin-lang/jasmin</id>
    <updated>2026-11-17T13:15:06Z</updated>
    <category term="Classic Vericoding › Verification-Aware Languages"/>
    <summary>Assembly-like language for high-speed cryptography with a verified compiler and proofs of safety and constant time (CCS 2017 paper).</summary>
  </entry>
  <entry>
    <title>AutoCorres2</title>
    <link href="https://www.isa-afp.org/entries/AutoCorres2.html"/>
    <id>https://www.isa-afp.org/entries/AutoCorres2.html</id>
    <updated>2026-11-17T13:15:06Z</updated>
    <category term="Classic Vericoding › Verifiers for Mainstream Languages › C"/>
    <summary>Translates C into monadic Isabelle/HOL code that is easier to reason about, used throughout the seL4 proofs (POPL 2014 paper).</summary>
  </entry>
  <entry>
    <title>CPAchecker</title>
    <link href="https://cpachecker.sosy-lab.org"/>
    <id>https://cpachecker.sosy-lab.org</id>
    <updated>2026-11-17T13:15:06Z</updated>
    <category term="Classic Vericoding › Verifiers for Mainstream Languages › C"/>
    <summary>Configurable software verifier for C that emits correctness witnesses and regularly wins SV-COMP categories (CAV 2011 paper).</summary>
  </entry>
  <entry>
    <title>RefinedC</title>
    <link href="https://plv.mpi-sws.org/refinedc/"/>
    <id>https://plv.mpi-sws.org/refinedc/</id>
    <updated>2026-11-17T13:15:06Z</updated>
    <category term="Classic Vericoding › Verifiers for Mainstream Languages › C"/>
    <summary>Automated, foundational verification of C in Rocq through refinement and ownership types (PLDI 2021 paper).</summary>
  </entry>
  <entry>
    <title>SeaHorn</title>
    <link href="https://github.com/seahorn/seahorn"/>
    <id>https://github.com/seahorn/seahorn</id>
    <updated>2026-11-17T13:15:06Z</updated>
    <category term="Classic Vericoding › Verifiers for Mainstream Languages › C"/>
    <summary>LLVM-based verifier that proves safety of C programs by solving constrained Horn clauses for inductive invariants (CAV 2015 paper).</summary>
  </entry>
  <entry>
    <title>KEVM</title>
    <link href="https://github.com/runtimeverification/evm-semantics"/>
    <id>https://github.com/runtimeverification/evm-semantics</id>
    <updated>2026-11-17T13:15:06Z</updated>
    <category term="Classic Vericoding › Verifiers for Mainstream Languages › EVM"/>
    <summary>Executable formal semantics of the Ethereum Virtual Machine in K, used to verify smart-contract bytecode (CSF 2018 paper).</summary>
  </entry>
  <entry>
    <title>LiquidJava</title>
    <link href="https://github.com/liquid-java/liquidjava"/>
    <id>https://github.com/liquid-java/liquidjava</id>
    <updated>2026-11-17T13:15:06Z</updated>
    <category term="Classic Vericoding › Verifiers for Mainstream Languages › Java"/>
    <summary>Refinement types for Java, written as annotations and checked by an SMT solver (ICSE 2023 paper).</summary>
  </entry>
  <entry>
    <title>RefinedRust</title>
    <link href="https://plv.mpi-sws.org/refinedrust/"/>
    <id>https://plv.mpi-sws.org/refinedrust/</id>
    <updated>2026-11-17T13:15:06Z</updated>
    <category term="Classic Vericoding › Verifiers for Mainstream Languages › Rust"/>
    <summary>Foundational verification of safe and unsafe Rust in Rocq, with automation from refinement types (PLDI 2024 paper).</summary>
  </entry>
  <entry>
    <title>Gillian</title>
    <link href="https://github.com/GillianPlatform/Gillian"/>
    <id>https://github.com/GillianPlatform/Gillian</id>
    <updated>2026-11-17T13:15:06Z</updated>
    <category term="Classic Vericoding › Verification Infrastructure"/>
    <summary>Multi-language platform for separation-logic verification and symbolic execution, with front ends for C and JavaScript (PLDI 2020 paper).</summary>
  </entry>
  <entry>
    <title>Integration Verification Across Software and Hardware for a Simple Embedded System</title>
    <link href="https://doi.org/10.1145/3453483.3454065"/>
    <id>https://doi.org/10.1145/3453483.3454065</id>
    <updated>2026-11-17T13:15:06Z</updated>
    <category term="Classic Vericoding › Verified Systems"/>
    <summary>Bedrock2 code, its compiler, and a RISC-V processor proved together in Rocq, end to end.</summary>
  </entry>
  <entry>
    <title>Logical Verification</title>
    <link href="https://github.com/lean-forward/logical_verification_2026"/>
    <id>https://github.com/lean-forward/logical_verification_2026</id>
    <updated>2026-11-17T13:15:06Z</updated>
    <category term="Classic Vericoding › Courses and Tutorials"/>
    <summary>Lean 4 course on functional programs, their semantics, and proofs about them, with the Hitchhiker's Guide to Logical Verification as its book.</summary>
  </entry>
  <entry>
    <title>CAV</title>
    <link href="https://i-cav.org"/>
    <id>https://i-cav.org</id>
    <updated>2026-11-17T13:15:06Z</updated>
    <category term="Community › Venues"/>
    <summary>Computer Aided Verification, the main conference for verification tools and algorithms.</summary>
  </entry>
  <entry>
    <title>Archive of Formal Proofs</title>
    <link href="https://www.isa-afp.org"/>
    <id>https://www.isa-afp.org</id>
    <updated>2026-11-17T13:15:06Z</updated>
    <category term="Meta"/>
    <summary>Over 900 Isabelle developments, including verified algorithms and data structures, refereed like a journal.</summary>
  </entry>
  <entry>
    <title>Proof of Correctness of Data Representations</title>
    <link href="https://doi.org/10.1007/BF00289507"/>
    <id>https://doi.org/10.1007/BF00289507</id>
    <updated>2026-11-17T11:51:14Z</updated>
    <category term="Classic Vericoding › Foundations"/>
    <summary>Hoare relates an abstract specification to its concrete data through an abstraction function, the idea behind ghost state and refinement.</summary>
  </entry>
  <entry>
    <title>Proving Theorems about LISP Functions</title>
    <link href="https://doi.org/10.1145/321864.321875"/>
    <id>https://doi.org/10.1145/321864.321875</id>
    <updated>2026-11-17T11:51:14Z</updated>
    <category term="Classic Vericoding › Foundations"/>
    <summary>Boyer and Moore's prover that invents inductions over recursive Lisp functions, the ancestor of ACL2.</summary>
  </entry>
  <entry>
    <title>An Axiomatic Proof Technique for Parallel Programs I</title>
    <link href="https://doi.org/10.1007/BF00268134"/>
    <id>https://doi.org/10.1007/BF00268134</id>
    <updated>2026-11-17T11:51:14Z</updated>
    <category term="Classic Vericoding › Foundations"/>
    <summary>Owicki and Gries extend Hoare logic to parallel programs by checking that each proof survives interference from the others.</summary>
  </entry>
  <entry>
    <title>Edinburgh LCF: A Mechanised Logic of Computation</title>
    <link href="https://doi.org/10.1007/3-540-09724-4"/>
    <id>https://doi.org/10.1007/3-540-09724-4</id>
    <updated>2026-11-17T11:51:14Z</updated>
    <category term="Classic Vericoding › Foundations"/>
    <summary>Gordon, Milner, and Wadsworth make theorems an abstract type that only inference rules can build, the small trusted kernel of HOL4 and Isabelle.</summary>
  </entry>
  <entry>
    <title>Simplification by Cooperating Decision Procedures</title>
    <link href="https://doi.org/10.1145/357073.357079"/>
    <id>https://doi.org/10.1145/357073.357079</id>
    <updated>2026-11-17T11:51:14Z</updated>
    <category term="Classic Vericoding › Foundations"/>
    <summary>Nelson and Oppen combine decision procedures for separate theories into one, the architecture inside every SMT solver.</summary>
  </entry>
  <entry>
    <title>Tentative Steps Toward a Development Method for Interfering Programs</title>
    <link href="https://doi.org/10.1145/69575.69577"/>
    <id>https://doi.org/10.1145/69575.69577</id>
    <updated>2026-11-17T11:51:14Z</updated>
    <category term="Classic Vericoding › Foundations"/>
    <summary>Jones's rely-guarantee reasoning: each process states the interference it tolerates and causes, so proofs of concurrent code compose.</summary>
  </entry>
  <entry>
    <title>An Early Program Proof by Alan Turing</title>
    <link href="https://doi.org/10.1109/MAHC.1984.10017"/>
    <id>https://doi.org/10.1109/MAHC.1984.10017</id>
    <updated>2026-11-17T11:51:14Z</updated>
    <category term="Classic Vericoding › Foundations"/>
    <summary>Morris and Jones reprint and annotate Turing's 1949 proof of a factorial routine, the first known program proof with assertions.</summary>
  </entry>
  <entry>
    <title>The Calculus of Constructions</title>
    <link href="https://doi.org/10.1016/0890-5401%2888%2990005-3"/>
    <id>https://doi.org/10.1016/0890-5401%2888%2990005-3</id>
    <updated>2026-11-17T11:51:14Z</updated>
    <category term="Classic Vericoding › Foundations"/>
    <summary>Coquand and Huet's dependent type theory, extended with inductive types into the logic of Rocq and Lean.</summary>
  </entry>
  <entry>
    <title>The Spec# Programming System: An Overview</title>
    <link href="https://doi.org/10.1007/978-3-540-30569-9_3"/>
    <id>https://doi.org/10.1007/978-3-540-30569-9_3</id>
    <updated>2026-11-17T11:51:14Z</updated>
    <category term="Classic Vericoding › Foundations"/>
    <summary>Barnett, Leino, and Schulte add contracts to C# and check them with the Boogie verifier, the direct ancestor of Dafny.</summary>
  </entry>
  <entry>
    <title>Resources, Concurrency, and Local Reasoning</title>
    <link href="https://doi.org/10.1016/j.tcs.2006.12.035"/>
    <id>https://doi.org/10.1016/j.tcs.2006.12.035</id>
    <updated>2026-11-17T11:51:14Z</updated>
    <category term="Classic Vericoding › Foundations"/>
    <summary>O'Hearn's concurrent separation logic, where threads own disjoint parts of the heap, the basis of Iris.</summary>
  </entry>
  <entry>
    <title>Program Verification: The Very Idea</title>
    <link href="https://doi.org/10.1145/48529.48530"/>
    <id>https://doi.org/10.1145/48529.48530</id>
    <updated>2026-11-17T11:51:14Z</updated>
    <category term="Classic Vericoding › Essays"/>
    <summary>Fetzer argues that a proof about a program cannot guarantee how a physical machine runs it, setting off a long CACM controversy.</summary>
  </entry>
  <entry>
    <title>The Science of Programming</title>
    <link href="https://doi.org/10.1007/978-1-4612-5983-1"/>
    <id>https://doi.org/10.1007/978-1-4612-5983-1</id>
    <updated>2026-11-17T11:51:14Z</updated>
    <category term="Classic Vericoding › Books"/>
    <summary>Gries on deriving a program and its loop invariants together from the specification.</summary>
  </entry>
  <entry>
    <title>C-to-Rust Translation Validation at the LLVM IR Level via AI-Assisted Refinement Proof</title>
    <link href="https://arxiv.org/abs/2611.18036"/>
    <id>https://arxiv.org/abs/2611.18036</id>
    <updated>2026-11-16T22:13:56Z</updated>
    <category term="AI Vericoding › Verified Translation"/>
    <summary>Validates C-to-Rust translation by proving in Rocq at the LLVM IR level that the Rust program refines the C program using AI-assisted refinement proofs.</summary>
  </entry>
  <entry>
    <title>Curriculum proof repair with learned counterexamples</title>
    <link href="https://arxiv.org/abs/2611.13627"/>
    <id>https://arxiv.org/abs/2611.13627</id>
    <updated>2026-11-16T22:13:45Z</updated>
    <category term="AI Vericoding › Proof and Annotation Synthesis › Rust and Verus"/>
    <summary>This framework repairs Verus proofs using learned counterexamples and reinforcement learning across seven benchmarks with 471 problems.</summary>
  </entry>
  <entry>
    <title>Automating Formal Verification with Reinforcement Learning and Recursive Inference</title>
    <link href="https://arxiv.org/abs/2605.30914"/>
    <id>https://arxiv.org/abs/2605.30914</id>
    <updated>2026-11-16T17:02:45Z</updated>
    <category term="AI Vericoding › Verified Code Generation"/>
    <summary>Thesis on training Dafny models with verifier rewards, where models exploited weak specifications, and on Lean proof search; adds the Dalek-Bench repository benchmark.</summary>
  </entry>
  <entry>
    <title>Agentic Verification of Software Systems</title>
    <link href="https://arxiv.org/abs/2511.17330"/>
    <id>https://arxiv.org/abs/2511.17330</id>
    <updated>2026-11-16T17:02:45Z</updated>
    <category term="AI Vericoding › Proof and Annotation Synthesis › Rocq"/>
    <summary>AutoRocq agent refines Rocq proofs through prover feedback, evaluated on SV-COMP tasks and Linux kernel modules.</summary>
  </entry>
  <entry>
    <title>Harnessing Code Agents for Automatic Software Verification</title>
    <link href="https://arxiv.org/abs/2607.06341"/>
    <id>https://arxiv.org/abs/2607.06341</id>
    <updated>2026-11-16T17:02:45Z</updated>
    <category term="AI Vericoding › Proof and Annotation Synthesis › Rocq"/>
    <summary>Lets a code agent choose its own proof strategy for Rocq instead of following a fixed retrieve-and-predict pipeline.</summary>
  </entry>
  <entry>
    <title>Testing, Credible Compilation, and Verification in the Axon Verified Compiler in Lean and Claude Code</title>
    <link href="https://arxiv.org/abs/2605.01660"/>
    <id>https://arxiv.org/abs/2605.01660</id>
    <updated>2026-11-16T17:02:45Z</updated>
    <category term="AI Vericoding › Field Reports"/>
    <summary>A compiler whose code and proofs were all written in Lean by Claude Code, with a process that combines testing, translation validation, and proof.</summary>
  </entry>
  <entry>
    <title>Introducing AlphaProof Code</title>
    <link href="https://deepmind.google/blog/introducing-alphaproof-code/"/>
    <id>https://deepmind.google/blog/introducing-alphaproof-code/</id>
    <updated>2026-11-16T17:02:45Z</updated>
    <category term="AI Vericoding › Field Reports"/>
    <summary>DeepMind reports agents writing over three million lines of Lean proof for Signal's core cryptography, verified down to machine instructions.</summary>
  </entry>
  <entry>
    <title>AdaCore</title>
    <link href="https://www.adacore.com"/>
    <id>https://www.adacore.com</id>
    <updated>2026-11-16T16:53:04Z</updated>
    <category term="AI Vericoding › Companies"/>
    <summary>Maintains SPARK and GNATprove, with commercial support for high-integrity Ada code.</summary>
  </entry>
  <entry>
    <title>Axiom</title>
    <link href="https://axiommath.ai"/>
    <id>https://axiommath.ai</id>
    <updated>2026-11-16T16:53:04Z</updated>
    <category term="AI Vericoding › Companies"/>
    <summary>Builds Lean-based tooling for machine-checked proofs, including the AXLE interactive proof environment.</summary>
  </entry>
  <entry>
    <title>Certora</title>
    <link href="https://www.certora.com"/>
    <id>https://www.certora.com</id>
    <updated>2026-11-16T16:53:04Z</updated>
    <category term="AI Vericoding › Companies"/>
    <summary>Develops the Certora Prover, which checks smart contracts against formal specifications.</summary>
  </entry>
  <entry>
    <title>Imandra</title>
    <link href="https://www.imandra.ai"/>
    <id>https://www.imandra.ai</id>
    <updated>2026-11-16T16:53:04Z</updated>
    <category term="AI Vericoding › Companies"/>
    <summary>Sells automated reasoning and formal verification tools for industrial software, built around ImandraX.</summary>
  </entry>
</feed>
