y0news
AnalyticsDigestsSourcesTopicsRSSAICrypto

#formal-verification News & Analysis

136 articles tagged with #formal-verification. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.

136 articles
AINeutralarXiv – CS AI · Jun 96/10
🧠

(Auto)formalization is supposed to be easy: Trellis process semantics for spelling out rigorous proofs

Researchers present Trellis, an autoformalization system that uses LLM agents within constrained workflows to convert natural language mathematical proofs into Lean formal code. The system achieves reliable formalization on modest computational budgets by enforcing incremental progress through iterative refinement, demonstrated by formalizing a recent Ramsey theory breakthrough.

AINeutralarXiv – CS AI · Jun 96/10
🧠

Discovering Expert-Level Nash Equilibrium Algorithms with Large Language Models

Researchers have developed LegoNE, a framework that enables large language models to automatically discover and formally verify polynomial-time algorithms for computing Nash equilibria in games. The system rediscovered existing optimal algorithms and discovered a new three-player algorithm that provably improves upon previous best-known guarantees, demonstrating that LLMs can innovate beyond established human design paradigms when augmented with formal verification tools.

AINeutralarXiv – CS AI · Jun 86/10
🧠

ScenicRules: An Autonomous Driving Benchmark with Multi-Objective Specifications and Abstract Scenarios

Researchers introduce ScenicRules, a new benchmark for evaluating autonomous driving systems that combines multi-objective prioritized specifications with formal environment models. The framework uses a Hierarchical Rulebook to encode driving objectives and their priority relations, enabling more realistic assessment of autonomous vehicle performance against human driving standards.

AINeutralarXiv – CS AI · Jun 56/10
🧠

LeanMarathon: Toward Reliable AI Co-Mathematicians through Long-Horizon Lean Autoformalization

LeanMarathon introduces a multi-agent system that automates the formalization of research mathematics in Lean, solving long-horizon verification challenges through an evolving blueprint architecture. The system successfully formalized seven theorems across recent research papers spanning four Erdős problems without requiring manual verification shortcuts, demonstrating progress toward reliable AI co-mathematics.

AIBearisharXiv – CS AI · Jun 56/10
🧠

Can LLMs Write Correct TLA+ Specifications? Evaluating Natural-Language-to-TLA+ Generation

Researchers conducted the first systematic evaluation of Large Language Models' ability to generate correct TLA+ formal specifications from natural language, testing 30 LLMs across 2,730 runs. Results show LLMs achieve only 8.6% semantic correctness despite 26.6% syntactic correctness, indicating current models cannot reliably produce formal specifications without expert oversight.

AIBullisharXiv – CS AI · Jun 56/10
🧠

Evaluating Agentic Configuration Repair for Computer Networks

Researchers benchmarked Large Language Models augmented with formal verification tools for automating network configuration repairs, finding that agentic architectures improve repair success by 12% and safety by 17% compared to base LLMs. The work addresses a critical infrastructure challenge where misconfigurations cause major Internet outages by demonstrating how AI agents with iterative validation capabilities outperform standalone language models.

AINeutralarXiv – CS AI · Jun 56/10
🧠

Safe Embodied AI for Long-horizon Tasks: A Cross-layer Analysis of Robotic Manipulation

A comprehensive survey examines safety mechanisms for embodied AI systems performing long-horizon robotic manipulation tasks, identifying critical gaps in current research across planning, policy design, and execution phases. The analysis reveals that while safety receives attention, evidence remains fragmented with limited formal guarantees, particularly for contact-rich manipulation scenarios in real-world deployment.

AINeutralarXiv – CS AI · Jun 56/10
🧠

TLA-Prover: Verifiable TLA+ Specification Synthesis via Preference-Optimized Low-Rank Adaptation

Researchers have developed TLA-Prover, a 20-billion-parameter AI model that significantly improves the synthesis of TLA+ formal specifications for distributed systems, achieving 30% correctness on verified benchmarks—roughly 3.5x better than previous baselines. The model combines supervised fine-tuning with repair-based policy optimization and uses TLC model checker feedback directly as a reward signal, eliminating the need for learned reward models.

AINeutralarXiv – CS AI · Jun 56/10
🧠

A Finite Certificate for the Positive $n=9$ Vasc Inequality

Researchers have proven the positive n=9 case of the Vasc cyclic inequality using a hybrid human-AI approach with the MechMath Agent Team, generating a finite certificate covering 40,320 sorted cones. The proof demonstrates the practical application of AI agents in mathematical verification, combining human mathematical reasoning with machine-generated computational verification.

AIBullisharXiv – CS AI · Jun 46/10
🧠

Characterizing initial human-AI proof formalization workflows

Researchers conducted mixed-methods studies on how mathematicians use AI tools to formalize proofs, finding that users prefer AI assistance while maintaining high-level control over proof discovery. A controlled user study showed participants achieved higher formalization accuracy with AI access than without, despite current tool limitations.

AINeutralarXiv – CS AI · Jun 46/10
🧠

Learning Admissible Heuristics via Cost Partitioning

Researchers have developed a machine-learning framework that learns to create admissible heuristics for optimal planning by leveraging cost partitioning and Lagrangian duality. The approach uses graph neural networks with Weisfeiler-Leman algorithms to generate cost weights that guarantee admissibility by construction, marking the first learned heuristic with formal optimality guarantees.

AINeutralarXiv – CS AI · Jun 45/10
🧠

A Normative Intermediate Representation for ASP-Based Compliance Reasoning

Researchers propose MONIR, a normative intermediate representation framework for automated compliance reasoning using Answer Set Programming (ASP). The system combines staged operational semantics with executable ASP compilation to evaluate regulatory adherence, demonstrated through application to Chinese ADAS (Advanced Driver Assistance Systems) regulations with LLM-assisted extraction pipelines.

AINeutralarXiv – CS AI · Jun 46/10
🧠

Tree-Based Formalization of Multi-Agent Complementarity in Human-AI Interactions

Researchers introduce a tree-based mathematical framework formalizing complementarity in human-AI interactions, proving that complementarity is theoretically achievable in regression tasks but fundamentally obstructed in classification under standard loss functions. The work provides formal conditions for when AI and human predictions can outperform individual agents.

AINeutralarXiv – CS AI · Jun 46/10
🧠

Abduction Prover in Isabelle/HOL

Researchers have developed the Abduction Prover, a new automation tool for Isabelle/HOL that enhances proof search capabilities in formal verification. By using abductive reasoning to identify useful conjectures, the tool addresses the significant automation limitations that increase the computational cost of formal verification projects.

AINeutralarXiv – CS AI · Jun 46/10
🧠

AlgoVeri: An Aligned Benchmark for Verified Code Generation on Classical Algorithms

Researchers introduced AlgoVeri, a unified benchmark for evaluating AI-generated formally verified code across three major verification systems (Dafny, Verus, and Lean). The benchmark reveals significant performance disparities depending on the verification language, with frontier AI models achieving 40.3% success in Dafny but only 7.8% in Lean, highlighting fundamental challenges in cross-paradigm code verification.

🧠 Gemini
AINeutralarXiv – CS AI · Jun 26/10
🧠

Certificate-Guided Evaluation of Reinforcement Learning Generalization

Researchers present a logic-driven framework using neural certificate functions to evaluate how well reinforcement learning algorithms generalize to unseen tasks. The method validates RL-generated trajectories against key conditions, with empirical results showing that lower certificate violations correlate with higher success rates on test tasks, establishing a principled benchmarking approach for RL generalization.

AI × CryptoBullishCrypto Briefing · Jun 16/10
🤖

Avichal Garg: Investing in crypto and fintech offers better long-term returns, the importance of formal verification in DeFi, and how tokens enable participatory capitalism | Empire

Avichal Garg argues that crypto and fintech investments may deliver superior long-term returns compared to the current AI investment boom, while emphasizing the critical role of formal verification in DeFi security and how tokenization enables broader participatory capitalism models.

Avichal Garg: Investing in crypto and fintech offers better long-term returns, the importance of formal verification in DeFi, and how tokens enable participatory capitalism | Empire
AINeutralarXiv – CS AI · May 286/10
🧠

Risk-Controlled Lean-as-Judge for Natural-Language Mathematical Reasoning

Researchers demonstrate that Lean formal proof verification produces unreliable signals for validating natural-language mathematical reasoning, with accuracy varying from 96% at high coverage to 20% at low coverage. They introduce COVCAL, a risk-control method that certifies when partial formal signals can be trusted, showing that feasibility depends critically on autoformalization quality and coverage rates.

AINeutralarXiv – CS AI · May 286/10
🧠

AssertLLM2: A Comprehensive LLM Benchmark for Assertion Generation from Design Specifications

Researchers introduce AssertLLM2, an open-source benchmark containing 83 real-world hardware designs to evaluate how well Large Language Models can automatically generate formal SystemVerilog Assertions from specifications. The benchmark uniquely incorporates buggy RTL variants to assess both bug prevention and bug detection capabilities, establishing more rigorous evaluation standards for LLM-assisted hardware verification.

AINeutralarXiv – CS AI · May 276/10
🧠

Which Changes Matter? Towards Trustworthy Legal AI via Relevance-Sensitive Evaluation and Solver-Grounded Reasoning

Researchers introduce LexGuard, an adversarial AI framework that improves legal reasoning in large language models by distinguishing legally relevant changes from irrelevant perturbations. The system uses formal logic and SMT solvers to ground legal decisions in statute interpretation, addressing systematic failures in existing legal AI systems to maintain appropriate sensitivity to material legal facts.

AINeutralarXiv – CS AI · May 276/10
🧠

Verus-SpecGym: An Agentic Environment for Evaluating Specification Autoformalization

Researchers introduce Verus-SpecGym, an evaluation environment for testing whether AI agents can automatically translate informal programming specifications into formal, machine-verifiable code. The benchmark reveals that frontier LLMs like Gemini 3.1 Pro achieve 77.8% accuracy on specification tasks, but generated specs remain brittle and frequently miss edge cases, input constraints, and validation rules that human experts catch.

🧠 Gemini
AINeutralarXiv – CS AI · May 276/10
🧠

Foundations of a Time-Consistent Counterfactual Actuarial Runtime for Autonomous AI Agents

Researchers propose a mathematical framework for autonomous AI agents that implements per-action insurance premiums based on counterfactual risk assessment against safe defaults. The system replaces traditional post-hoc liability coverage with real-time transaction-level risk tolls, establishing formal guarantees for runtime safety and budget constraints.

AINeutralarXiv – CS AI · May 276/10
🧠

Certified Causal Attribution for Real-Time Attack Forensics in 6G Network Slicing

Researchers introduce DA-GC, a certified causal attribution framework for detecting cross-slice attacks in 6G networks within strict 100ms latency constraints. The system combines resource-conditioned Granger causality with a formal Resource Contention Model to distinguish genuine attack propagation from spurious correlations caused by shared infrastructure, achieving 89.2% accuracy with mathematical proof of statistical validity.

AIBullisharXiv – CS AI · May 276/10
🧠

ReasonOps: A Unified Operational Paradigm for Trustworthy Verified LLM Reasoning

Researchers introduce ReasonOps, a unified operational framework that treats AI reasoning as a continuously monitored and verifiable process rather than isolated inference. The paradigm integrates formal verification, symbolic reasoning, and runtime assurance to address critical reliability gaps in LLM-based reasoning systems, particularly for safety-critical applications.

AINeutralarXiv – CS AI · May 276/10
🧠

ConVer: Using Contracts and Loop Invariant Synthesis for Scalable Formal Software Verification

ConVer is a compositional verification tool that leverages large language models and contract synthesis to formally verify C programs more efficiently than traditional bounded model checking. The tool achieves 82-96% success on simple benchmarks and 67% on complex programs, demonstrating significant progress in automated software verification despite limitations on recursive and loop-intensive code.

← PrevPage 4 of 6Next →