arXiv (OAI Expanded)
open access
From Automata Learning to Model Checking: Formal Security Verification of Black-Box Protocols
Security verification of communication protocols in industrial and safety-critical systems is challenging because implementations are often proprietary, accessible only as black boxes, and too complex for manual modeling. As a result, existing security testing approaches usually depend on incomplete
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Mining DTA with SMT by Exploiting Simple Elementary Language and Timed Augmented Prefix Acceptor#1123284
- A Lack of Robustness in Robustness Checking from Auspurg and Brüderl#236889
- Fixed point certificates for reachability and expected rewards in MDPs#1039242
- A Formal Framework for Noisy Runtime Verification#997342
- Strategy for Verifying Security Protocols with Unbounded Message Size#175878
Record · ID 1070439
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive