RustHorn: CHC-based Verification for Rust Programs (full version)
Not on the map. Why?
Abstract (arXiv)
Reduction to the satisfiability problem for constrained Horn clauses (CHCs) is a widely studied approach to automated program verification. The current CHC-based methods for pointer-manipulating programs, however, are not very scalable. This paper proposes a novel translation of pointer-manipulating Rust programs into CHCs, which clears away pointers and memories by leveraging ownership. We formalize the translation for a simplified core of Rust and prove its correctness. We have implemented a prototype verifier for a subset of Rust and confirmed the effectiveness of our method.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 20 Feb 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 1; 2026: 3.
5 papers.
- 2025VeriSafe Agent: Safeguarding Mobile GUI Agent via Logic-based Action Verificationcited by 22
- 2026Token Budgets: An Empirical Catalog of 63 LLM-Agent Budget-Overrun Incidents, with an Affine-Typed Rust Mitigation as a Case Studycited by 6
- 2023Chronosymbolic Learning: Efficient CHC Solving with Symbolic Reasoning and Inductive Learningcited by 0
- 2026Verification Modulo Tested Library Contractscited by 0
- 2026Generative Compilation: On-the-Fly Compiler Feedback as AI Generates Codecited by 0
- 2026Generative Compilation: On-the-Fly Compiler Feedback as AI Generates Code15 Jul 2026
- 2026Token Budgets: An Empirical Catalog of 63 LLM-Agent Budget-Overrun Incidents, with an Affine-Typed Rust Mitigation as a Case Study2 Jun 2026
- 2026Verification Modulo Tested Library Contracts16 Apr 2026
- 2025VeriSafe Agent: Safeguarding Mobile GUI Agent via Logic-based Action Verification24 Mar 2025
- 2023Chronosymbolic Learning: Efficient CHC Solving with Symbolic Reasoning and Inductive Learning2 May 2023