Bridging Threat Models and Detections: Formal Verification via CADP

📅 2025-09-16
📈 Citations: 0
Influential: 0
📄 PDF

career value

167K/year
🤖 AI Summary
Existing threat detection rules lack formal consistency verification against advanced threat models. Method: This paper proposes a unified modeling and verification framework based on labeled transition systems: for the first time, it jointly maps GTDL-based detection rules and attack trees into the LNT (Language of Nested Transitions) formalism, and leverages the CADP toolset to automate system-level verification and iterative refinement via bisimulation and weak trace inclusion. The approach enables structured trace-semantics–driven parsing of attack trees, ensuring both completeness and precision in detecting threat behaviors. Results: Evaluated on real-world malware cases—including LokiBot and Emotet—the method successfully identified multiple semantic mismatches between detection logic and attack models, demonstrating its effectiveness and scalability. This work establishes the first end-to-end, automated formal verification paradigm for certifying the trustworthiness of detection rules.

Technology Category

Application Category

📝 Abstract
Threat detection systems rely on rule-based logic to identify adversarial behaviors, yet the conformance of these rules to high-level threat models is rarely verified formally. We present a formal verification framework that models both detection logic and attack trees as labeled transition systems (LTSs), enabling automated conformance checking via bisimulation and weak trace inclusion. Detection rules specified in the Generic Threat Detection Language (GTDL, a general-purpose detection language we formalize in this work) are assigned a compositional operational semantics, and threat models expressed as attack trees are interpreted as LTSs through a structural trace semantics. Both representations are translated to LNT, a modeling language supported by the CADP toolbox. This common semantic domain enables systematic and automated verification of detection coverage. We evaluate our approach on real-world malware scenarios such as LokiBot and Emotet and provide scalability analysis through parametric synthetic models. Results confirm that our methodology identifies semantic mismatches between threat models and detection rules, supports iterative refinement, and scales to realistic threat landscapes.
Problem

Research questions and friction points this paper is trying to address.

Formally verifying conformance between threat models and detection rules
Automating semantic mismatch identification through bisimulation verification
Translating detection logic and attack trees into common verification framework
Innovation

Methods, ideas, or system contributions that make the work stand out.

Formal verification framework using labeled transition systems
Automated conformance checking via bisimulation techniques
Translation to LNT modeling language for verification
🔎 Similar Papers
No similar papers found.
D
Dumitru-Bogdan Prelipcean
Bitdefender, Iași, Romania; Alexandru Ioan Cuza University, Iași, Romania; LACL, Université Paris-Est Créteil, France
C
Cătălin Dima
LACL, Université Paris-Est Créteil, France