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

~ similar to 2605.00487v1· 20 results

cs.DCcs.CRRecentApr 26, 2026

Towards System-Oriented Formal Verification of Local-First Access Control

Florian Jacob, Johanna Stuber, Hannes Hartenstein

The paper proposes a bottom-up, system-oriented approach to formally verify authorization algorithms for large-scale, Byzantine fault-tolerant local-first systems, using Rust and the Verus framework.

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.CRRecentMay 28, 2026

Bridging Theory and Practice: An Executable Taxonomy of Security Properties for ProVerif and Tamarin

Leonard Tudorache, Ivan Kurtev, Mark van den Brand

The paper introduces a systematic, executable taxonomy of security properties to bridge the gap between theoretical security definitions and their practical implementation in formal verification tools…

View →
cs.CRcs.FLcs.LORecentApr 16, 2026

Graded Symbolic Verification with a Fuzzy Dolev-Yao Attacker Model

Murat Moran

The paper introduces a graded symbolic verification method that models cumulative side-channel leakage, demonstrating that protocols safe under traditional binary attacker models can fail when continu…

View →
cs.CRcs.LORecentApr 15, 2026

KindHML: formal verification of smart contracts based on Hennessy-Milner logic

Massimo Bartoletti, Angelo Ferrando, Enrico Lipparini, Vadim Malvone

The paper introduces KindHML, an automated formal verification approach that uses Hennessy-Milner Logic and the Kind 2 model checker to verify complex temporal properties of smart contracts, detecting…

View →
cs.PLcs.CRcs.LORecentApr 10, 2026

A Deductive System for Contract Satisfaction Proofs

Arthur Correnson, Haoyi Zeng, Jana Hofmann

The paper develops a novel, sound, and complete deductive proof system for proving contract satisfaction, which is crucial for verifying CPU security against side-channel attacks.

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.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 →
cs.CRcs.AIcs.GTRecentApr 24, 2026

Reconstructive Authority Model: Runtime Execution Validity Under Partial Observability

Marcelo Fernandez - TraslaIA

The paper introduces the Reconstructive Authority Model (RAM), a novel framework that proves execution validity by assessing state coverage rather than just state integrity, showing that existing atte…

View →
cs.CRcs.AIcs.ETRecentApr 27, 2026

Agentic Witnessing: Pragmatic and Scalable TEE-Enabled Privacy-Preserving Auditing

Antony Rowstron

The paper proposes Agentic Witnessing, a TEE-enabled framework that allows external verifiers to audit the qualitative properties of private datasets by querying an LLM-based auditor without accessing…

View →
cs.PLcs.CRRecentApr 20, 2026

Compositional security definitions for higher-order where declassification

Jan Menz, Andrew K. Hirsch, Peixuan Li, Deepak Garg

The paper develops a compositional security definition for 'where declassification' in higher-order programs, allowing formal guarantees that private data is handled correctly when it is explicitly de…

View →
cs.CRcs.LORecentApr 14, 2026

COBALT-TLA: A Neuro-Symbolic Verification Loop for Cross-Chain Bridge Vulnerability Discovery

Dominik Blain

COBALT-TLA introduces a neuro-symbolic verification loop that successfully and autonomously discovers novel cross-chain bridge vulnerabilities by integrating an LLM with the TLA+ model checker.

View →
cs.CRcs.AIRecentApr 28, 2026

From CRUD to Autonomous Agents: Formal Validation and Zero-Trust Security for Semantic Gateways in AI-Native Enterprise Systems

Ignacio Peyrano

The paper proposes a Semantic Gateway and a Zero-Trust security model to formally validate and secure autonomous AI agents operating in enterprise systems, achieving a 100% discovery rate of unauthori…

View →
cs.CRcs.LORecentApr 4, 2026

Safety and Liveness of Cross-Domain State Preservation under Byzantine Faults: A Mechanized Proof in Isabelle/HOL

Jinwook Kim

The paper provides a mechanized proof in Isabelle/HOL guaranteeing both the safety (state preservation) and liveness (progress) of regulatory state transitions across multiple, heterogeneous blockchai…

View →
cs.CRRecentApr 5, 2026

Context-Binding Gaps in Stateful Zero-Knowledge Proximity Proofs: Taxonomy, Separation, and Mitigation

Yoshiyuki Ootani

The paper addresses the vulnerability of zero-knowledge proximity proofs in stateful systems by proposing Zairn-ZKP, a method that embeds operational context (like drop identity and policy version) di…

View →
cs.CRcs.AIcs.PLRecentMay 1, 2026

Certified Purity for Cognitive Workflow Executors: From Static Analysis to Cryptographic Attestation

Alan L. McCann

The paper introduces a certified purity architecture that strengthens governance in cognitive workflow systems by replacing insufficient runtime checks with cryptographically attested structural guara…

View →
cs.CRRecentApr 8, 2026

PSR2: A Phase-based Semantic Reasoning Framework for Atomicity Violation Detection via Contract Refinement

Xiaoqi Li, Xin Wang, Wenkai Li, Zongwei Li

The paper introduces PSR extsuperscript{2}, a novel static analysis framework that significantly improves the detection of atomicity violations in smart contracts by combining structural path searchin…

View →
cs.CRcs.FLRecentApr 4, 2026

From High-Level Types to Low-Level Monitors: Synthesizing Verified Runtime Checkers for MAVLink

Arthur Amorim, Paul Gazzillo, Max Taylor, Lance Joneckis

The paper introduces Platum, a novel framework that synthesizes verified, low-latency runtime monitors for MAVLink protocols, enabling robust enforcement of contextual message validity on resource-con…

View →
cs.CRRecentMay 9, 2026

Computer Science Conferences Should Require Nonrepudiable Experimental Results

Mamadou K. Keita, Christopher Homan

The paper argues that computer science conferences must mandate nonrepudiable, tamper-evident attestations of experimental results to ensure reported numbers accurately reflect executed computations.

View →