MASTA: A Feedback-Scheduled Multi-Agent System for End-to-End Tamarin Protocol Modeling and Analysis
Yongkang Xiao ⋅ Qiyi Deng ⋅ Jing Chen ⋅ Min Shi ⋅ JU MA ⋅ Ruiying Du
Abstract
Tamarin-based formal verification of security protocols requires expert-authored multiset rewriting rules and temporal-logic lemmas. Translating a natural-language protocol description into a complete formal model with an LLM is hard because syntactic, reachability, and property-level errors compound across the multi-step modeling process, and a single agent that both authors and self-evaluates cannot reliably localize them. We present MASTA, a multi-agent system that addresses these difficulties through three innovations. First, an operational--evaluative role decomposition assigns rule modeling to an Architect, property modeling to an Auditor, and pure dispatch to a dedicated Arbiter that holds no authoring duties. Second, the Arbiter implements a Tamarin-anchored scheduler that dispatches the next agent based on the latest verifier verdict and routes problem-tagged fixes through a modification list, with a six-class problem taxonomy and an LLM deduplication check preventing routing deadlock. Third, we construct a benchmark of 10 protocols paired with 139 mutation variants and five fine-grained metrics that jointly assess model correctness ($M_1$--$M_3$) and completeness ($M_4$--$M_5$). On this benchmark MASTA on Qwen-3.5-Plus improves over OpenCode on the same backbone by up to $+0.27$ on individual metrics and reaches the highest overall average, surpassing Codex (GPT-5.5) and Claude Code (Opus~4.7) despite using a weaker LLM. Ablations confirm that removing the Arbiter collapses property and verification scores to near zero.
Chat is not available.
Successful Page Load