LIVE PULSE
5.0 Anthropic CEO Amodei calls for slower AI development and shared safety rules — 11 src2.7 Agility Robotics unveils Digit 5 humanoid for warehouses and factories — 2 src2.5 Apple ships rebuilt Siri with Google Gemini, but not in the EU — 2 src2.2 Siri AI in macOS 27 Golden Gate: FAQ, Germany availability, privacy questions — 2 src1.8 Sam Altman says OpenAI will not go public in 2026, citing AI safety concerns — 5 src1.4 OpenAI contractors review real ChatGPT conversations to rate responses, report says — 2 src1.4 Anthropic data retention policy prompts firms to limit Claude use for sensitive work — 1 src1.4 VoiceCodeBench arXiv paper proposes benchmark for exact structured-token recovery in speech recognition — 1 src1.4 Arabic-Russian Parallel Corpus and LLM Benchmark for Scientific Text — 1 src1.4 Study Analyzes Self-Reported Limitations in NLP Research — 1 src5.0 Anthropic CEO Amodei calls for slower AI development and shared safety rules — 11 src2.7 Agility Robotics unveils Digit 5 humanoid for warehouses and factories — 2 src2.5 Apple ships rebuilt Siri with Google Gemini, but not in the EU — 2 src2.2 Siri AI in macOS 27 Golden Gate: FAQ, Germany availability, privacy questions — 2 src1.8 Sam Altman says OpenAI will not go public in 2026, citing AI safety concerns — 5 src1.4 OpenAI contractors review real ChatGPT conversations to rate responses, report says — 2 src1.4 Anthropic data retention policy prompts firms to limit Claude use for sensitive work — 1 src1.4 VoiceCodeBench arXiv paper proposes benchmark for exact structured-token recovery in speech recognition — 1 src1.4 Arabic-Russian Parallel Corpus and LLM Benchmark for Scientific Text — 1 src1.4 Study Analyzes Self-Reported Limitations in NLP Research — 1 src
HEATPULSEAI MAGAZINES
FLIP · FOLLOW · SAVE
Log inSign up

#formal-methods

7 curated events
papersTODAY 04:00 UTC

Fast Online Synthesis of Robust Controlled Invariant Sets for Monotone Systems

A new arXiv paper addresses the challenge of computing controlled invariant sets in real time for safety-critical autonomous control, where conditions shift during operation. Standard synthesis methods scale poorly as state dimension grows, so the authors exploit monotone system structure to derive robust invariant sets more efficiently. The work targets applications needing formal safety certificates computed online rather than offline.

safety/control-theory/arxiv/formal-methods
papersTODAY 04:00 UTC

arXiv paper proposes framing LLM code generation through formal syntactic structure

A revised arXiv preprint argues that although large language models produce fluent-looking code, they offer no formal guarantee that their output is syntactically valid, and they usually ignore the hierarchical grammar of the target language. The work, titled "Weave of Formal Thought," proposes incorporating that structure directly rather than relying on surface-level fluency alone.

code-generation/formal-methods/llm/arxiv
papersSEP 10 04:00 UTC

Spec-Harness Measures and Improves Behavioral Adequacy of LLM-Generated Formal Specifications

A new arXiv paper introduces Spec-Harness, a framework for evaluating whether formal specifications written by large language models accurately capture a program's intended behavior. The work tackles the longstanding challenge that automatically producing reliable specifications typically requires specialized domain expertise. Beyond scoring, the harness is also designed to help refine LLM-synthesized specifications and raise their behavioral adequacy.

llm/formal-methods/benchmark/research
papersSEP 12 04:00 UTC

Causal Past Logic Proposed for Runtime Verification of LLM Agent Workflows

A new arXiv paper addresses how to monitor distributed LLM-agent workflows at runtime, where asynchronous execution means a decision can only rely on events causally visible to the agent making it. The authors introduce a causal past logic that treats events appearing earlier in a log as not necessarily available to every lifeline, and use it as the basis for runtime verification. The work targets correctness checking of multi-agent pipelines as they execute rather than only after the fact.

agents/runtime-verification/distributed-systems/formal-methods
papersSEP 12 04:00 UTC

Lean 4 Formalization Machine-Checks Dong-Yang Classification of Optimal (n,4) Binary Codes

Researchers produced a Lean 4 formal proof verifying Dong and Yang's classification of optimal finite-length (n,4) binary block codes for binary symmetric channels. The formalization was built largely by submitting the original paper's proofs to an AI tool. It illustrates both the promise and the current workflow of AI-assisted proof verification in coding theory.

formal-methods/lean4/coding-theory/ai-assistance
papersSEP 12 04:00 UTC

arXiv Paper Formalises Preservation of Undecidable Properties in Self-Modifying Systems

A new arXiv preprint introduces a formal operator, termed the semantic elevation operator, to analyse how static semantic properties behave when a system rewrites its own code. While Rice's theorem establishes the undecidability of such properties for ordinary programs, the paper examines whether undecidability is closed, or preserved, under self-modification. The work targets the theoretical foundations needed to reason about programs whose behaviour changes as they edit themselves.

research/formal-methods/self-modifying-code/theory
papersSEP 12 04:00 UTC

New Method Learns Non-Ground Clauses in SMT Solving

A new arXiv paper addresses a limitation in satisfiability modulo theories (SMT) solvers that handle quantified formulas by generating ground instances. In existing CDCL(T)-style pipelines, conflict analysis can only derive learned clauses over ground terms, which the authors argue restricts reasoning power. The work extends conflict-driven learning so that non-ground clauses can be learned directly during solving.

smt/theorem-proving/formal-methods/research