Tag
John Regehr describes using tis-interpreter to search for undefined behavior in SQLite, finding bugs like dangling pointer uses and uninitialized reads that other tools missed.
A talk on formal methods, using the "thing-doer" three-step process as an example, illustrating how to find bugs in systems that don't yet exist. The opening was delayed by 8 minutes due to a hardware failure.
This paper presents two sound encodings (MIP and SMT) for multi-agent path planning with spatio-temporal and topological constraints expressed in STL-GO, and evaluates them on a multi-UAV search-and-rescue benchmark.
Hillel Wayne analyzes the historical and practical barriers preventing widespread adoption of formal methods in software engineering, distinguishing between formal specification and verification across code and design domains.
A researcher describes a project to mathematically formalize truth, justification, and trustworthiness of AI-generated claims, seeking input on formal methods, logic, and probability theory for building a 'Trust Engine'.
A blog post by Antithesis detailing bugs found in several open-source Raft consensus implementations, including HashiCorp Raft and OpenRaft, emphasizing the difficulty of testing distributed systems and the need for better tooling.
This paper introduces generative compilation, a method to obtain compiler feedback on partial programs during AI code generation, using a 'sealor' transformation that enables standard compilers to diagnose incomplete code. Evaluated on Rust coding tasks, it reduces non-compiling outputs and improves functional correctness by catching errors early.
The author shares their experience building a prototype to verify AI-generated financial claims, focusing on systems and engineering challenges like evidence reconciliation and deterministic verification, and invites conversations with like-minded engineers.
Theoria is a verification architecture that rewrites AI solutions into auditable state transitions, achieving high precision on HLE problems and detecting subtle errors like hidden premises and fabricated citations.
A formal core calculus for documents is presented, likely exploring type systems or semantics for document processing.
A method for contract-based compositional shielding that ensures global safety in multi-agent reinforcement learning without centralized runtime control, using local LTL obligations and a multi-armed bandit to optimize team reward.
ReSyn is a generalized recursive framework for synthesizing regular expressions from examples, aiming to improve upon existing synthesis techniques.
Jane Street, previously skeptical of formal methods, announces a shift in perspective and plans to build a team focused on formal methods, driven by the emergence of agentic coding which changes the cost/benefit calculus by reducing the cost of verification and increasing the need for reliable code.
Jane Street, previously skeptical about formal methods, is now building a team to use them, driven by AI and agentic coding that reduce costs and increase benefits for software verification.
This paper formalizes the numerical divergence between training and inference kernels in modern AI post-training pipelines, proposing a kernel contract specification and a chain of Lipschitz-style bounds to mitigate off-policy bias, slice-level regressions, and reproducibility issues.
A new paper surveying formal methods practitioners on the importance and tractability of applications to AI safety, accompanied by a broader plea for ambitious software verification.
Strabo is a research contribution that models Google's Universal Commerce Protocol (UCP) as a declarative Langshaw protocol and implements agents using the Peach programming model, demonstrating interoperability between formally-specified agents and Google's UCP agents for agentic AI e-commerce interactions.
This paper introduces a tree-based formal framework for modeling complementarity in multi-agent human-AI interactions, proving that complementarity is attainable in regression but obstructed in classification under natural conditions on local aggregation and loss functions.
This 1996 paper explores the reasons behind the increasing reliability of software despite the lack of formal proofs, discussing informal methods and engineering practices.
Hillel Wayne announces supplementary chapters for his book 'Logic for Programmers', covering topics like concurrent processes, first-order logic, Liskov's history rule, and orders.