DissProve demonstrates automated safety verification for parametric asynchronous distributed protocols classified as affine by backward unreachability using novel materialization, causality, and summarization.
Lorch, Bryan Parno, Michael L
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
years
2026 5representative citing papers
The bi-channel paradigm separates database networking into a high-performance UDP data path and a TCP control path to reduce kernel overhead while preserving reliability on fast cloud networks.
The paper introduces certified virtual cuts and proves per-key replay equality for wellformed DBLog runs, with all proofs machine-checked in Isabelle/HOL.
Agent-directed tree search improves LLM performance on Lean formal verification tasks, with context-based orchestration solving more intermediate specs at lower token cost than baseline agents.