ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Probabilistic program verification”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.PLTheoreticalRecentJul 20, 2026

Weakly Non-Negative Supermartingales for Omega-Regular Verification

Toru Takisaka, Hongjie Qing, Libo Zhang

The paper introduces lazy Streett supermartingales and their lexicographic extension to certify almost-sure satisfaction of omega-regular properties with polynomial templates under a broad class of sa…

View →
cs.PLTheoreticalRecentJun 26, 2026

Prophecy-Based Automated Verification of Message-Passing Programs

Takashi Nagatomi, Musashi Katsura, Naoki Kobayashi, Yusuke Matsushita +1 more

This paper proposes a method for verifying functional correctness of message-passing concurrent programs using Constrained Horn Clause (CHC) solving.

View →
cs.LOcs.PLEmpiricalRecentJun 26, 2026

KoAT: Automatic Complexity and Termination Analysis of Integer Programs

Nils Lommen, Éléanore Meyer, Jürgen Giesl

KoAT is a tool that automatically infers complexity bounds and proves termination of integer programs using an alternating modular analysis approach and a portfolio of techniques.

View →
cs.LGcs.PLEmpiricalRecentJul 6, 2026

InvWeaver: Deductive Feedback for Invariant Synthesis in Interacting-Loop Programs

Guangyuan Wu, Weining Cao, Zehui Tan, Yuan Yao +3 more

This paper introduces InvWeaver, a neuro-symbolic framework for synthesizing loop invariants in programs with multiple interacting loops.

View →
cs.PLcs.AIRecentMay 29, 2026

SEMBridge: Tagless-Final Program Semantics with Weakest-Precondition and Bounded-Checking Interpretations

Eric Liang

SEMBridge is a tagless-final framework that allows a single executable object program to generate multiple program semantics, including weakest-precondition and bounded-checking interpretations, ensur…

View →
cs.CRcs.LORecentMay 1, 2026

Zero-Knowledge Model Checking

Pascal Berrang, Mirco Giacobbe, Jacob Swales, Xiao Yang

The paper presents a novel technology that uses zero-knowledge proofs to formally verify a software system's correctness against a public specification without revealing the system's internal details.

View →
cs.PLcs.LOTheoreticalRecentJul 22, 2026

Towards Relating Ciao Assertions and LPTP Theorems

Marco Pérez, Pedro López-García, Jose F. Morales, Manuel V. Hermenegildo +1 more

This paper presents a translation scheme and correspondence analysis between Ciao assertions and LPTP formulae, enabling integration of assertion checking with LPTP-based deductive verification.

View →
cs.SEcs.AIRecentMay 28, 2026

Inferring Code Correctness from Specification

Tambon Florian, Papadakis Mike

The paper introduces TRAILS~, a novel method that improves code correctness validation by grounding LLM reasoning in concrete (input, output) pairs derived from specifications, achieving state-of-the-…

View →
cs.CCcs.AIcs.FLTheoreticalRecentJun 23, 2026

Token Complexity of Certifying Stochastic-Oracle Reliability

Jie Wang

This paper introduces a framework for certifying the reliability of stochastic oracles and derives bounds on the minimum expected token cost for reliable oracle certification.

View →
cs.PLTheoreticalRecentJul 1, 2026

Trustworthy Runtime Verification via Bisimulation (Extended Experience Report)

Ryan G. Scott, Ivan Perez, Alwyn E. Goodloe, Mike Dodds +1 more

This paper presents CopilotVerifier, a tool that generates proofs of correctness for the compiled output of the Copilot runtime verification framework.

View →
cs.SEcs.CRRecentMay 5, 2026

KVerus: Scalable and Resilient Formal Verification Proof Generation for Rust Code

Yuwei Liu, Xinyi Wan, Yanhao Wang, Minghua Wang +2 more

KVerus is a retrieval-augmented system that significantly improves the scalability and resilience of formal verification for Rust code by managing complex cross-module dependencies and adapting to cod…

View →
cs.LOcs.PLcs.SEEmpiricalRecentJun 16, 2026

Verifying the Rust Standard Library

Byron Cook, Remi Delmas, Zyad Hassan, Bart Jacobs +8 more

The largest reported verification campaign for the Rust standard library is presented, integrating complementary tools and analyzing effectiveness.

View →
quant-phcs.CRRecentMay 13, 2026

QCIVET: A Quantum--Classical Pipeline Integrity Framework with Contract-Based Subtype Verification and Hash-Chained Audit Traces

Esra Yeniaras, Muhammad Amin Karimov

QCIVET introduces a novel contract-based framework to ensure the integrity of hybrid quantum-classical pipelines by verifying both the structure (syntactic) and the behavior (semantic) of quantum stag…

View →
cs.AIcs.CRRecentMar 26, 2026

On the Foundations of Trustworthy Artificial Intelligence

TJ Dunham

The paper proves that platform-deterministic inference is a necessary and sufficient condition for trustworthy AI, establishing that AI trust fundamentally relies on consistent arithmetic.

View →
cs.SEcs.CRRecentMay 21, 2026

Finding Missing Input Validation in TEEs via LLM-Assisted Symbolic Execution

Chengyan Ma, Jieke Shi, Ruidong Han, Ye Liu +2 more

The paper introduces SymTEE, an LLM-assisted symbolic execution framework that detects missing input validation vulnerabilities in TEE applications without needing complex, real TEE setups.

View →
cs.SEcs.AIRecentMay 31, 2026

FVSpec: Real-World Property-Based Tests as Lean Challenges

Quinn Dougherty, Max von Hippel, Hazel Shackleton, Mike Dodds

The paper introduces FVSpec, a large-scale benchmark that translates thousands of real-world Python property-based tests into formal Lean 4 specifications to evaluate AI models for formal software ver…

View →
cs.SEcs.AIcs.CRRecentMay 11, 2026

Natural Language based Specification and Verification

Zhaorui Li, Chengyu Song

This paper proposes using large language models (LLMs) to generate and compositionally verify software implementations directly from natural language specifications, showing promising preliminary resu…

View →
cs.AIcs.SEEmpiricalRecentJun 18, 2026

AutoACSL: Synthesizing ACSL Specifications by Integrating LLMs with CPG-Based Static Analysis

Han Zhou, Yu Luo, Dianxiang Xu

AutoACSL is a framework that uses Code Property Graphs and large language models to generate formal specifications for C programs with improved success ratio and full proof ratio.

View →
cs.LGEmpiricalRecentJun 30, 2026

Calibration, Not Compilation: Detecting and Repairing Misspecified Probabilistic Programs Written by Language Models

Jian Xu, Delu Zeng, John Paisley, Qibin Zhao

This paper evaluates the effectiveness of Bayesian workflow for verifying statistical correctness of probabilistic programs written by language models, and compares it to unit tests and no feedback.

View →
cs.SEcs.CRRecentMay 11, 2026

AutoSOUP: Safety-Oriented Unit Proof Generation for Component-level Memory-Safety Verification

Paschal C. Amusuo, Ricardo Calvo, Dharun Anandayuvaraj, Taylor Le Lievre +4 more

AutoSOUP is a system that automates component-level memory-safety verification by generating Safety-Oriented Unit Proofs, leveraging a hybrid LLM-based architecture to overcome manual workflow limitat…

View →