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

~ similar to 2605.31269· 20 results

cs.CCRecentMay 31, 2026

Recursive Jump Operators and Optimal Proof Systems

Fabian Egidy

The paper investigates the relationship between optimal proof systems and recursive jump operators, showing that while the existence of a jump operator rules out optimality, the converse is provably h…

View →
cs.AIcs.CLcs.LORecentMay 27, 2026

Satisfiability Solving with LLMs: A Matched-Pair Evaluation of Reasoning Capability

Leizhen Zhang, Shuhan Chen, Sheng Chen

The paper evaluates LLM reasoning on Boolean satisfiability (SAT) problems, concluding that conventional metrics are misleading and proposing a paired-formula protocol with Accurate Differentiation Ra…

View →
cs.CRRecentApr 20, 2026

From Finite Enumeration to Universal Proof: Ring-Theoretic Foundations for PQC Hardware Masking Verification

Ray Iskander, Khaled Kirah

The paper provides the first machine-checked universal proof, using ring theory, that value-independence implies identical marginal distributions for arithmetic masking, thereby extending the verifica…

View →
cs.PLcs.CCcs.DBRecentJun 1, 2026

From Time to Space: The Impact of Linearity in Higher-Order Datalog

Angelos Charalambidis, Babis Kostopoulos, Panos Rondogiannis

The paper analyzes a fragment of Higher-Order Datalog, showing that restricting recursion to a linear form shifts its expressive power from time complexity to space complexity, specifically capturing…

View →
cs.AIcs.CLRecentMay 28, 2026

Locally Coherent, Globally Incoherent: Bounding Compositional Incoherence in Multi-Component LLM Agents

Anany Kotawala

The paper introduces a metric, the compositional residual eps*, to quantify how multi-component LLM agents violate basic probability axioms when combining local, coherent claims into a global predicti…

View →
cs.LOcs.CRRecentApr 11, 2026

A Constructive Proof of Rice's Theorem and the Halting Problem via Hilbert's Tenth Problem

Jonathan Brossard

The paper provides a constructive, intuitionistically valid proof of Rice's Theorem and the Halting Problem undecidability by reducing the problem to the undecidability of Hilbert's Tenth Problem (MRD…

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.CCcs.DSRecentMay 30, 2026

Search-space Reduction for Boolean MinCSPs via Essential Constraints

Bart M. P. Jansen, Ruben F. A. Verhaegh

The paper introduces a method to efficiently detect 'essential' constraints in Boolean MinCSPs, significantly reducing the search space for solving these problems and providing a dichotomy theorem for…

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.LOcs.CEcs.ETRecentJun 1, 2026

Federated Formal Verification: Cross-Backend Citation, Cross-Axis Convergence, and AI-Orchestrated Proof Dispatch for Production Systems

Pierre Falda

The paper proposes a federated formal verification architecture that treats verification as a polyglot proof system, successfully validating it on complex production subsystems like a Raft consensus m…

View →
cs.AIRecentJun 1, 2026

An Abstract Worlds Semantic Framework for Belief Change Operators

Daniel Grimaldi, M. Vanina Martinez, Ricardo O. Rodriguez

The paper introduces Abstract Worlds Semantics (AWS), a set-theoretic framework that treats worlds as primitive elements to provide a unified and generalized analysis of various belief change models.

View →
math.CTcs.CRRecentMar 17, 2026

From Torsors to Topoi: An Introduction with a View Toward $Σ$-Protocols in Cryptography

Takao Inoué

This paper provides a focused, preparatory introduction to sheaves and topoi, establishing the necessary structural background to understand the advanced sheaf-theoretic framework used in cryptographi…

View →
cs.AIRecentMay 31, 2026

Diagnosing LLM Arbitration Behavior over Pre-evidence Epistemic States in RAG-based Fact-Checking

Yuxi Sun, Wenbo Shang, Wei Gao, Xin Huang +1 more

The paper introduces a diagnostic testbed, PAVE, to evaluate how LLMs arbitrate between their internal knowledge and retrieved evidence during fact-checking, revealing that this arbitration is unrelia…

View →
cs.SEcs.CRquant-phRecentMay 1, 2026

Semantics-Based Verification of an Implemented Shor Oracle for ECDLP in Qrisp

Lei Zhang, Zhiyuan Chen

The paper introduces a semantics-first verification framework for an implemented Shor oracle for ECDLP in Qrisp, demonstrating that even seemingly correct implementations can fail due to subtle contro…

View →
cs.CCRecentMay 31, 2026

On the Complexity of Recurrence Evaluation

Artem Parfenov, Michael Vyalyi

This paper analyzes the computational complexity of evaluating recurrent functions, showing that the complexity depends heavily on how the input offsets are encoded and the structure of the recurrence…

View →
cs.AIRecentMay 28, 2026

Transforming and Encoding FTS for SAT Solving: What Helps, What Hurts (Extended Version)

João Filipe, Álvaro Torralba, Gregor Behnke

This paper investigates various methods for encoding factored tasks, a compact planning representation, into propositional logic for use with SAT solvers, analyzing the impact of encoding choices and…

View →
math.LOcs.CCTheoreticalRecentJun 11, 2026

Extended Frege proofs, circuits and rewriting

Jan Krajicek

This paper proves several properties about Extended Frege proof systems and circuit equivalence.

View →
cs.AIcs.CLcs.LGRecentMay 29, 2026

The Deterministic Horizon: When Extended Reasoning Fails and Tool Delegation Becomes Necessary

Dongxin Guo, Jikun Wu, Siu Ming Yiu

The paper demonstrates that extended pure neural reasoning fails on complex, deterministic state-tracking tasks beyond a certain 'Deterministic Horizon,' necessitating the integration of external tool…

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.CRcs.LOcs.PLRecentJun 1, 2026

Tridirectional Discriminating-Power Formal Verification of Smart Contract Reentrancy Defense Against Production-Deployed Solidity Source

Ray Iskander

The paper provides the first machine-checked, tridirectional correctness proof of the OpenZeppelin reentrancy-guard pattern against complex, production-deployed Solidity smart contract source.

View →