SPEAR: An Engineering Case Study of Multi-Agent Coordination for Smart Contract Auditing
We present SPEAR, a multi-agent coordination framework for smart contract auditing that applies established MAS patterns in a realistic security analysis workflow. SPEAR models auditing as a coordinated mission carried out by specialized agents: a Planning Agent prioritizes contracts using risk-aware heuristics, an Execution Agent allocates tasks via the Contract Net protocol, and a Repair Agent autonomously recovers from brittle generated artifacts using a programmatic-first repair policy. Agents maintain local beliefs updated through AGM-compliant revision, coordinate via negotiation and auction protocols, and revise plans as new information becomes available. An empirical study compares the multi-agent design with centralized and pipeline-based alternatives under controlled failure scenarios, focusing on coordination, recovery behavior, and resource use.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Assessing Spear-Phishing Website Generation in Large Language Model Coding Agents
Large Language Models are expanding beyond being a tool humans use and into independent agents that can observe an environment, reason about solutions to problems, make changes that impact those environments, and underst…
SPEAR: Code-Augmented Agentic Prompt Optimization
Automatic prompt engineering (APE) rewrites prompts to improve downstream task performance, but existing APE loops treat the optimizer itself as a fixed pipeline. We port the code-as-action paradigm of CodeAct (Wang et a…
Prompt EngineeringValidation of an LLM-based Multi-Agent Framework for Protein Engineering in Dry Lab and Wet Lab
Recent advancements in Large Language Models (LLMs) have enhanced efficiency across various domains, including protein engineering, where they offer promising opportunities for dry lab and wet lab experiment workflow aut…
Protein DesignProtein Foldingscientific discoveryFASE: Fast Adaptive Semantic Entropy for Code Quality
Multi-agent code generation offers a promising paradigm for autonomous software development by simulating the human software engineering lifecycle. However, system reliability remains hindered by LLM hallucinations and e…
Code GenerationMultivariate Spearman's rho for aggregating ranks using copulas
We study the problem of rank aggregation: given a set of ranked lists, we want to form a consensus ranking. Furthermore, we consider the case of extreme lists: i.e., only the rank of the best or worst elements are known.…
Learning-To-Rank