AI & ML
From Attack Tree to Model Checker: Binding CAPEC Patterns to Verify Robotic System Security
arXiv cs.CR0 views
arXiv:2611.22408v1 Announce Type: new Abstract: Security-minded verification of autonomous and robotic systems presupposes an attacker, yet the path from a threat catalogue to a checkable attacker model is still traversed by hand. This research preview presents the theory and construction of a pipeline that mechanises it. Each leaf of an attack tree is mapped to a CAPEC attack pattern and written in first-order logic as a rule: the attacker's prerequisites imply the attack's effect. Casting the pattern as such a rule is what makes it operational - its variables can be bound to a specific system's parts, and its prerequisites can then be tested against that system under a chosen configuration of security controls. Binding is our means of verifying whether a system is vulnerable to a given attack: from a bound pattern we derive an attacker model, turn its effect into a temporal-logic property, and check that property against the system with and without a countermeasure, reporting the control that defeats the attack. We describe the signature, schemas, profiles for approach, and explore how CAPEC can support reasoning about robotics security.
Source:https://arxiv.org/abs/2611.22408PreviousTetherMark: Instance-Level Watermark Authentication Against Cross-Instance TransplantationNextExploited Before It Was Fixed? Vulnerability Timelines from Open, Machine-Readable Evidence
Related posts

‘It’s a risk’: How Rockstar built the most detailed (and romantic) GTA yet
0The Verge
China dominates battery graphite, but this startup could break the monopoly
0TechCrunch
AI visibility: mentions, recommendations and citations need separate checks
0dev.to
Background AI Makes Inference a Scheduling Problem
0dev.to

DeepSeek vs Claude vs Kimi vs Codex vs Gemini: A 70-Call AI Ethics Test
0dev.to
Fluent English is not evidence of ASL understanding: lessons from building a video translator
0dev.to