✅ Formal Verification - meib · Scour

One Word at a Time: Incremental Completion Decomposition Breaks LLM Safety ⚙️Compilers

Counterexample-Guided Interval Weakening 🪝eBPF

Test-Time Safety Alignment 🪝eBPF

From Coalgebraic Determinization to Belief Construction for Partial Observability 🔢Type Theory

Graph Construction and Matching for Imperative Programs using Neural and Structural Methods 🔍Static Analysis

OptProver: Bridging Olympiad and Optimization through Continual Training in Formal Theorem Proving 📊Algorithms

A Test Taxonomy and Continuous Integration Ecosystem for Dynamic Resource Management in HPC 🪝eBPF

Equivalence Checking of Quantum Circuits via Path-Sum and Weighted Model Counting ⚡Concurrency

SpecSyn: LLM-based Synthesis and Refinement of Formal Specifications for Real-world Program Verification 🔍Static Analysis

Benchmarking the Safety of Large Language Models for Robotic Health Attendant Control ⚙️Compilers

BenchGuard: Who Guards the Benchmarks? Automated Auditing of LLM Agent Benchmarks 🔍Static Analysis

ClassEval-Pro: A Cross-Domain Benchmark for Class-Level Code Generation ⚙️Compilers

Verification of Neural Networks (Lecture Notes) 🔍Static Analysis

From Prompt Risk to Response Risk: Paired Analysis of Safety Behavior of Large Language Model 🪝eBPF

On first-order model checking parameterized by the number of variables ⚡Concurrency

Defective Task Descriptions in LLM-Based Code Generation: Detection and Analysis ⚙️Compilers

Open Problems in Frontier AI Risk Management 🪝eBPF

Reelay: Online Temporal Logic Monitoring Framework 🔍Static Analysis

Reconstructive Authority Model: Runtime Execution Validity Under Partial Observability ⚡Concurrency

Verification of Correlated Equilibria in Concurrent Reachability Games ⚡Concurrency

Sign up or log in to see more results

Log in to enable infinite scrolling