ExVerus: Verus Proof Repair via Counterexample Reasoning
2026-03-30T08:52:03Z•604d29850ea540685b98894536a43046a1b63a664926d6dc1d9f15e6f53ae80b
C/PthreadJavaScript regexLLM-assisted repairOptP-hardPSPACE-hardReDoS riskSpotIt+SuperDPVerusconcurrencyconstraint miningcounterexample-guided synthesiscritical sectionsdata racesdatabase counterexamplesdifferential privacyepsilon-DP refutationformal verificationinvariantsmulti-thread critical sectionsprivacy breachproof assistants (Coq/Rocq/Cubical Agda)regular expressionssupermartingalestext-to-SQL evaluation
What happened
Collection of recent formal-methods and programming-language results with concrete security-relevance: EXVERUS introduces a counterexample-guided, LLM-based proof-repair loop for Verus that uses generated/validated counterexamples to synthesize inductive invariants and substantially improves proof success and robustness; a mechanized complexity analysis shows JavaScript regular-expression matching is PSPACE-hard (and OptP-hard) in realistic fragments, clarifying exploitable worst-case complexity (ReDoS risk) for engines that perform backtracking; SuperDP presents an automated, sound and semi‑/
Why it matters
A reviewed impact interpretation has not been published for this record.
Evidence and limitations
- Source ID
- arxiv_cs_pl
- Record identifier
- 604d29850ea540685b98894536a43046a1b63a664926d6dc1d9f15e6f53ae80b
- Enrichment time
- 2026-03-30T08:52:03Z
- AI-assisted enrichment
- Yes
This record may overlap with other records. Its enrichment can be incomplete or wrong, and machine assistance was used. Validate consequential decisions against the linked source and your own environment.